Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboard
Not on the map. Why?
Abstract (arXiv)
BEIR is a benchmark dataset for zero-shot evaluation of information retrieval models across 18 different domain/task combinations. In recent years, we have witnessed the growing popularity of a representation learning approach to building retrieval models, typically using pretrained transformers in a supervised setting. This naturally begs the question: How effective are these models when presented with queries and documents that differ from the training data? Examples include searching in different domains (e.g., medical or legal text) and with different types of queries (e.g., keywords vs. well-formed questions). While BEIR was designed to answer these questions, our work addresses two shortcomings that prevent the benchmark from achieving its full potential: First, the sophistication of modern neural methods and the complexity of current software infrastructure create barriers to entry for newcomers. To this end, we provide reproducible reference implementations that cover the two main classes of approaches: learned dense and sparse models. Second, there does not exist a single authoritative nexus for reporting the effectiveness of different models on BEIR, which has led to difficulty in comparing different methods. To remedy this, we present an official self-service BEIR leaderboard that provides fair and consistent comparisons of retrieval models. By addressing both shortcomings, our work facilitates future explorations in a range of interesting research questions that BEIR enables.
Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 13 Jun 2023.
Builds on
28 of 42 references.
References · 28
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
- 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 267
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
- 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
- 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 176
- 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 127
16 more
- 2019Deeper Text Understanding for IR with Contextual Neural Language Modelingcited by 113
- 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
- 2022From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effectivecited by 98
- 2021The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Modelscited by 81
- 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
- 2020SparTerm: Learning Term-based Sparse Representation for Fast Text Retrievalcited by 45
- 2019EvalAI: Towards Better Evaluation Systems for AI Agentscited by 34
- 2020Complementing Lexical Retrieval with Semantic Residual Embeddingcited by 27
- 2021A Proposed Conceptual Framework for a Representational Approach to Information Retrievalcited by 24
- 2022LaPraDoR: Unsupervised Pretrained Dense Retriever for Zero-Shot Text Retrievalcited by 24
- 2023SLIM: Sparsified Late Interaction for Multi-Vector Retrieval with Inverted Indexescited by 12
- 2022Evaluating Interpolation and Extrapolation Performance of Neural Retrieval Modelscited by 9
- 2021Ultra-High Dimensional Sparse Representations with Binarization for Efficient Text Retrievalcited by 7
- 2022SpaDE: Improving Sparse Representations using a Dual Document Encoder for First-stage Retrievalcited by 6
- 2022Can Old TREC Collections Reliably Evaluate Modern Neural Retrieval Models?cited by 5
- 2022Building a Culture of Reproducibility in Academic Researchcited by 5
Built on by
Citing papers per year: 2023: 2; 2024: 6; 2025: 4; 2026: 3.
15 papers.
Sort:
By area:
- 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 578
- 2024Evaluation of Retrieval-Augmented Generation: A Surveycited by 146
- 2025VDocRAG: Retrieval-Augmented Generation over Visually-Rich Documentscited by 59
- 2024JudgeRank: Leveraging Large Language Models for Reasoning-Intensive Rerankingcited by 34
- 2025Retrieval Augmented Generation Evaluation in the Era of Large Language Models: A Comprehensive Surveycited by 20
- 2024Multimodal Learned Sparse Retrieval with Probabilistic Expansion Controlcited by 12
- 2025Tricking Retrievers with Influential Tokens: An Efficient Black-Box Corpus Poisoning Attackcited by 10
- 2025ConFit v2: Improving Resume-Job Matching using Hypothetical Resume Embedding and Runner-Up Hard-Negative Miningcited by 5
- 2023Leveraging Domain Adaptation and Data Augmentation to Improve Qur'anic IR in English and Arabiccited by 4
- 2024ELOQ: Resources for Enhancing LLM Detection of Out-of-Scope Questionscited by 2
- 2024ConFit: Improving Resume-Job Matching using Data Augmentation and Contrastive Learningcited by 1
- 2024Link, Synthesize, Retrieve: Universal Document Linking for Zero-Shot Information Retrievalcited by 0
- 2026PLAID-PRF: Pseudo-Relevance Feedback with Centroid-like Tokens in PLAID21 Jul 2026
- 2026CMDR: Contextual Multimodal Document Retrieval7 Jul 2026
- 2026LLM Readiness Harness: Evaluation, Observability, and CI Gates for LLM/RAG Applications28 Mar 2026
- 2025Retrieval Augmented Generation Evaluation in the Era of Large Language Models: A Comprehensive Survey21 Apr 2025
- 2025VDocRAG: Retrieval-Augmented Generation over Visually-Rich Documents14 Apr 2025
- 2025Tricking Retrievers with Influential Tokens: An Efficient Black-Box Corpus Poisoning Attack27 Mar 2025
- 2025ConFit v2: Improving Resume-Job Matching using Hypothetical Resume Embedding and Runner-Up Hard-Negative Mining17 Feb 2025
- 2024JudgeRank: Leveraging Large Language Models for Reasoning-Intensive Reranking31 Oct 2024
- 2024Link, Synthesize, Retrieve: Universal Document Linking for Zero-Shot Information Retrieval24 Oct 2024
- 2024ELOQ: Resources for Enhancing LLM Detection of Out-of-Scope Questions18 Oct 2024
- 2024Evaluation of Retrieval-Augmented Generation: A Survey13 May 2024
- 2024Multimodal Learned Sparse Retrieval with Probabilistic Expansion Control27 Feb 2024
- 2024Evaluation of Retrieval-Augmented Generation: A Surveycited by 146
- 2025VDocRAG: Retrieval-Augmented Generation over Visually-Rich Documentscited by 59
- 2025Retrieval Augmented Generation Evaluation in the Era of Large Language Models: A Comprehensive Surveycited by 20
- 2025Tricking Retrievers with Influential Tokens: An Efficient Black-Box Corpus Poisoning Attackcited by 10
- 2024ELOQ: Resources for Enhancing LLM Detection of Out-of-Scope Questionscited by 2
- 2025Retrieval Augmented Generation Evaluation in the Era of Large Language Models: A Comprehensive Survey21 Apr 2025
- 2025VDocRAG: Retrieval-Augmented Generation over Visually-Rich Documents14 Apr 2025
- 2025Tricking Retrievers with Influential Tokens: An Efficient Black-Box Corpus Poisoning Attack27 Mar 2025
- 2024ELOQ: Resources for Enhancing LLM Detection of Out-of-Scope Questions18 Oct 2024
- 2024Evaluation of Retrieval-Augmented Generation: A Survey13 May 2024
- 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 578
- 2024Multimodal Learned Sparse Retrieval with Probabilistic Expansion Controlcited by 12
- 2025ConFit v2: Improving Resume-Job Matching using Hypothetical Resume Embedding and Runner-Up Hard-Negative Miningcited by 5
- 2023Leveraging Domain Adaptation and Data Augmentation to Improve Qur'anic IR in English and Arabiccited by 4
- 2024ConFit: Improving Resume-Job Matching using Data Augmentation and Contrastive Learningcited by 1
- 2024Link, Synthesize, Retrieve: Universal Document Linking for Zero-Shot Information Retrievalcited by 0
- 2026LLM Readiness Harness: Evaluation, Observability, and CI Gates for LLM/RAG Applicationscited by 0
- 2026CMDR: Contextual Multimodal Document Retrievalcited by 0
- 2026PLAID-PRF: Pseudo-Relevance Feedback with Centroid-like Tokens in PLAIDcited by 0
- 2026PLAID-PRF: Pseudo-Relevance Feedback with Centroid-like Tokens in PLAID21 Jul 2026
- 2026CMDR: Contextual Multimodal Document Retrieval7 Jul 2026
- 2026LLM Readiness Harness: Evaluation, Observability, and CI Gates for LLM/RAG Applications28 Mar 2026
- 2025ConFit v2: Improving Resume-Job Matching using Hypothetical Resume Embedding and Runner-Up Hard-Negative Mining17 Feb 2025
- 2024Link, Synthesize, Retrieve: Universal Document Linking for Zero-Shot Information Retrieval24 Oct 2024
- 2024Multimodal Learned Sparse Retrieval with Probabilistic Expansion Control27 Feb 2024
- 2024ConFit: Improving Resume-Job Matching using Data Augmentation and Contrastive Learning29 Jan 2024
- 2023Leveraging Domain Adaptation and Data Augmentation to Improve Qur'anic IR in English and Arabic5 Dec 2023
- 2023C-Pack: Packed Resources For General Chinese Embeddings14 Sep 2023