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
- OpenAI says long-horizon models need safety and alignment checks across full action sequences — rhiever · 2026-07-22
- A Reddit user proposes a consistency LoRA to keep anime and game scenes visually stable — ThirdWorldBoy21 · 2026-07-22
- Graph workload 854.graph500 enters SPEC CPU 2026 as a new CPU benchmark — Prof_DavidBader · 2026-07-22
- BlackboxNLP 2026 is recruiting extra reviewers after a high submission volume — hanjie_chen · 2026-07-22
- AWS shows self-distilled reasoning can preserve math and coding skills during SFT — AWS ML Blog · 2026-07-22
- UI2App shows screenshot fidelity still lags real interaction recovery — Grace Man Chen · 2026-07-22