ActiveEvidence: Decision-Focused Evidence Graphs with Verifiable Acquisition Gaps
Not on the map. Why?
Abstract (arXiv)
A multimodal agent must decide whether visual evidence is worth acquiring, which candidate or resolution to query, and when further interaction can no longer change its decision. We study this problem under a strict free-metadata/paid-observation boundary, stochastic vector costs, and a frozen execution trace, and treat it as decision-certifiable active evidence acquisition. A Counterfactual Evidence Interaction Graph (CEIG) represents unary evidence value, signed second-order interaction, and directed conditional harm while maintaining explicit score enclosures for unresolved interactions; a decision-weighted enclosure objective tightens the bounds that can change action identity. Gap-directed refinement evaluates only interactions that can displace the incumbent acquisition and stops once an ε-decision certificate shows that unresolved terms cannot change the selected action beyond a declared tolerance. The certificate is model-relative: it verifies policy-consistent optimality under the pinned learned score, and semantic quality is measured separately through post-freeze labels. Paired continuation rollouts learn the downstream value of paid previews, an online operational cost filter is separated from independent finite-policy-family trajectory certification, and an acquisition monitor with an independently implemented verifier binds every certificate to the frozen trace. On 640 cases split into 384/128/128 training, validation, and test cases, the controller reaches task score 0.842, grounding F1 0.816, evidence recall 0.873, 1.74 accepted calls, 286.5K visual tokens, and 742ms p95 latency. Dense replay of issued certificates shows 0.992 action agreement and a 0.988 certificate rate while evaluating 19.6 instead of 191.4 expensive interaction terms per decision.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 58 references that are in the map. First posted on arXiv 14 Oct 2026.
Builds on
28 of 58 references.
References · 28
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,695
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,276
- 2023Toolformer: Language Models Can Teach Themselves to Use Toolscited by 4,182
- 2023Let's Verify Step by Stepcited by 3,789
- 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,442
- 2015Trust Region Policy Optimizationcited by 2,580
- 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,546
- 2020D4RL: Datasets for Deep Data-Driven Reinforcement Learningcited by 1,427
- 2024τ-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domainscited by 1,402
16 more
- 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,293
- 2023Mind2Web: Towards a Generalist Agent for the Webcited by 1,242
- 2015Prioritized Experience Replaycited by 1,099
- 2022Planning with Diffusion for Flexible Behavior Synthesiscited by 1,061
- 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 928
- 2016Distribution-Free Predictive Inference For Regressioncited by 668
- 2019SelectiveNet: A Deep Neural Network with an Integrated Reject Optioncited by 350
- 2024ProcessBench: Identifying Process Errors in Mathematical Reasoningcited by 292
- 2021Distribution-Free, Risk-Controlling Prediction Setscited by 288
- 2021Learn then Test: Calibrating Predictive Algorithms to Achieve Risk Controlcited by 271
- 2022Defining and Characterizing Reward Hackingcited by 203
- 2025AdaptVision: Efficient Vision-Language Models via Adaptive Visual Acquisitioncited by 21
- 2025DART: Leveraging Multi-Agent Disagreement for Tool Recruitment in Multimodal Reasoningcited by 5
- 2025ToolScope: An Agentic Framework for Vision-Guided and Long-Horizon Tool Usecited by 4
- 2013An Approximate Nonmyopic Computation for Value of Informationcited by 1
- 2014Value of Information Lattice: Exploiting Probabilistic Independence for Effective Feature Subset Acquisitioncited by 1
Built on by
Not cited yet.