Skip to content

Re:CAP - Auditing Retrieval Coverage in Production RAG Pipelines

Sep 2026 · 0 citations · 39 references
Computer Science

TL;DR

Re:CAP is a reference-free audit loop applied to a deployed RAG pipeline's initial answer and retrieved context that identifies the topics already covered, generates probing questions for plausibly missing topics, retrieves candidate documents, and applies an LLM-as-judge to retain only those that introduce previously-unretrieved information.

Abstract

Retrieval-augmented generation (RAG) is hard to monitor in production: exhaustive relevance labels do not exist for non-stationary multi-million-passage corpora that re-index in real time. As a result, retrieval quality is generally understudied and often deprioritised in favour of generation-oriented metrics. In this work, we propose auditing retrieval coverage by probing for evidence of missing documents rather than enumerating every relevant one. Our method Re:CAP (REtrieval Coverage Audit by iterative Probing) is a reference-free audit loop applied to a deployed RAG pipeline's initial answer and retrieved context: it identifies the topics already covered, generates probing questions for plausibly missing topics, retrieves candidate documents, and applies an LLM-as-judge to retain only those that introduce previously-unretrieved information. On four public benchmarks, Re:CAP recovers 9-29% of gold labels that flat BM25 top-500 cannot reach, rising to 48% on TREC-COVID. On MuSiQue Re:CAP beats flat hybrid top-500 by +12.9 pp on recall at less than half the document budget. An ensemble BM25, dense, and hybrid baseline (top-500 each) still leaves out 21.2% of gold docs on TREC-COVID that Re:CAP recovers; human annotators judge that 78.9% of those structurally distinct documents add new information to the baseline answer (Fleiss $\kappa$ = 0.79, n = 123), and 73.9% on live production traffic (n = 180). End-to-end recall is reproducible to within $\pm$1% across three independent runs, making Re:CAP a stable instrument for periodic retrieval audits.

View source

Similar papers

#small language model Open access Aug 2026

Retrieval Granularity as Evidence Design in Small-Model RAG Question Answering: A Diagnostic HotpotQA Study

Results align with a diagnostic perspective on chunking: using evidence at a task-appropriate level of granularity can improve grounding, auditability, and answer quality, but the observed patterns should be interpreted within the HotpotQA distractor setting, fixed generator, and tested context budgets.

Wei-Mao Ke, Li-Xia Yang, Meng-Yang Xu · 0 citations
#artificial intelligence Open access Sep 2026

The Attribution–Compression Frontier in Retrieval-Augmented Generation

This work measures citation attribution across compression methods and budgets, comparing reranking, extractive selection, abstractive summarization, token pruning, and an extract-cluster-rewrite construction on ASQA and QASPER under a fixed generator and primary entailment evaluator.

Deepanshu Mody · 2 citations
Review Open access 2026

BALANGAY-RAG: Adaptive Pre-Generation Retrieval and Abstention for Filipino-English Code-Switched Queries

Fixed retrieval depths can waste context or proceed without designated support when language form, evidence availability, and context budgets vary. This controlled pre-generation study evaluates BALANGAY-RAG, combining the BALANGAY-PH benchmark with BALANGAY-RF, a Random Forest controller that selects k = 1, 2, 4, or 8...

John Syte Tiopes, John Best Tiopes, Wilmar Orlanda et al. · 0 citations
Book Open access Sep 2026

Seek: Self-Evaluative Exploration for Knowledge Retrieval

seek, Self-Evaluative Exploration for Knowledge Retrieval, a training-free framework that addresses this limitation through iterative corpus interaction at test time through iterative corpus interaction at test time.

Amin Bigdeli, Radin Hamidi Rad, Negar Arabzadeh et al. · 0 citations
Preprint Oct 2026

RAGFlip: Measuring Query-Level Negative Flips in Retriever Upgrades

Retriever upgrades are typically evaluated using aggregate metrics, which can hide regressions on queries the previous retriever already served correctly. We study these regressions as negative flips: queries for which BM25 retrieves a judged relevant passage and the replacement does not. We evaluate BGE-large, E5-larg...

E. Irankhah, Muhammad Arif · 0 citations

Related blog posts

Microsoft Research Blog Oct 22, 2026

Flint-interactive: A language for creating interactive data visualizations

Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.