VLDB 2026 Research / reviewers in the wild / expert
Sai Meher Karthik Duddu
dblp:332/2004
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › retrieval models › neural retrieval
late interaction retrieval |
0.7 | 1 | 2023 | Rethinking the Role of Token Retrieval in Multi-Vector Retrieval · NeurIPS 2023 |
Information retrieval › retrieval models › neural retrieval
multi-vector retrieval |
0.7 | 1 | 2023 | Rethinking the Role of Token Retrieval in Multi-Vector Retrieval · NeurIPS 2023 |
Information retrieval
retrieval models |
0.7 | 1 | 2023 | Rethinking the Role of Token Retrieval in Multi-Vector Retrieval · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
contrastive objective · 0.7contextualized token retrieval · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Rethinking the Role of Token Retrieval in Multi-Vector RetrievalabstractMulti-vector retrieval models such as ColBERT [Khattab et al., 2020] allow token-level interactions between queries and documents, and hence achieve state of the art on many information retrieval benchmarks. However, their non-linear scoring function cannot be scaled to millions of documents, necessitating a three-stage process for inference: retrieving initial candidates via token retrieval, accessing all token vectors, and scoring the initial candidate documents. The non-linear scoring function is applied over all token vectors of each candidate document, making the inference process complicated and slow. In this paper, we aim to simplify the multi-vector retrieval by rethinking the role of token retrieval. We present XTR, ConteXtualized Token Retriever, which introduces a simple, yet novel, objective function that encourages the model to retrieve the most important document tokens first. The improvement to token retrieval allows XTR to rank candidates only using the retrieved tokens rather than all tokens in the document, and enables a newly designed scoring stage that is two-to-three orders of magnitude cheaper than that of ColBERT. On the popular BEIR benchmark, XTR advances the state-of-the-art by 2.8 nDCG@10 without any distillation. Detailed analysis confirms our decision to revisit the token retrieval stage, as XTR demonstrates much better recall of the token retrieval stage compared to ColBERT. Jinhyuk Lee, Zhuyun Dai, Sai Meher Karthik Duddu, Tao Lei 0001, Iftekhar Naim, Ming-Wei Chang, Vincent Y. Zhao |
NeurIPS | 3 |