Know Before You Fetch: Calibrated Retrieval-Budget Allocation for Retrieval-Augmented Generation
Retrieval-augmented generation (RAG) typically retrieves a fixed number of passages for every query. This is wasteful when the reader already knows the answer, and it can be harmful when irrelevant or partially relevant passages distract the reader. We formulate adaptive RAG as calibrated retrieval-budget allocation: given a query, decide whether to answer closed-book, retrieve a compact context (k=1), retrieve a full context (k=5), or abstain. The contribution is a probability interface rather than a new raw uncertainty signal. We calibrate sequence log-probability and prefix-logit uncertaint
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- LinkedLinked via unknownRAGless: Q-Q retrieval with score aggregation for closed-domain FAQ [P] →
- PossiblePossibly related (embedding) · 47%NirDiamant/RAG_Techniques →
- PossiblePossibly related (embedding) · 47%Loop Engineering for RAG Question Parsing: The Small Loop That Runs Before Retrieval - towardsdatascience.com →
