Hierarchical Pooling: Compression for Late-Interaction Retrieval Models
antoine_chaffin · x · 2026-07-07
Background: The author previously proposed "hierarchical pooling" to compress the storage of late-interaction retrieval models (like ColBERT variants) by performing hierarchical clustering on document embeddings and iteratively merging the closest clusters. This method halves storage losslessly and can be generalized across multiple modalities. Blog and paper links are included.
More from Research
- Causal-only attention for non-generative tasks is wasteful, argues HF engineer — antoine_chaffin · 2026-09-11
- Catholic University of Chile researcher: scaling AI feedback is key to sustainable medical education — julianvarascom · 2026-09-11
- Nature paper images cellular activity across all organs, revealing body-wide circuits — arjunrajlab · 2026-09-11
- SignNet 1M Dataset Released for Sign Language Research — ducha_aiki · 2026-09-11
- ECCV26 Oral: Flow Matching Enables Single-Stage Multi-View Point Cloud Registration — ducha_aiki · 2026-09-11
- InFlux++ Method Released — ducha_aiki · 2026-09-11