Pith. sign in

REVIEW 1 cited by

Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboard

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.07471 v1 pith:LS3KZ3S7 submitted 2023-06-13 cs.IR cs.CL

classification cs.IRcs.CL
keywords modelsbeirdifferentquestionsretrievalbenchmarkleaderboardmethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PLAID-PRF: Pseudo-Relevance Feedback with Centroid-like Tokens in PLAID

    cs.IR 2026-07 conditional novelty 7.0 of 10

    PLAID-PRF performs pseudo-relevance feedback by treating PLAID's indexing-time centroid codes as semantic terms, selecting diverse reconstructed token vectors to append to the query and rerunning PLAID.

Pith tools