Proves that for bounded n, there exist MV embeddings with m vectors each whose Chamfer matrix requires single-vector dimension D = (ε² m)^Ω(1/ε) to approximate within ε, separating MV from SV expressiveness.
Multi-vector retrieval as sparse align- ment.arXiv preprint arXiv:2211.01267,
3 Pith papers cite this work, alongside 4 external citations. Polarity classification is still indexing.
3
Pith papers citing it
4
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
ColChunk adaptively chunks visual document patches into contextual multi-vectors via clustering, cutting storage by over 90% while raising average nDCG@5 by 9 points.
A Voronoi cell estimation framework in embedding space enables principled token pruning for late-interaction models, reducing index size while retaining retrieval quality.
citing papers explorer
-
Multi-Vector Embeddings are Provably More Expressive than Single Vector Embeddings
Proves that for bounded n, there exist MV embeddings with m vectors each whose Chamfer matrix requires single-vector dimension D = (ε² m)^Ω(1/ε) to approximate within ε, separating MV from SV expressiveness.
-
Visual Late Chunking: An Empirical Study of Contextual Chunking for Efficient Visual Document Retrieval
ColChunk adaptively chunks visual document patches into contextual multi-vectors via clustering, cutting storage by over 90% while raising average nDCG@5 by 9 points.
-
A Voronoi Cell Formulation for Principled Token Pruning in Late-Interaction Retrieval Models
A Voronoi cell estimation framework in embedding space enables principled token pruning for late-interaction models, reducing index size while retaining retrieval quality.