AI & ML
Know Before You Fetch: When Does Confidence-Based Retrieval-Budget Allocation Pay Off?
arXiv cs.IR0 views
arXiv:2606.29959v2 Announce Type: replace Abstract: Adaptive retrieval-augmented generation uses a signal from the reader, such as its confidence when answering without retrieval (closed-book), to decide whether and how much to retrieve. We compare such methods not with always retrieving many passages but with the best simple policy under the same cap on average passages per query: a fixed depth or a random mixture of fixed depths. Policies allocate zero, one or five passages and are scored on held-out questions. Seven settings of about 2,000 questions combine TriviaQA, Natural Questions and MS MARCO, Qwen3-8B and Qwen3-32B readers, and two retrieval sources: per-question passage pools and a 3.5-million-passage Wikipedia index. Allocation by confidence could gain in three ways. It rations a scarce budget: at a cap of half a passage per query it beats the best simple policy in all seven settings, by 0.010 to 0.075 in accuracy. It avoids harmful retrieval: at caps of one passage or more, substantial gains appear only on Wikipedia, where passages often overwrite known answers, most robustly for Qwen3-8B on TriviaQA (+0.051, also under exact match and F1). It barely helps to choose depth: closed-book confidence ranks which queries a first passage helps but ranks the choice between one and five passages little better than chance, and with passage pools a fixed depth of two or three passages is as good or better. Once the probe's latency is charged, gains remain only where the gate skips retrieval for most queries; for the larger reader they also depend on the answer metric.
Source:https://arxiv.org/abs/2606.29959PreviousLearning Binary Codes with Spiking Neural Networks for Cross-Modal Hashing RetrievalNextUniRank: Benchmarking Ranking Models for Unified Sequential Modeling and Feature Interaction
Related posts

With the biggest IPO of all time, Anthropic’s ‘good guy’ reputation is on the line
0The Verge
Read the Hints First, Then Guess: A Better Way to Play a Music Daily
0dev.to

Did the attack really work?
0dev.to
Synergizing Evidence Retrieval and Utilization for Self-Improving Multimodal Scientific Document Reasoning
0dev.to
How to build a favicon set from a logo you already have
0dev.to
Understanding AI Computing — Part 4
0dev.to