Evidence coverage provides a practical runtime control signal for improving retrieval-augmented agents without retraining or modifying the host agent.
Abstract
Retrieval-augmented search agents answer multi-hop questions by repeatedly issuing search queries and accumulating evidence. This creates a stopping problem: after the necessary evidence has appeared, further retrieval often adds cost, latency, and distracting context rather than useful information. We frame stopping as evidence coverage rather than generator confidence, and introduce HALT, a lightweight verification-aware policy that leaves the search agent unchanged. Given expected hop claims, HALT stops only when cumulative evidence supports each required claim. Across three multi-hop QA benchmarks, HALT reduces redundant search while largely preserving exact match. We separate a deployable setting, where hop claims are generated from the question, from a diagnostic upper bound that uses gold supporting-fact annotations: generated claims give smaller but still exact-match-preserving savings, while gold claims show the larger savings available when hop targets are clean. Baseline comparisons and ablations show that this behavior is driven by claim-evidence alignment rather than generic sufficiency, fixed stop positions, or lexical overlap. Open-corpus pilots further suggest that HALT abstains when coverage cannot be reliably verified. Overall, evidence coverage provides a practical runtime control signal for improving retrieval-augmented agents without retraining or modifying the host agent.
Experiments establish ReTree as an effective self-correcting memory abstraction for long-horizon search, and show that ReTree consistently outperforms Full-Trajectory ReAct in question-answering and search benchmarks.
Aijun Yang, Qianxue Guo, Ziyi Huang et al.· 0 citations
HAE-GEO is introduced, a benchmark that tracks the full trajectory from exposure to recovery under progressively more persuasive Web poisoning and finds three recurring patterns: evidence recognition degrades under the corroboration trap, agentic search improves final resistance without improving evidence recognition o...
Zhong-An Bi, Qi-Wen Wang, Jian-Rong Jiang et al.· 1 citation
Existing long-video agents acquire evidence through one uniform behavior, ignoring whether the required evidence is concentrated, requires broad occurrence coverage, or must discriminate competing hypotheses---which can cause failure before substantive reasoning begins. Prescribing a fine-grained solution procedure for...
Can-Can Zhang, Bao-Feng Zhang, Xiao-Tian Han et al.· 0 citations
The hidden phenomenon accuracy-blind answer churn is called and the Snapshot Compatibility Audit is introduced, which estimates excess answer churn by subtracting same-snapshot repeat disagreement from cross-snapshot disagreement.
This work introduces HopRefusalBench, the first controlled benchmark of refusal within multi-hop search, and proposes a final-outcome taxonomy spanning target-aware refusal, pseudo-refusal, hallucinated completion, and search-budget exhaustion, together with source-aware trajectory metrics for post-trigger continuation...
Jianan Xie, Xin Sun, Zhongqi Chen et al.· 0 citations
Although multi-turn inference remains more expensive than single-call retrieval, VecTree-RAG provides a structure-aware and traceable architecture for scientific literature question answering.
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
With $2.1 million funding from Google.org, the open-source Public Transit Intelligence Hub will unify public transit monitoring, operations, and passenger communication.