Simple Linear Corrections for Compression in Late Interaction
Not on the map. Why?
Abstract (arXiv)
Late-interaction (multi-vector) models represent documents using a set of token-level vectors, providing a middle ground between cross-encoders and dense encoders in terms of quality and cost of embedding. However, compared to the latter, the indices are costly to store and score. Pooling and pruning based compression techniques are deployed widely but deteriorate in quality noticeably with aggressive compression. We investigate whether a lightweight change to the scoring function can recover retrieval quality after document-vector compression. For each combination of encoder, compressor, and vector budget, we learn a global linear correction by distilling the uncompressed model's score distributions over candidate documents. The encoder and compressor remain frozen, and the correction can be applied to each query at search time or once, offline, to the stored vectors. We evaluate the method with ColBERTv2 and Jina v4 on MS MARCO and BEIR, and with ColPali2 on the ViDoRe v3 visual document retrieval benchmark. Experiments cover four training-free compression methods, multiple vector budgets, in-domain adaptation, and transfer from MS MARCO to BEIR. In the in-domain setting, the correction improves over baseline compression in 154 of 160 BEIR settings, while transfer from MS MARCO is more variable across models and datasets. We also find that matrices trained with synthetic queries can improve over baseline compression on ViDoRe v3. These results show that a small learned correction can recover some of the quality lost to compression without retraining the encoder or recompressing the documents.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 31 of its 47 references that are in the map. First posted on arXiv 9 Oct 2026.
Builds on
31 of 47 references.
References · 31
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
- 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
- 2024ColPali: Efficient Document Retrieval with Vision Language Modelscited by 195
- 2025On the Theoretical Limitations of Embedding-Based Retrievalcited by 104
- 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 101
- 2025jina-embeddings-v4: Universal Embeddings for Multimodal Multilingual Retrievalcited by 76
- 2023Survey of Vector Database Management Systemscited by 39
- 2025MetaEmbed: Scaling Multimodal Retrieval at Test-Time with Flexible Late Interactioncited by 39
- 2024MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodingscited by 32
19 more
- 2026ViDoRe V3: A Comprehensive Evaluation of Retrieval Augmented Generation in Complex Real-World Scenarioscited by 26
- 2024Reducing the Footprint of Multi-Vector Retrieval with Minimal Performance Impact via Token Poolingcited by 25
- 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruningcited by 20
- 2021A Study on Token Pruning for ColBERTcited by 15
- 2025Efficient Constant-Space Multi-Vector Retrievalcited by 12
- 2026Nemotron ColEmbed V2: Top-Performing Late Interaction Embedding Models for Visual Document Retrievalcited by 10
- 2026Sculpting the Vector Space: Towards Efficient Multi-Vector Visual Document Retrieval via Prune-then-Merge Frameworkcited by 10
- 2026Multi-Vector Index Compression in Any Modalitycited by 10
- 2026Visual Late Chunking: An Empirical Study of Contextual Chunking for Efficient Visual Document Retrievalcited by 8
- 2026Multi-Vector Embeddings are Provably More Expressive than Single Vector Embeddingscited by 5
- 2026Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similaritycited by 5
- 2024Static Pruning in Dense Retrieval using Matrix Decompositioncited by 3
- 2025M3DR: Towards Universal Multilingual Multimodal Document Retrievalcited by 3
- 2026A Brief Comparison of Training-Free Multi-Vector Sequence Compression Methodscited by 3
- 2026Quantifying and Expanding the Theoretical Capacity of Late-Interaction Retrieval Modelscited by 3
- 2026Retrieval Needs Multivectors: An Exponential Separationcited by 3
- 2026Multivector Reranking in the Era of Strong First-Stage Retrieverscited by 2
- 2026Learn to Pool: Lightweight Fine-Tuning for Flexible Multi-Vector Compressioncited by 2
- 2026EigenLI: Spectral Approximations to Late Interactioncited by 1
Built on by
Not cited yet.