Same Winners, Different Success Rates: Evaluating How LLM Agents Recover from Failures
On the map: LLM agents and tool use → Reinforcement learning for LLM agents also fits: General LLM agent frameworks and benchmarks
Abstract (arXiv)
Evaluating how LLM agents recover from mid-task failures is central to deploying reliable agentic systems. Existing checkpoint-based benchmarks measure recovery by comparing which action is selected as best across independent runs, a quantity known as set agreement. However, set agreement is a purely ordinal measure that records which action wins without reflecting the absolute level of performance. When all actions fail, they tie at zero reward, and independent runs produce the same tied set with high probability, creating an illusion of stability that masks near-zero recovery success. We formalize this limitation through a set-path symmetry result, proving that for equal-cost Bernoulli actions the success probabilities (0.9, 0.8) and (0.2, 0.1) yield identical best-action-set distributions at every sample size. No procedure based solely on which action wins can distinguish these two regimes. We further prove that certifying exact population ties is impossible in finite time, and that the assignment of outcomes to checkpoints carries information beyond marginal outcome distributions. The pooled success probability is the missing scalar that resolves the ordinal ambiguity. Experiments on 864 frozen RecoveryBench episodes and two planning cohorts totaling 3,456 responses confirm the theoretical predictions. Agreement and held-out quality can move in opposite directions, and permuting checkpoint-to-action bindings changes 8 to 13 percent of cell-level conclusions. Based on these findings, we propose reporting four diagnostic quantities (agreement, all-zero fraction, held-out success, and pooled success) that expose this failure mode with no additional data collection.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Reinforcement learning for LLM agents, one of 16 directions in LLM agents and tool use. Builds on 26 of its 45 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
26 of 45 references.
Closest ancestors · 1
Same direction, newest first
Other references · 25
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,695
- 2023AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversationcited by 1,988
- 2023AgentBench: Evaluating LLMs as Agentscited by 1,267
- 2017Selective Classification for Deep Neural Networkscited by 852
- 2026Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfacescited by 585
- 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 286
- 2016Optimal Best Arm Identification with Fixed Confidencecited by 239
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 229
- 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Banditscited by 149
- 2019Pure Exploration with Multiple Correct Answerscited by 64
- 2024WorkflowLLM: Enhancing Workflow Orchestration Capability of Large Language Modelscited by 30
- 2026Causal Agent Replay: Counterfactual Attribution for LLM-Agent Failurescited by 20
13 more
- 2026When Tools Fail: Benchmarking Dynamic Replanning and Anomaly Recovery in LLM Agentscited by 17
- 2025Do Repetitions Matter? Strengthening Reliability in LLM Evaluationscited by 14
- 2024Finding Replicable Human Evaluations via Stable Ranking Probabilitycited by 13
- 2026Auditing Provenance Sensitivity in LLM Agent Action Selectioncited by 12
- 2026The Replay Gap: Static Evaluation of Model Switching in LLM Agents Scores the Wrong Worldcited by 8
- 2026Proof-Carrying Agent Actions: Model-Agnostic Runtime Governance for Heterogeneous Agent Systemscited by 7
- 2026Safeguarding LLM Agents from Misalignment through Provenance Analysiscited by 6
- 2026CAVA: Canonical Action Verification and Attestation for Runtime Governance of Agentic AI Systemscited by 4
- 2021Optimal Decision Rules Under Partial Identificationcited by 3
- 2022Optimal Decision Rules when Payoffs are Partially Identifiedcited by 3
- 2026Can LLMs Really Recover Microservice Failures? A Recovery-Aware Evaluation of Diagnosis-to-Action Reasoningcited by 3
- 2025Optimal Best-Arm Identification under Fixed Confidence with Multiple Optimacited by 2
- 2026When Can Agents Safely Checkpoint, Fork, Restore, and Merge? Exact Checking for Execution Editscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Sentry: Learning to Recover from LLM Agent Failures at Test Time
- 2026RippleCP: Measuring Counterfactual Checkpoint Advantage in Coding Agents
- 2026When Harnesses Lose the Signal: Causal Evaluation of Recovery in LLM Agents
- 2025SABER: Small Actions, Big Errors -- Safeguarding Mutating Steps in LLM Agents
- 2026Reach or Solve? Attributing Agentic RL Gains with Checkpoint Handoffs
- 2026Evaluation of Multi-Turn Consistency in LLM Agents: Survival Analysis and Failure-Rationale Taxonomy
- 2026Trust Between AI Agents: Measuring Formation, Breakage, and Recovery, with Implications for Governing Multi-Agent Systems
- 2026Credit Without Ground Truth: Auditing Step-Level Credit Assignment in LLM Agents Against Executed Replay