mlsanityData to 14 Oct 2026

CoverageBench: Evaluating Information Coverage across Tasks and Domains

arXiv 2603.20034 ↗First posted 20 Mar 2026cs.IR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

We wish to measure the information coverage of an ad hoc retrieval algorithm, that is, how much of the range of available relevant information is covered by the search results. Information coverage is a central aspect for retrieval, especially when the retrieval system is integrated with generative models in a retrieval-augmented generation (RAG) system. The classic metrics for ad hoc retrieval, precision and recall, reward a system as more and more relevant documents are retrieved. However, since relevance in ad hoc test collections is defined for a document without any relation to other documents that might contain the same information, high recall is sufficient but not necessary to ensure coverage. The same is true for other metrics such as rank-biased precision (RBP), normalized discounted cumulative gain (nDCG), and mean average precision (MAP). Test collections developed around the notion of diversity ranking in web search incorporate multiple aspects that support a concept of coverage in the web domain. In this work, we construct a suite of collections for evaluating information coverage from existing collections. This suite offers researchers a unified testbed spanning multiple genres and tasks. All topics, nuggets, relevance labels, and baseline rankings are released on Hugging Face Datasets, along with instructions for accessing the publicly available document collections.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 14 of its 47 references that are in the map. First posted on arXiv 20 Mar 2026.

Builds on

14 of 47 references.

References · 14

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,261
  3. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  4. 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
  5. 2024The Power of Noise: Redefining Retrieval for RAG Systemscited by 281
  6. 2025Rank1: Test-Time Compute for Reranking in Information Retrievalcited by 70
  7. 2024Ragnar"ok: A Reusable RAG Framework and Baselines for TREC 2024 Retrieval-Augmented Generation Trackcited by 32
  8. 2025Rank-K: Test-Time Reasoning for Listwise Rerankingcited by 29
  9. 2024Initial Nugget Evaluation Results for the TREC 2024 RAG Track with the AutoNuggetizer Frameworkcited by 28
  10. 2025Support Evaluation for the TREC 2024 RAG Track: Comparing Human versus LLM Judgescited by 14
  11. 2025Auto-ARGUE: LLM-Based Report Generation Evaluationcited by 14
  12. 2025Controlled Retrieval-augmented Context Evaluation for Long-form RAGcited by 9
2 more
  1. 2023Overview of the TREC 2022 Fair Ranking Trackcited by 7
  2. 2026Overview of the TREC 2025 RAGTIME Trackcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Search for Coverage: Learning Coverage-Aware Retrieval with Augmented Sub-Question Answerability
  2. 2026Beyond Relevance: On the Relationship Between Retrieval and RAG Information Coverage
  3. 2026Testing Retrieval-Augmented Generation Systems with Chunk Coverage
  4. 2026Coverage, Not Averages: Semantic Stratification for Trustworthy Retrieval Evaluation
  5. 2025Methodological Framework for Quantifying Semantic Test Coverage in RAG Systems
  6. 2026Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation
  7. 2025RAGSmith: A Framework for Finding the Optimal Composition of Retrieval-Augmented Generation Methods Across Datasets
  8. 2025From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation