mlsanityData to 14 Oct 2026

EigenLI: Spectral Approximations to Late Interaction

arXiv 2609.07561 ↗First posted 7 Sep 2026cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Late-interaction models such as ColBERT achieve strong effectiveness by representing each document with many token-level vectors, but this expressivity leads to large indexing cost, storage footprints and expensive MaxSim scoring. We show that late-interaction representations exhibit an intrinsic low-rank structure: document token embeddings concentrate in a low-dimensional subspace that preserves most of the retrieval signal. Leveraging this observation, we introduce EigenLI, a spectral approximation framework that compresses late-interaction representations via document-specific low-dimensional subspaces. Unlike clustering or pooling methods, EigenLI identifies the dominant eigendirections of each document and uses them to construct reduced interaction representations. Empirically, k-EigenLI with k ≤ 32 outperforms k-means and Ward clustering based pooling methods on ColBERTv2 and AnswerAI-ColBERT-small; GTE-ModernColBERT exhibits a different tradeoff at k=32, where clustering methods perform better. The same spectral construction also yields EigenLI-SV, an ANN-compatible single-vector representation derived from the second-order summary of the reduced structure. Across multiple datasets and all three text models, EigenLI-SV consistently outperforms comparable single-vector surrogates such as MUVERA.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 33 of its 49 references that are in the map. First posted on arXiv 7 Sep 2026.

Builds on

33 of 49 references.

References · 33

  1. 2017Billion-scale similarity search with GPUscited by 2,497
  2. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  3. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
  4. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
  5. 2024ColPali: Efficient Document Retrieval with Vision Language Modelscited by 195
  6. 2025On the Theoretical Limitations of Embedding-Based Retrievalcited by 104
  7. 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 101
  8. 2025jina-embeddings-v4: Universal Embeddings for Multimodal Multilingual Retrievalcited by 76
  9. 2025MetaEmbed: Scaling Multimodal Retrieval at Test-Time with Flexible Late Interactioncited by 39
  10. 2021FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Searchcited by 38
  11. 2023Rethinking the Role of Token Retrieval in Multi-Vector Retrievalcited by 31
  12. 2024Reducing the Footprint of Multi-Vector Retrieval with Minimal Performance Impact via Token Poolingcited by 25
21 more
  1. 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruningcited by 20
  2. 2025PyLate: Flexible Training and Retrieval for Late Interaction Modelscited by 18
  3. 2025WARP: An Efficient Engine for Multi-Vector Retrievalcited by 17
  4. 2021A Study on Token Pruning for ColBERTcited by 15
  5. 2025Efficient Constant-Space Multi-Vector Retrievalcited by 12
  6. 2025Fantastic (small) Retrievers and How to Train Them: mxbai-edge-colbert-v0 Tech Reportcited by 10
  7. 2026Nemotron ColEmbed V2: Top-Performing Late Interaction Embedding Models for Visual Document Retrievalcited by 10
  8. 2026Sculpting the Vector Space: Towards Efficient Multi-Vector Visual Document Retrieval via Prune-then-Merge Frameworkcited by 10
  9. 2026Multi-Vector Index Compression in Any Modalitycited by 10
  10. 2026Visual Late Chunking: An Empirical Study of Contextual Chunking for Efficient Visual Document Retrievalcited by 8
  11. 2026Multi-Vector Embeddings are Provably More Expressive than Single Vector Embeddingscited by 5
  12. 2026Near-Optimal Dimension Lower Bounds for Single-Vector Embeddings of Maximum Inner Product Similaritycited by 5
  13. 2026ColBERT-Zero: To Pre-train Or Not To Pre-train ColBERT modelscited by 4
  14. 2026On Strengths and Limitations of Single-Vector Embeddingscited by 4
  15. 2024Static Pruning in Dense Retrieval using Matrix Decompositioncited by 3
  16. 2025M3DR: Towards Universal Multilingual Multimodal Document Retrievalcited by 3
  17. 2026A Brief Comparison of Training-Free Multi-Vector Sequence Compression Methodscited by 3
  18. 2026Quantifying and Expanding the Theoretical Capacity of Late-Interaction Retrieval Modelscited by 3
  19. 2026Retrieval Needs Multivectors: An Exponential Separationcited by 3
  20. 2025Simple Projection Variants Improve ColBERT Performancecited by 2
  21. 2026Learn to Pool: Lightweight Fine-Tuning for Flexible Multi-Vector Compressioncited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.