ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
Recent progress in Natural Language Understanding (NLU) is driving fast-paced advances in Information Retrieval (IR), largely owed to fine-tuning deep language models (LMs) for document ranking. While remarkably effective, the ranking models based on these LMs increase computational cost by orders of magnitude over prior approaches, particularly as they must feed each query-document pair through a massive neural network to compute a single relevance score. To tackle this, we present ColBERT, a novel ranking model that adapts deep LMs (in particular, BERT) for efficient retrieval. ColBERT introduces a late interaction architecture that independently encodes the query and the document using BERT and then employs a cheap yet powerful interaction step that models their fine-grained similarity. By delaying and yet retaining this fine-granular interaction, ColBERT can leverage the expressiveness of deep LMs while simultaneously gaining the ability to pre-compute document representations offline, considerably speeding up query processing. Crucially, ColBERT's pruning-friendly interaction mechanism enables leveraging vector-similarity indexes for end-to-end retrieval directly from millions of documents. We extensively evaluate ColBERT using two recent passage search datasets. Results show that ColBERT's effectiveness is competitive with existing BERT-based models (and outperforms every non-BERT baseline), while executing two orders-of-magnitude faster and requiring up to four orders-of-magnitude fewer FLOPs per query.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The only ML component is a CrossEncoder reranker ( mxbai-rerank-large-v1 , 435M parameters, DeBERTaV3) fused with ColBERT (Khattab & Zaharia, 2020) via Reciprocal Rank Fusion (RRF), applied after retrieval is complete to prioritize passages before token-budget truncation.”
From SmartSearch: How Ranking Beats Structure for Conversational Memory Retrieval (2026) · cites this paper as Khattab & Zaharia, 2020
In the citing paper
“While dense retrievers like Dense Passage Retrieval (DPR) [14] and late-interaction models like ColBERT [15] improve recall on single-hop queries, they often struggle with multi-hop reasoning, where the answer depends on composing information from multiple disjoint documents [20, 6].”
From Replace, Don't Expand: Mitigating Context Dilution in Multi-Hop RAG via Fixed-Budget Evidence Assembly (2025) · cites this paper as [15]
In the citing paper
“Research on retrieval optimization has explored multiple techniques, yet studies specifically focused on prefetching size in RaLM systems are still limited.”
From Exploring Optimal Prefetching Sizes in RaLMSpec to Enhance Retrieval-Augmented Generation Efficiency (2025) · cites this paper as [9]
In the citing paper
“Early RAG implementations, however, often relied on document retrieval methods that introduced noise and excessive context [26, 55, 60, 122].”
From LEGO-GraphRAG: Modularizing Graph-Based Retrieval-Augmented Generation for Design Space Exploration (2025) · cites this paper as [55]
In the citing paper
“Standard retrieval methods like RAG and MemoryBank (Zhong et al., 2024) rely fundamentally on vector similarity (Karpukhin et al., 2020; Khattab and Zaharia, 2020), representing memories as isolated points in embedding space (Hu et al., 2025). Consequently, they struggle with queries requiring causal bridging between semantically dissimilar or distant events (Yang et al., 2018; Qi et al., 2019; Tr”
From Synapse: Empowering LLM Agents with Episodic-Semantic Memory via Spreading Activation (2026) · cites this paper as Khattab and Zaharia, 2020
Citations
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404 · cited 1×
“At a high level, TK improves the KNRM architecture described earlier: while KNRM employs kernel pooling on top of word-embedding-based interaction, TK uses a Transformer [34] component for contextually encoding queries and documents before kernel pooling.”
MethodBERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173 · cited 2×
“Among them, a recent approach has emerged that ne-tunes deep pre-trained language models (LMs) like ELMo [29] and BERT [5] for estimating relevance.”
BackgroundGoogle's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
Wu, Y., Schuster, M., Chen, Z., Le, Q. V., Norouzi, M., Macherey, W., Krikun, M., Cao, Y., Gao, Q., Macherey, K., et al. (2016) · arXiv · doi:10.48550/arxiv.1609.08144 · Cited by 5,319
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jégou, H. (2017) · arXiv · doi:10.48550/arxiv.1702.08734 · Cited by 4,140 · cited 2×
“Additionally, it enables ColBERT to leverage vector-similarity search indexes (e.g., [1, 16]) to retrieve the top-k results directly from a large document collection, substantially improving recall over models that only re-rank the output of term-based retrieval.”
MethodMS MARCO: A Human Generated MAchine Reading COmprehension Dataset
Bajaj, P., Campos, D., Craswell, N., Deng, L., Gao, J., Liu, X., Majumder, R., McNamara, A., Mitra, B., Nguyen, T., et al. (2016) · arXiv · doi:10.48550/arxiv.1611.09268 · Cited by 2,473
Robertson, S. E., Walker, S., Jones, S., Hancock‐Beaulieu, M., & Gatford, M. (1994) · Text REtrieval Conference · Cited by 2,212
Learning deep structured semantic models for web search using clickthrough data
Huang, P.-S., He, X., Gao, J., Deng, L., Acero, A., & Heck, L. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505665 · Cited by 2,009 · cited 1×
“On the le, Figure 2 (a) illustrates representation-focused rankers, which independently compute an embedding for q and another for d and estimate relevance as a single similarity score between two vectors [13, 41].”
BackgroundTinyBERT: Distilling BERT for natural language understanding
Jiao, X., Yin, Y., Shang, L., Jiang, X., Chen, X., Li, L., Wang, F., & Liu, Q. (2020) · Findings of the Association for Computational Linguistics: EMNLP 2020 · doi:10.18653/v1/2020.findings-emnlp.372 · Cited by 1,786
A Deep Relevance Matching Model for Ad-hoc Retrieval
Guo, J., Fan, Y., Ai, Q., & Croft, W. B. (2016) · Proceedings of the 25th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2983323.2983769 · Cited by 806 · cited 1×
“Over the past few years, the Information Retrieval (IR) community has witnessed the introduction of a host of neural ranking models, including DRMM [8], KNRM [5, 36], and Duet [21, 23].”
BackgroundNogueira, R., & Cho, K. (2019) · arXiv · doi:10.48550/arxiv.1901.04085 · Cited by 615 · cited 9×
“Similar to [25], we fine-tune all ColBERT models with learning rate 3 × 10 − 6 with a batch size 32.”
BackgroundMethodInfluential
Research works printed but not linked: 14
- Zhuyun Dai and Jamie Callan . 2019 a. Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval. arXiv preprint arXiv:1910.10687 ( 2019 ). Zhuyun Dai and Jamie Callan. 2019 a. Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval. arXiv preprint arXiv:1910.10687 (2019). · arXiv
- Zhuyun Dai and Jamie Callan . 2019 b. Deeper Text Understanding for IR with Contextual Neural Language Modeling. arXiv preprint arXiv:1905.09217 ( 2019 ). Zhuyun Dai and Jamie Callan. 2019 b. Deeper Text Understanding for IR with Contextual Neural Language Modeling. arXiv preprint arXiv:1905.09217 (2019). · arXiv
- Jiafeng Guo , Yixing Fan , Liang Pang , Liu Yang , Qingyao Ai , Hamed Zamani , Chen Wu , W Bruce Croft , and Xueqi Cheng . 2019. A deep look into neural ranking models for information retrieval. arXiv preprint arXiv:1903.06902 ( 2019 ). Jiafeng Guo, Yixing Fan, Liang Pang, Liu Yang, Qingyao Ai, Hamed Zamani, Chen Wu, W Bruce Croft, and Xueqi Cheng. 2019. A deep look into neural ranking models for information retrieval. arXiv preprint arXiv:1903.06902 (2019). · arXiv
- Sebastian Hofst"atter and Allan Hanbury . 2019. Let's measure run time! Extending the IR replicability infrastructure to include performance aspects. arXiv preprint arXiv:1907.04614 ( 2019 ). Sebastian Hofst"atter and Allan Hanbury. 2019. Let's measure run time! Extending the IR replicability infrastructure to include performance aspects. arXiv preprint arXiv:1907.04614 (2019). · arXiv
- Sebastian Hofst"atter, Markus Zlabinger , and Allan Hanbury . 2019 b. TU Wien@ TREC Deep Learning'19--Simple Contextualization for Re-ranking. arXiv preprint arXiv:1912.01385 ( 2019 ). Sebastian Hofst"atter, Markus Zlabinger, and Allan Hanbury. 2019 b. TU Wien@ TREC Deep Learning'19--Simple Contextualization for Re-ranking. arXiv preprint arXiv:1912.01385 (2019). · arXiv
- Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). · arXiv
- Bhaskar Mitra and Nick Craswell . 2019. An Updated Duet Model for Passage Re-ranking. arXiv preprint arXiv:1903.07666 ( 2019 ). Bhaskar Mitra and Nick Craswell. 2019. An Updated Duet Model for Passage Re-ranking. arXiv preprint arXiv:1903.07666 (2019). · arXiv
- Bhaskar Mitra , Corby Rosset , David Hawking , Nick Craswell , Fernando Diaz , and Emine Yilmaz . 2019. Incorporating query term independence assumption for efficient retrieval and ranking using deep neural networks. arXiv preprint arXiv:1907.03693 ( 2019 ). Bhaskar Mitra, Corby Rosset, David Hawking, Nick Craswell, Fernando Diaz, and Emine Yilmaz. 2019. Incorporating query term independence assumption for efficient retrieval and ranking using deep neural networks. arXiv preprint arXiv:1907.03693 (2019). · arXiv
- Rodrigo Nogueira , Wei Yang , Kyunghyun Cho , and Jimmy Lin . 2019 b. Multi-Stage Document Ranking with BERT. arXiv preprint arXiv:1910.14424 ( 2019 ). Rodrigo Nogueira, Wei Yang, Kyunghyun Cho, and Jimmy Lin. 2019 b. Multi-Stage Document Ranking with BERT. arXiv preprint arXiv:1910.14424 (2019). · arXiv
- Rodrigo Nogueira , Wei Yang , Jimmy Lin , and Kyunghyun Cho . 2019 c. Document Expansion by Query Prediction. arXiv preprint arXiv:1904.08375 ( 2019 ). Rodrigo Nogueira, Wei Yang, Jimmy Lin, and Kyunghyun Cho. 2019 c. Document Expansion by Query Prediction. arXiv preprint arXiv:1904.08375 (2019). · arXiv
- Matthew E Peters , Mark Neumann , Mohit Iyyer , Matt Gardner , Christopher Clark , Kenton Lee , and Luke Zettlemoyer . 2018. Deep contextualized word representations. arXiv preprint arXiv:1802.05365 ( 2018 ). Matthew E Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer. 2018. Deep contextualized word representations. arXiv preprint arXiv:1802.05365 (2018). · arXiv
- Yifan Qiao , Chenyan Xiong , Zhenghao Liu , and Zhiyuan Liu . 2019. Understanding the Behaviors of BERT in Ranking. arXiv preprint arXiv:1904.07531 ( 2019 ). Yifan Qiao, Chenyan Xiong, Zhenghao Liu, and Zhiyuan Liu. 2019. Understanding the Behaviors of BERT in Ranking. arXiv preprint arXiv:1904.07531 (2019). · arXiv
- Colin Raffel , Noam Shazeer , Adam Roberts , Katherine Lee , Sharan Narang , Michael Matena , Yanqi Zhou , Wei Li , and Peter J Liu . 2019. Exploring the limits of transfer learning with a unified text-to-text transformer. arXiv preprint arXiv:1910.10683 ( 2019 ). Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J Liu. 2019. Exploring the limits of transfer learning with a unified text-to-text transformer. arXiv preprint arXiv:1910.10683 (2019). · arXiv
- Raphael Tang , Yao Lu , Linqing Liu , Lili Mou , Olga Vechtomova , and Jimmy Lin . 2019. Distilling task-specific knowledge from BERT into simple neural networks. arXiv preprint arXiv:1903.12136 ( 2019 ). Raphael Tang, Yao Lu, Linqing Liu, Lili Mou, Olga Vechtomova, and Jimmy Lin. 2019. Distilling task-specific knowledge from BERT into simple neural networks. arXiv preprint arXiv:1903.12136 (2019). · arXiv
Cited by
Dense passage retrieval for open-domain question answering
Karpukhin, V., Oguz, B., Min, S., Lewis, P., Wu, L., Edunov, S., Chen, D., & Yih, W.-T. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.550 · Cited by 3,575
On the Opportunities and Risks of Foundation Models
Bommasani, R., Hudson, D. A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M. S., Bohg, J., Bosselut, A., Brunskill, E., et al. (2021) · arXiv · doi:10.48550/arxiv.2108.07258 · Cited by 2,676
Self-citationRetrieval-Augmented Generation for Large Language Models: A Survey
Gao, Y., Xiong, Y., Gao, X., Jia, K., Pan, J., Bi, Y., Dai, Y., Sun, J., Wang, M., & Wang, H. (2023) · arXiv · doi:10.48550/arxiv.2312.10997 · Cited by 876
“The development of Advanced RAG and Modular RAG was a response to these specific shortcomings in Naive RAG.”
BackgroundRetrieval Augmentation Reduces Hallucination in Conversation
Shuster, K., Poff, S., Chen, M., Kiela, D., & Weston, J. (2021) · Findings of the Association for Computational Linguistics: EMNLP 2021 · doi:10.18653/v1/2021.findings-emnlp.320 · Cited by 575
Qu, Y., Ding, Y., Liu, J., Liu, K., Ren, R., Zhao, W. X., Dong, D., Wu, H., & Wang, H. (2021) · Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2021.naacl-main.466 · Cited by 356
SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking
Formal, T., Piwowarski, B., & Clinchant, S. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3463098 · Cited by 394
“ColBERT [13] pushes things further: the postponed token-level Short Research Paper III SIGIR ’21, July 11–15, 2021, Virtual Event, Canada”
BackgroundSparse, Dense, and Attentional Representations for Text Retrieval
Luan, Y., Eisenstein, J., Toutanova, K., & Collins, M. (2021) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00369 · Cited by 363
Lin, J., Ma, X., Lin, S.-C., Yang, J.-H., Pradeep, R., & Nogueira, R. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3463238 · Cited by 360
“Row (3a) shows the results of combining TCT-ColBERT with BM25 bag-of-words search over the original texts, while row (3b) shows results that combine document expansion using doc2query with the T5 model.”
MethodInfluentialColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction
Santhanam, K., Khattab, O., Saad-Falcon, J., Potts, C., & Zaharia, M. (2022) · Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2022.naacl-main.272 · Cited by 353
Self-citationX-CLIP: End-to-End Multi-grained Contrastive Learning for Video-Text Retrieval
Ma, Y., Xu, G., Sun, X., Yan, M., Zhang, J., & Ji, R. (2022) · Proceedings of the 30th ACM International Conference on Multimedia · doi:10.1145/3503161.3547910 · Cited by 321
Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Sampling
Hofstätter, S., Lin, S.-C., Yang, J.-H., Lin, J., & Hanbury, A. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3462891 · Cited by 293
“973 [21] ColBERT – – 458 – – – – – – – .”
MethodPretrained Transformers for Text Ranking: BERT and Beyond
Lin, J., Nogueira, R. F., & Yates, A. (2021) · Synthesis lectures on human language technologies · doi:10.2200/s01123ed1v01y202108hlt053 · Cited by 450
Optimizing Dense Retrieval Model Training with Hard Negatives
Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., & Ma, S. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3462880 · Cited by 248
“ADORE+STAR greatly outperforms all baselines, especially the existing competitive knowledge distillation approach (TCTColBERT) and the periodic index refreshing approach (ANCE).”
MethodRecommendation as Instruction Following: A Large Language Model Empowered Recommendation Approach
Zhang, J., Xie, R., Hou, Y., Zhao, X., Lin, L., & Wen, J.-R. (2025) · ACM Transactions on Information Systems · doi:10.1145/3708882 · Cited by 135
“We first present the backbone LLM, and then introduce the optimization and inference.”
Retrieving and Reading: A Comprehensive Survey on Open-domain Question Answering
Zhu, F., Lei, W., Wang, C., Zheng, J., Poria, S., & Chua, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.00774 · Cited by 143
“For instance, ColBERT-QA [17] develops its retriever based on ColBERT [82], which extends the dual-encoder architecture by performing a simple tokenlevel interaction step over the question and document representations to calculate the similarity score.”
MethodInfluentialThe power of noise: Redefining retrieval for rag systems
Cuconasu, F., Trappolini, G., Siciliano, F., Filice, S., Campagnano, C., Maarek, Y., Tonellotto, N., & Silvestri, F. (2024) · Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3626772.3657834 · Cited by 236
“Several actors have released their models, most notably, Llama [38, 39], Falcon [1], Mosaic MPT [37], and Phi [10, 20].”
COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List
Gao, L., Dai, Z., & Callan, J. (2021) · Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2021.naacl-main.241 · Cited by 186
Pretrained Transformers for Text Ranking: BERT and Beyond
Yates, A., Nogueira, R., & Lin, J. (2021) · Proceedings of the 14th ACM International Conference on Web Search and Data Mining · doi:10.1145/3437963.3441667 · Cited by 170
Information Retrieval: Recent Advances and Beyond
Hambarde, K., & Proença, H. P. M. C. (2023) · IEEE Access · doi:10.1109/access.2023.3295776 · Cited by 284
“In [130], the authors propose a method called ColBERT which uses contextualized late interaction to improve passage search.”
MethodIs Cosine-Similarity of Embeddings Really About Similarity?
Steck, H., Ekanadham, C., & Kallus, N. (2024) · Companion Proceedings of the ACM Web Conference 2024 · doi:10.1145/3589335.3651526 · Cited by 137
RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking
Ren, R., Qu, Y., Liu, J., Zhao, W. X., She, Q., Wu, H., Wang, H., & Wen, J.-R. (2021) · Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2021.emnlp-main.224 · Cited by 149
“…retrievers include DPR (Karpukhin et al., 2020), DPR-E, ANCE (Xiong et al., 2020a), ME-BERT (Luan et al., 2021), NPRINC (Lu et al., 2020), ColBERT (Khattab and Zaharia, 2020) RocketQA (Qu et al., 2021), TAS-Balanced (Hof-stätter et al., 2021), ADORE+STAR (Zhan et al., 2021) and PAIR (Ren et al.,…”
BackgroundLearning Passage Impacts for Inverted Indexes
Mallia, A., Khattab, O., Suel, T., & Tonellotto, N. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3463030 · Cited by 152
Self-citationLin, J., & Ma, X. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.14807 · Cited by 67
“Although COIL is perhaps best described as the intellectual descendant of ColBERT (Khattab and Zaharia, 2020), another way to think about it within our conceptual framework is that instead of assigning scalar weights to terms in a query, the “scoring” model assigns each term a vector “weight”.”
InfluentialFrom Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effective
Formal, T., Lassance, C., Piwowarski, B., & Clinchant, S. (2022) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3477495.3531857 · Cited by 306
“Among dense approaches, ColBERT [13] in contrast relies on a late-interaction mechanism, allowing to perform fine-grained term-level matching at the expense of higher indexing cost and latency.”
BackgroundMethodInfluentialParaphrasing evades detectors of AI-generated text, but retrieval is an effective defense
Krishna, K., Song, Y., Karpinska, M., Wieting, J., & Iyyer, M. (2023) · Advances in Neural Information Processing Systems 36 · doi:10.52202/075280-1195 · Cited by 150
Cap4Video: What Can Auxiliary Captions Do for Text-Video Retrieval?
Wu, W., Luo, H., Fang, B., Wang, J., & Ouyang, W. (2023) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52729.2023.01031 · Cited by 237
SPLADE v2: Sparse Lexical and Expansion Model for Information RetrievalPreprint
Formal, T., Lassance, C., Piwowarski, B., & Clinchant, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.10086 · Cited by 366
“We compare against the best performing models from the original benchmark paper [26] (ColBERT [14]) and the two best performing from the rolling benchmark 4 (tuned BM25 and TAS-B [11]).”
MethodPARADE: Passage Representation Aggregation forDocument Reranking
Li, C., Yates, A., MacAvaney, S., He, B., & Sun, Y. (2023) · ACM Transactions on Information Systems · doi:10.1145/3600088 · Cited by 207
“, 2019; Dai and Callan, 2019a), pre-computing intermediate Transformer representations (Khattab and Zaharia, 2020; MacAvaney et al., 2020a; Gao et al., 2020; Humeau et al., 2020), using the PLM to build sparse representations (MacAvaney et al.”
MethodA survey on knowledge-oriented retrieval-augmented generation
Cheng, M., Luo, Y., Ouyang, J., Liu, Q., Liu, H., Li, L., Yu, S., Zhang, B., Cao, J., Ma, J., et al. (2025) · arXiv · doi:10.48550/arxiv.2503.10677 · Cited by 140
“ColBERT uses an inverted index structure to quickly filter relevant documents, after which the similarity between the query and the candidate document embedding is computed via a vector index structure, which ensures high semantic accuracy while realizing fast retrieval[115].”
Text Embeddings by Weakly-Supervised Contrastive Pre-training
Wang, L., Yang, N., Huang, X., Jiao, B., Yang, L., Jiang, D., Majumder, R., & Wei, F. (2022) · arXiv · doi:10.48550/arxiv.2212.03533 · Cited by 135
“Results for ANCE [61], ColBERT [31] and Contriever come from Izacard et al.”
MethodSemantic Models for the First-Stage Retrieval: A Comprehensive Review
Guo, J., Cai, Y., Fan, Y., Sun, F., Zhang, R., & Cheng, X. (2022) · ACM Transactions on Information Systems · doi:10.1145/3486250 · Cited by 113
“BERT [237] model, and the right shows the architecture of ColBERT [112].”
BackgroundMethodInfluentialmMARCO: A Multilingual Version of the MS MARCO Passage Ranking DatasetPreprint
Bonifacio, L., Jeronymo, V., Abonizio, H. Q., Campiotti, I., Fadaee, M., Lotufo, R., & Nogueira, R. F. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.13897 · Cited by 264
“For the first approach, bi-encoder models are largely used (Khattab and Zaharia, 2020; Xiong et al., 2020; Karpukhin et al., 2020; Gao et al., 2021; Zhan et al., 2020; MacAvaney et al., 2020) whereas for reranking approaches, an initial retrieval system (e.”
In-Batch Negatives for Knowledge Distillation with Tightly-Coupled Teachers for Dense Retrieval
Lin, S.-C., Yang, J.-H., & Lin, J. (2021) · Proceedings of the 6th Workshop on Representation Learning for NLP (RepL4NLP-2021) · doi:10.18653/v1/2021.repl4nlp-1.17 · Cited by 122
“For example, ColBERT (Khattab and Zaharia, 2020) requires storing all the WordPiece token vectors of each text (passage) in the corpus.”
BackgroundMethodInfluentialThe Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence ModelsPreprint
Pradeep, R., Nogueira, R. F., & Lin, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.05667 · Cited by 239
“, ranking with BM25 [47], or more recently, via approximate nearest-neighbor search on learned dense representations [13, 18, 19, 21, 27, 57].”
BackgroundMethodSimplified Data Wrangling with ir_datasets
MacAvaney, S., Yates, A., Feldman, S., Downey, D., Cohan, A., & Goharian, N. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3463254 · Cited by 161
“For instance, some techniques involve pre-computing neural document representations to speed up reranking [56] or for performing first-stage retrieval [49].”
MethodLearning from models beyond fine-tuning
Zheng, H., Shen, L., Tang, A., Luo, Y., Hu, H., Du, B., Wen, Y., & Tao, D. (2025) · Nature Machine Intelligence · doi:10.1038/s42256-024-00961-0 · Cited by 86
“Some research on model reuse has been carried out in transfer learning 59 , personalization 60 , efficient searching 61 and multi-task learning 62 .”
Rethinking search: making domain experts out of dilettantes
Metzler, D., Tay, Y., Bahri, D., & Najork, M. (2021) · ACM SIGIR Forum · doi:10.1145/3476415.3476428 · Cited by 112
Structured Pruning of a BERT-based Question Answering Model
McCarley, J. S., Chakravarti, R., & Sil, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.06360 · Cited by 64
Zero-shot Neural Passage Retrieval via Domain-targeted Synthetic Question Generation
Ma, J., Korotkov, I., Yang, Y., Hall, K., & McDonald, R. (2021) · Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume · doi:10.18653/v1/2021.eacl-main.92 · Cited by 80
PyTerrier: Declarative Experimentation in Python from BM25 to Dense Retrieval
Macdonald, C., Tonellotto, N., MacAvaney, S., & Ounis, I. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482013 · Cited by 123
“Both implementations follow the same syntax as PyTerrier’s indexers and retrieval transformers, as shown below: indexer = ANCEIndexer("/path/to/ance_checkpoint/","/path/to/ance_index") indexer.index(dataset.get_corpus_iter()) ance=ANCERetrieve("/path/to/ance_checkpoint/", "/path/to/ance_index") indexer = ColBERTIndexe…”
MethodInfluentialFew-Shot Conversational Dense Retrieval
Yu, S., Liu, Z., Xiong, C., Feng, T., & Liu, Z. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3462856 · Cited by 180
SparTerm: Learning Term-based Sparse Representation for Fast Text RetrievalPreprint
Bai, Y., Li, X., Wang, G., Zhang, C., Shang, L., Xu, J., Wang, Z., Wang, F., & Liu, Q. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.00768 · Cited by 172
“Following the late-interaction paradigm, Khattab [6] proposed Col-BERT to conduct efficient interaction between the query and document, which can run 150x faster than fully-interactive BERT but achieve comparable precision.”
MethodRankT5: Fine-Tuning T5 for Text Ranking with Ranking Losses
Zhuang, H., Qin, Z., Jagerman, R., Hui, K., Ma, J., Lu, J. R., Ni, J., Wang, X., & Bendersky, M. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3592047 · Cited by 300
Distilling Dense Representations for Ranking using Tightly-Coupled Teachers
Lin, S.-C., Yang, J.-H., & Lin, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.11386 · Cited by 50
“Our work builds on ColBERT (Khattab and Za-haria, 2020), who proposed a φ comparison function defined in terms of MaxSim, as follows: where η is composition of functions: We refer readers to Khattab and Zaharia (2020) for more details.”
BackgroundMethodInfluentialJointly Optimizing Query Encoder and Product Quantization to Improve Retrieval Performance
Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., & Ma, S. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3482358 · Cited by 91
BERT-QE: Contextualized Query Expansion for Document Re-ranking
Zheng, Z., Hui, K., He, B., Han, X., Sun, L., & Yates, A. (2020) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2020.findings-emnlp.424 · Cited by 146
Choi, M., Lee, S., Choi, E., Park, H., Lee, J., Lee, D., & Lee, J. (2021) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2021.naacl-main.141 · Cited by 168
TILDE: Term Independent Likelihood moDEl for Passage Re-ranking
Zhuang, S., & Zuccon, G. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3462922 · Cited by 121
“These deep LMs have been exploited to improve search along four main patterns, which are characterised by a trade-off between effectiveness and efficiency, exposed in the high-level comparison of • representation based methods , like EPIC [16], ColBERT [12], RepBERT [31], CLEAR [10] and ANCE [27].”
InfluentialLearning Dense Representations of Phrases at Scale
Lee, J., Sung, M., Kang, J., & Chen, D. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.518 · Cited by 68
“While a similar problem is observed in learning dual encoders for passage representations (Humeau et al., 2019; Khattab and Zaharia, 2020), phrase representations are even more difficult to learn due to the fine-grained representations.”
BackgroundWhen Search Engine Services Meet Large Language Models: Visions and Challenges
Xiong, H., Bian, J., Li, Y., Li, X., Du, M., Wang, S., Yin, D., & Helal, S. (2024) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2024.3451185 · Cited by 183
“Restrictions apply. such as ColBERT [125] and SPLADE [126], have been first proposedforunderstandingandencodingtextualdataintomean-ingfulvectorrepresentations.”
Information Retrieval: Advanced Topics and Techniques
(2024) · ACM eBooks · doi:10.1145/3674127 · Cited by 88
Dense X Retrieval: What Retrieval Granularity Should We Use?
Chen, T., Wang, H., Chen, S., Yu, W., Ma, K., Zhao, X., Zhang, H., & Yu, D. (2024) · Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2024.emnlp-main.845 · Cited by 74
Rekabsaz, N., Kopeinik, S., & Schedl, M. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3462949 · Cited by 55
Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., & Ma, S. (2022) · Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3488560.3498443 · Cited by 72
“5GB, while COIL [10], ColBERT [20], uniCOIL [21], and DeepImpact [26] separately consumes 60GB, 162GB, 1.”
BackgroundMethodInfluentialRelevance-guided Supervision for OpenQA with ColBERT
Khattab, O., Potts, C., & Zaharia, M. (2021) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00405 · Cited by 71
“For this, we train ColBERT as in Khattab and Zaharia (2020) on the MS MARCO Ranking dataset, a natural choice for transfer learning to OpenQA.”
BackgroundMethodInfluentialSelf-citationA survey on large language models with multilingualism: recent advances and new frontiers
Huang, K., Mo, F., Zhang, X., Li, H., Li, Y., Zhang, Y., yi, W., Mao, Y., Liu, J., Xu, Y., et al. (2026) · Artificial Intelligence Review · doi:10.1007/s10462-026-11534-5 · Cited by 146
SimLM: Pre-training with Representation Bottleneck for Dense Passage Retrieval
Wang, L., Yang, N., Huang, X., Jiao, B., Yang, L., Jiang, D., Majumder, R., & Wei, F. (2023) · Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2023.acl-long.125 · Cited by 42
On cross-lingual retrieval with multilingual text encoders
Litschko, R., Vulić, I., Ponzetto, S. P., & Glavaš, G. (2022) · Information Retrieval · doi:10.1007/s10791-022-09406-x · Cited by 104
Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage ExpansionPreprint
Zhuang, S., & Zuccon, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.08513 · Cited by 106
“This is the approach followed by BERT-based dense retrievers (DRs) [11, 15, 16, 33, 41, 44].”
MethodPseudo-Relevance Feedback for Multiple Representation Dense Retrieval
Wang, X., Macdonald, C., Tonellotto, N., & Ounis, I. (2021) · ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR) · doi:10.1145/3471158.3472250 · Cited by 82
“Based on this, we then compare the performances of our proposed ColBERTPRF models, instantiated as ColBERT-PRF Ranker & ColBERT-PRF ReRanker, with the more effective ColBERT E2E model.”
BackgroundMethodInfluential(2022) · doi:10.1145/3511808.3557325 · Cited by 67
“Some of those produce sparse term weights [7, 32], whereas others encode each passage or query into a single vector [18, 41, 51] or multi-vector representation (the class we study; [12, 15, 21, 22, 44]).”
BackgroundMethodInfluentialSelf-citationBERT-based Dense Retrievers Require Interpolation with BM25 for Effective Passage Retrieval
Wang, S., Zhuang, S., & Zuccon, G. (2021) · ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR) · doi:10.1145/3471158.3472233 · Cited by 127
“We note here that DRs can also be used as a second stage re-ranker on top of a bag-of-word model like BM25 [13, 16, 27].”
BackgroundMethodFast changeset-based bug localization with BERT
Ciborowska, A., & Damevski, K. (2022) · Proceedings of the 44th International Conference on Software Engineering · doi:10.1145/3510003.3510042 · Cited by 60
“For the Faiss index, we set the number of partitions to 320 and retrieved a total of 1000 changesets for re-ranking with FBL-BERT [21].”
BackgroundMethodInfluentialMr. TyDi: A Multi-lingual Benchmark for Dense Retrieval
Zhang, X., Ma, X., Shi, P., & Lin, J. (2021) · Proceedings of the 1st Workshop on Multilingual Representation Learning · doi:10.18653/v1/2021.mrl-1.12 · Cited by 51
Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedback
Yu, H., Xiong, C., & Callan, J. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482124 · Cited by 119
“There are also approaches using one vector per document token [17], similar to the interaction-based neural IR approaches [11, 32].”
BackgroundMethodPre-training Methods in Information Retrieval
Fan, Y., Xie, X., Cai, Y., Chen, J., Ma, X., Li, X., Zhang, R., & Guo, J. (2022) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000100 · Cited by 98
MIRACL : A Multilingual Retrieval Dataset Covering 18 Diverse Languages
Zhang, X., Thakur, N., Ogundepo, O., Kamalloo, E., Alfonso-Hermelo, D., Li, X., Liu, Q., Rezagholizadeh, M., & Lin, J. (2023) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00595 · Cited by 274
“• mColBERT (Khattab and Zaharia, 2020; Bonifacio et al., 2021), a multi-vector dense retrieval model that has been shown to be effective in both in-domain and out-of-domain contexts (Thakur et al.”
BackgroundPAIR: Leveraging Passage-Centric Similarity Relation for Improving Dense Passage Retrieval
Ren, R., Lv, S., Qu, Y., Liu, J., Zhao, W. X., She, Q., Wu, H., Wang, H., & Wen, J.-R. (2021) · Findings of the Association for Computational Linguistics: ACL (Findings of ACL) · doi:10.18653/v1/2021.findings-acl.191 · Cited by 110
“, 2020), ColBERT (Khattab and Zaharia, 2020) and RocketQA (Qu et al.”
BackgroundEnd-to-End Training of Multi-Document Reader and Retriever for Open-Domain Question AnsweringPreprint
Sachan, D. S., Reddy, S., Hamilton, W. L., Dyer, C., & Yogatama, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.05346 · Cited by 78
“There are two broad classes of neural retrievers based on the number of embeddings computed for a document: dual encoders (Yih et al., 2011, Lee et al., 2019) and multivector encoders (Khattab and Zaharia, 2020, Luan et al., 2021).”
BackgroundAdversarial Retriever-Ranker for dense text retrievalPreprint
Zhang, H., Gong, Y., Shen, Y., Lv, J., Duan, N., & Chen, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.03611 · Cited by 98
(2021) · doi:10.18653/v1/2021.naacl-tutorials.1 · Cited by 59
BERT-QPP: Contextualized Pre-trained transformers for Query Performance Prediction
Arabzadeh, N., Khodabakhsh, M., & Bagheri, E. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482063 · Cited by 68
CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing
Gou, Z., Shao, Z., Gong, Y., Shen, Y., Yang, Y., Duan, N., & Chen, W. (2023) · arXiv · doi:10.48550/arxiv.2305.11738 · Cited by 561
Pre-trained Language Model based Ranking in Baidu Search
Zou, L., Zhang, S., Cai, H., Ma, D., Cheng, S., Wang, S., Shi, D., Cheng, Z., & Yin, D. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467147 · Cited by 89
“ColBERT [26] introduces a late interaction architecture that independently encodes the query and the document using BERT and employs a cheap yet”
MethodThe Information Retrieval Experiment Platform
Fröbe, M., Reimer, J. H., MacAvaney, S., Deckers, N., Reich, S., Bevendorff, J., Stein, B., Hagen, M., & Potthast, M. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3591888 · Cited by 74
Faster Learned Sparse Retrieval with Guided Traversal
Mallia, A., Mackenzie, J., Suel, T., & Tonellotto, N. (2022) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3477495.3531774 · Cited by 67
Shallow pooling for sparse labels
Arabzadeh, N., Vtyurina, A., Yan, X., & Clarke, C. L. A. (2022) · Information Retrieval Journal · doi:10.1007/s10791-022-09411-0 · Cited by 45
Generative Relevance Feedback with Large Language Models
Mackie, I., Chatterjee, S., & Dalton, J. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3591992 · Cited by 116
“Recent advancements in dense retrieval [16, 21, 46] have led to the development of vector-based PRF models [19], such as ColBERT PRF [41], ColBERT-TCT PRF [49], and ANCE-PRF [49].”
MethodEfficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations
Bruch, S., Nardini, F. M., Rulli, C., & Venturini, R. (2024) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3626772.3657769 · Cited by 100
Lin, J., Ma, X., Lin, S.-C., Yang, J.-H., Pradeep, R., & Nogueira, R. F. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.10073 · Cited by 104
“Row (3a) shows the results of combining TCT-ColBERTwith BM25 bag-of-words search over the original texts, while row (3b) shows results that combine document expansion using doc2query with the T5 model.”
MethodInfluentialDemonstrate-Search-Predict: Composing retrieval and language models for knowledge-intensive NLP
Khattab, O., Santhanam, K., Li, X. L., Hall, D., Liang, P., Potts, C., & Zaharia, M. (2022) · arXiv · doi:10.48550/arxiv.2212.14024 · Cited by 52
Self-citationMulti-Task Retrieval for Knowledge-Intensive Tasks
Maillard, J., Karpukhin, V., Petroni, F., Yih, W.-T., Oguz, B., Stoyanov, V., & Ghosh, G. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.89 · Cited by 47
“Of these, ColBERT (Khattab and Zaharia, 2020) and ME-BERT (Luan et al., 2020) are two representative examples.”
BackgroundInfluentialNeural ranking models for document retrieval
Trabelsi, M., Chen, Z., Davison, B. D., & Heflin, J. (2021) · Information Retrieval · doi:10.1007/s10791-021-09398-0 · Cited by 73
“For example, Khattab and Zaharia (2020) presented a ranking model that is based on contextualized late interaction over BERT (ColBERT).”
BackgroundCEQE: Contextualized Embeddings for Query Expansion
Naseri, S., Dalton, J., Yates, A., & Allan, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-72113-8_31 · Cited by 54
Contextualized Query Embeddings for Conversational Search
Lin, S.-C., Yang, J.-H., & Lin, J. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.77 · Cited by 95
“Hence, we combine three existing resources to train our model with weak supervision: (1) CANARD (Elgohary et al., 2019), a conversational query reformulation dataset; (2) Col-BERT (Khattab and Zaharia, 2020), a strong text ranking model trained on MS MARCO for passage ranking; and (3) the passage collection provided b…”
MethodTask-aware Retrieval with Instructions
Asai, A., Schick, T., Lewis, P., Chen, X., Izacard, G., Riedel, S., Hajishirzi, H., & Yih, W.-T. (2023) · Findings of the Association for Computational Linguistics: ACL 2023 · doi:10.18653/v1/2023.findings-acl.225 · Cited by 46
Ask in Any Modality: A Comprehensive Survey on Multimodal Retrieval-Augmented Generation
Abootorabi, M. M., Zobeiri, A., Dehghani, M., Mohammadkhani, M., Mohammadi, B., Ghahroodi, O., Baghshah, M. S., & Asgari, E. (2025) · Findings of the Association for Computational Linguistics: ACL 2025 · doi:10.18653/v1/2025.findings-acl.861 · Cited by 76
BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models
Thakur, N., Reimers, N., Rücklé, A., Srivastava, A., & Gurevych, I. (2021) · arXiv · doi:10.48550/arxiv.2104.08663 · Cited by 45
“(iv) Late-Interaction: (a) ColBERT [32] encodes and represents the query and passage into a bag of multiple contextualized token embeddings.”
BackgroundMethodInfluentialMulti-View Document Representation Learning for Open-Domain Dense Retrieval
Zhang, S., Liang, Y., Gong, M., Jiang, D., & Duan, N. (2022) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2022.acl-long.414 · Cited by 93
Yu, Y., Xiong, C., Sun, S., Zhang, C., & Overwijk, A. (2022) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2022.emnlp-main.95 · Cited by 92
Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation
Hofstätter, S., Althammer, S., Schröder, M., Sertkan, M., & Hanbury, A. (2020) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.4068215 · Cited by 54
Curriculum Learning for Dense Retrieval Distillation
Zeng, H., Zamani, H., & Vinay, V. (2022) · Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3477495.3531791 · Cited by 41
A Unified End-to-End Retriever-Reader Framework for Knowledge-based VQA
Guo, Y., Nie, L., Wong, Y., Liu, Y., Cheng, Z., & Kankanhalli, M. (2022) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3503161.3547870 · Cited by 67
“A popular option for retriever is to embed the question and knowledge with the same encoder [5, 21], where the similarity between these two can be estimated by a function like cosine similarity [14].”
BackgroundA proposed conceptual framework for a representational approach to information retrieval
Lin, J. (2021) · ACM SIGIR Forum · doi:10.1145/3527546.3527552 · Cited by 82
Training Large-Scale News Recommenders with Pretrained Language Models in the Loop
Xiao, S., Liu, Z., Shao, Y., Di, T., Middha, B., Wu, F., & Xie, X. (2022) · Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3534678.3539120 · Cited by 39
“The pretrained language models are also being intensively applied for the retrieval or information-filtering related scenarios [23], [24], [25]; e.”
MethodQuery Embedding Pruning for Dense Retrieval
Tonellotto, N., & Macdonald, C. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482162 · Cited by 46
“…are computed at runtime leveraging the 𝑄 learned function; queries may also be augmented with additional masked tokens to provide “ a soft, differentiable mechanism for learning to expand queries with new terms or to re-weigh existing terms based on their importance for matching the query ” [5].”
BackgroundMethodInfluentialPseudo Relevance Feedback with Deep Language Models and Dense Retrievers: Successes and Pitfalls
Li, H., Mourad, A., Zhuang, S., Koopman, B., & Zuccon, G. (2023) · ACM Transactions on Information Systems · doi:10.1145/3570724 · Cited by 82
“We choose RepBERT [78], ANCE [64], TCT-ColBERT V1 [33], TCT-ColBERT V2 HN+ [34], DistilBERT KD [18], DistilBERT Balanced [19], and SBERT [54] as representative first stage dense retrievers because they achieve state-of-the-art effectiveness in previous work on MS MARCO.”
MethodInfluentialHM-RAG: Hierarchical Multi-Agent Multimodal Retrieval Augmented Generation
Liu, P., Liu, X., Yao, R., Liu, J., Meng, S., Wang, D., & Ma, J. (2025) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3746027.3754761 · Cited by 111
ABNIRML: Analyzing the Behavior of Neural IR Models
MacAvaney, S., Feldman, S., Goharian, N., Downey, D., & Cohan, A. (2022) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00457 · Cited by 78
“LGBM (Ke et al., 2017).”
InfluentialUnderstanding Hard Negatives in Noise Contrastive Estimation
Zhang, W., & Stratos, K. (2021) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2021.naacl-main.86 · Cited by 73
Metadata
- Authors
- Khattab, O., & Zaharia, M.
- Affiliations
- Stanford University (US)
- Venue
- Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2020-07-25
- Pages
- 39-48
- OpenAlex
- W3021397474
- Cited by
- 1,301
- References
- 21
- Citations by year
- 2026: 346 · 2025: 277 · 2024: 197 · 2023: 184 · 2022: 143 · 2021: 135 · 2020: 18
- FWCI
- 90.73
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) (publishedVersion)
- Funders
- NSF (CNS-1651570)
- Topics
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
- Keywords
- Colbert, BERT, document ranking, information retrieval, query-document similarity, efficient retrieval
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.