HackerPapers

arXiv:2104.08663cs.IR

BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models

Nandan Thakur, Nils Reimers, Andreas Rücklé, Abhishek Srivastava, Iryna Gurevych

Abstract

Existing neural information retrieval (IR) models have often been studied in homogeneous and narrow settings, which has considerably limited insights into their out-of-distribution (OOD) generalization capabilities. To address this, and to facilitate researchers to broadly evaluate the effectiveness of their models, we introduce Benchmarking-IR (BEIR), a robust and heterogeneous evaluation benchmark for information retrieval. We leverage a careful selection of 18 publicly available datasets from diverse text retrieval tasks and domains and evaluate 10 state-of-the-art retrieval systems including lexical, sparse, dense, late-interaction and re-ranking architectures on the BEIR benchmark. Our results show BM25 is a robust baseline and re-ranking and late-interaction-based models on average achieve the best zero-shot performances, however, at high computational costs. In contrast, dense and sparse-retrieval models are computationally more efficient but often underperform other approaches, highlighting the considerable room for improvement in their generalization capabilities. We hope this framework allows us to better evaluate and understand existing retrieval systems, and contributes to accelerating progress towards better robust and generalizable systems in the future. BEIR is publicly available at https://github.com/UKPLab/beir.

arXiv comments
Accepted at NeurIPS 2021 Dataset and Benchmark Track
Journal reference
DOI
Subjects
cs.IRInformation Retrieval cs.AIArtificial Intelligence cs.CLComputation and Language

On Hacker News

Linked by 2 identifiable commenters in 3 comments across 2 threads, from Dec 2021 to Nov 2022.

Comments linking this paper, per year.

Discussed in comments2 threads

    • This is an area that's dear to me, I'm the cofounder of Vectara and have been working with embedding-based semantic search, aka neural search or neural IR, since 2017. To whether Google uses semantic search, the answer is yes, very heavily [1][2]. Not only that, but they have…

      svcrunchView on HNParent context

    • >A much more interesting (and harder) problem is creating good vectors to begin >with. Indeed, this is the hardest problem. Vector search shines when used in-domain using deep representation learning, for example bi-encoders on top of transformer models for text domain. However…

      jkb79View on HNParent context

    • Vector models are nothing but representation learning and applying the model out-of-domain usually gives worse results than plain old BM25. See https://arxiv.org/abs/2104.08663 A concrete example is DPR which is a state of the art dense retriever model for wikipedia for question…

      jkb79View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.