cs.IRFeb 24, 2026

Multi-Vector Index Compression in Any Modality

Authors: Hanxiang Qin, Alexander Martin, Rohan Jha, Chunsheng Zuo, Reno Kriz, Benjamin Van Durme

Organizations: Johns Hopkins University, Baltimore, MD, USA

Abstract

We study efficient multi-vector retrieval for late interaction in any modality. Late interaction has emerged as a dominant paradigm for information retrieval in text, images, visual documents, and videos, but its computation and storage costs grow linearly with document length, making it costly for image-, video-, and audio-rich corpora. To address this limitation, we explore query-agnostic methods for compressing multi-vector document representations under a constant vector budget. We introduce four approaches for index compression: sequence resizing, memory tokens, hierarchical pooling, and a novel attention-guided clustering (AGC). AGC uses an attention-guided mechanism to identify the most semantically salient regions of a document as cluster centroids and to weight token aggregation. Evaluating these methods on retrieval tasks spanning text (BEIR), visual-document (ViDoRe), and video (MSR-VTT, MultiVENT 2.0), we show that attention-guided clustering consistently outperforms other parameterized compression methods (sequence resizing and memory tokens), provides greater flexibility in index size than non-parametric hierarchical clustering, and achieves competitive or improved performance compared to a full, uncompressed index. The source code is available at: github.com/hanxiangqin/omni-col-press.

Figures & tables

Explore similar work

CardsList
  1. MAGIC: Marginal-Guided Compression with Optimal Transport for Efficient Visual Document Retrieval

    Sep 17, 2026Xu Yuan, Hua Liu, Wenqi Fan +1Visual Document RetrievalEmbedding Compression

  2. AdaMerge: Tuning-Free Patch Compression for Multi-Vector Visual Document Retrieval

    Sep 18, 2026Jianxin You, Kun NiVisual Document RetrievalVisual Token Compression