arXiv AI By Lixuan Guo, Yifei Wang, Tiansheng Wen, Aosong Feng, Stefanie Jegelka, Chenyu You

No More K-means: Single-Stage Sparse Coding for Efficient Multi-Vector Retrieval

Read the original on arXiv AI →

arXiv:2605. 30120v3 Announce Type: replace-cross Abstract: Multi-vector retrieval (MVR) models, exemplified by ColBERT, have established new benchmarks in retrieval accuracy by preserving fine-grained token-level interactions.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.

arXiv Machine Learning
Aug 5

VIBE: Vector Index Benchmark for Embeddings

arXiv:2505. 17810v2 Announce Type: replace Abstract: Approximate nearest neighbor (ANN) search is a performance-critical component of many machine learning pipelines, and rigorous benchmarking is essential for assessing the performance of vector indexes for ANN search.

By Elias J\"a\"asaari, Ville Hyv\"onen, Matteo Ceccarello, Teemu Roos, Martin Aum\"uller
Hugging Face Trending Papers
Jul 6

Do All Visual Tokens Matter Equally? Object-Evidence Preserving Token Merging for Vision-Language Retrieval

Multi-vector vision-language retrieval preserves fine-grained visual evidence through maximum-similarity late interaction, but dense image-side tokens make storage and scoring expensive. Existing token compression methods reduce this cost, yet they can remove or collapse object- and region-level evidence that future query tokens may need to select.

arXiv AI
Jun 17

Non-negative Elastic Net Decoding for Information Retrieval

arXiv:2606. 17910v1 Announce Type: cross Abstract: Dense retrieval has become the dominant paradigm in information retrieval, in which each document is scored against a query by the inner product of their vector embeddings, and the top-$k$ documents by score are retrieved for this query.

By Koki Okajima, Yasutoshi Ida, Tsukasa Yoshida, Yasuaki Nakamura