Skip to content
Preprint

Recall Is Not Enough: A Reader-Context Diagnostic for Budget-Constrained Retrieval-Augmented Generation

Jul 2026 · 0 citations · 50 references
Computer Science

TL;DR

Casting reader-context construction as budgeted submodular maximization gives a packer that beats both deployed top-k truncation and LLMLingua-2 compression - across three reader families, four scales, and four budgets, at equal-or-lower token cost.

Abstract

Retrieval-augmented generation under a fixed context budget forces a selection problem: only a fraction of the retrieved evidence fits in front of the reader. The field's standard metric, recall@k, is scored on the retrieved set, but the reader consumes the packed context - and once packing must discard evidence, the two come apart. We introduce answer-in-context, a diagnostic that measures whether a gold answer survives into the packed context, and argue it is the quantity budgeted RAG should be optimizing. It carries substantial information beyond retrieval, adding Delta R^2 = 0.17-0.27 over recall across three multi-hop datasets; even among questions where all gold was retrieved, whether packing keeps the answer separates exact match by 4.6x. Two independent interventions confirm the mediation: a packing change that raises document coverage without raising answer-in-context leaves accuracy flat, and prompt compression that destroys the answer span lowers both together. A graded variant extends the diagnostic to free-form answers, where no verbatim span exists. We then show the diagnostic is actionable. Casting reader-context construction as budgeted submodular maximization gives a packer that beats both deployed top-k truncation and LLMLingua-2 compression - across three reader families, four scales, and four budgets, at equal-or-lower token cost. Against a hand-tuned query-focused heuristic, which we show approximates the same objective, it reaches parity, winning outright only where evidence density is the binding constraint. Throughout, one variable predicts what helps and what cannot.

View source

Similar papers

Preprint Aug 2026

More Context, Same Budget: Dual-Bounded Relational Recall Beyond Top-K Retrieval

Dual-Bounded Relational Recall is tested with Dual-Bounded Relational Recall, which allocates a fixed retrieval budget between relevance-selected seeds and bounded graph-adjacent context against matched flat top-k retrieval using the same relevance-ranking stage and the same maximum number of retrieval units and tokens...

Thomson D. Nguy · 0 citations
Conference Jul 2026

A Reproducible and Budget-Aware Framework for Evaluating Local Retrieval-Augmented Generation (RAG) Robustness to Perturbations

The idea of context is no longer considered secondary in the construction of language-model systems. With the use of local Retrieval-Augmented Generation, even a tiny modification of the prompt or the context might produce another set of retrievals, citations, and ultimately different answers; however, in practice, tes...

Rahul Reddy Gangapuram, William B. Andreopoulos · 0 citations
#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
Jul 2026

Evidence Interfaces Shape How Retrieval-Augmented Readers Use Support

Using three support-annotated multi-hop QA benchmarks, this work compares matched adapted readers trained with raw context, retrieval windows, and gold-support diagnostic renderings to distinguish support-availability failures from remaining reader-interface effects.

Jun-Hui Liao, Jiawen Deng, Fuji Ren · 1 citation
Jul 2026

QUBO-Optimized Evidence Selection for Retrieval-Augmented Question Answering with Unconventional Solvers

The QUBO selector achieves competitive exact-match and token-F1 performance relative to LLM-based selectors while providing a solver-compatible formulation for structured evidence selection, suggesting that multi-hop evidence selection can be cast as discrete optimization, opening a path toward RAG pipelines where LLMs...

Rahul Singh, Madhav Vadlamani · 0 citations

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