mlsanityData to 7 Oct 2026

Risk-Aware Adaptive Evaluation: Finding High-Impact Failures Under Limited Budgets

arXiv 2609.38914 ↗First posted 30 Sep 2026cs.AI cs.LG cs.MAcited by 0

Not on the map. Why?

Abstract (arXiv)

Evaluating interactive agents is expensive. Agent behavior is stochastic, so reliability must be measured over repeated trials, but failures are rare and differ widely in how much they matter. Standard benchmarks spend this budget uniformly: a read-only lookup is sampled as often as an irreversible payment action. We instead formulate evaluation as a sequential allocation problem. Given a fixed trial budget and a set of scenarios whose failure behavior is unknown, which scenarios should be run, and run again? We propose a risk-aware contextual Thompson Sampling policy that combines a pre-execution scenario context vector and a fixed impact score with the failure outcomes observed during evaluation, and we test it by offline replay over 70 τ-bench airline scenarios and 824 recorded trials. Our main result is at the smallest budget: with only 50 trials (6% of the corpus), the policy recovers 86% of the impact-weighted failures an oracle could find, compared to 25% for uniform allocation. It discovers 3.5× more impact-weighted failures (215.4 vs. 62.2) with the same number of trials, delivers 5× the discovery per dollar, and cuts the budget wasted on scenarios that never fail from 34% to 2.8%. The rest of our analysis demonstrates and qualifies this result: a budget sweep shows the advantage shrinks as the budget approaches the corpus size, and paired significance tests show that scenario context helps mainly at small budgets while posterior-based exploration helps at moderate ones. Risk-aware adaptive allocation therefore helps most exactly where evaluation budget is scarcest.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 33 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

19 of 33 references.

References · 19

  1. 2023WebArena: A Realistic Web Environment for Building Autonomous Agentscited by 1,908
  2. 2023ToolLLM: Facilitating Large Language Models to Master 16000+ Real-world APIscited by 1,880
  3. 2024τ-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domainscited by 1,280
  4. 2023AgentBench: Evaluating LLMs as Agentscited by 1,211
  5. 2025τ2-Bench: Evaluating Conversational Agents in a Dual-Control Environmentcited by 558
  6. 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 166
  7. 2020Neural Thompson Samplingcited by 127
  8. 2025MCP-Bench: Benchmarking Tool-Using LLM Agents with Complex Real-World Tasks via MCP Serverscited by 101
  9. 2017Mostly Exploration-Free Algorithms for Contextual Banditscited by 85
  10. 2025TRAJECT-Bench:A Trajectory-Aware Benchmark for Evaluating Agentic Tool Usecited by 46
  11. 2021Parallelizing Thompson Samplingcited by 20
  12. 2018PG-TS: Improved Thompson Sampling for Logistic Contextual Banditscited by 18
7 more
  1. 2026Beyond Task Completion: Revealing Corrupt Success in LLM Agents through Procedure-Aware Evaluationcited by 15
  2. 2026On Randomness in Agentic Evalscited by 12
  3. 2025Stochasticity in Agentic Evaluations: Quantifying Inconsistency with Intraclass Correlationcited by 9
  4. 2026On the Reliability of Computer Use Agentscited by 8
  5. 2024Thompson Sampling in Partially Observable Contextual Banditscited by 5
  6. 2026How Many Tasks Are Enough for Agent Benchmark Decisions? A Replay Analysis of Public LLM Agent Benchmarkscited by 2
  7. 2025An adaptive importance sampling algorithm for risk-averse optimizationcited by 1

Built on by

Not cited yet.