Can Failed Trajectories Reveal Where Agents Go Wrong? Agentic Failure Attribution Without Step-Level Labels
summary
The gist
The gist Failure attribution for LLM agents aims to identify decisive steps responsible for task failure, which is critical for debugging and improving agentic systems How it works The paper
In short
The paper addresses how to pinpoint which specific step caused an LLM agent's task failure when no step-level error labels are available. The proposed SOAP framework uses spectral scoring from failed trajectories combined with attention patterns to trace downstream error signals back to the most likely decisive, upstream mistake. This method is effective and requires no extra training data.
Key concepts
- Failure Attribution
- This is the process of identifying the exact action or step an agent took that led to a task failing. The goal is debugging and improving agents by knowing precisely where the error occurred in their execution path.
- SOAP Framework
- SOAP stands for Spectral scOring with Attention-guided Propagation. It is a method designed to find the decisive error without needing step-level labels or success data. It works by first scoring steps based on their representation in a spectral space and then using attention patterns to propagate failure evidence backward.
- Spectral Reference Space
- This involves taking representations of all steps from failed trajectories and using Singular Value Decomposition (SVD) to create a new, organized mathematical space. Steps are then scored based on how much their representation projects onto specific directions in this space, helping to identify the most anomalous or decisive steps.
- Attention-guided Rescoring
- This technique uses the attention patterns within the LLM's model to determine dependencies between steps. It calculates how much a later step relies on an earlier one and uses this dependency weight to adjust scores, ensuring that downstream errors are correctly traced back to their likely upstream sources.
Terminology used across episodes
This episode discusses
- Can Failed Trajectories Reveal Where Agents Go Wrong? Agentic Failure Attribution Without Step-Level Labels · Paper Radio
- Adaptive Influence Graphs for Failure Attribution in Multi-Agent Systems · Paper Radio
- MCP-Atlas: A Large-Scale Benchmark for Tool-Use Competency with Real MCP Servers
- Where Did It All Go Wrong? A Hierarchical Look into Multi-Agent Error Attribution
- AgentRx: Diagnosing AI Agent Failures from Execution Trajectories · Paper Radio
- TRAIL: Trace Reasoning and Agentic Issue Localization
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- Who&When Pro: Can LLMs Really Attribute Failures in AI Agents? · Paper Radio
- MASPrism: Lightweight Failure Attribution for Multi-Agent Systems Using Prefill-Stage Signals
- TRAJDEBUG: Tracing Error Lifecycle to Identify Critical Failures in Long-Horizon Agent Trajectories · Paper Radio
- Qwen3 Technical Report
- FALAT: Tracing Failures in LLM Agent Trajectories via Dependency-Guided Search
- Model or Harness? An Interaction-Centric Taxonomy for Localizing Agent Failures
- Metacognitive Self-Correction for Multi-Agent System via Prototype-Guided Next-Execution Reconstruction
- From Flat Logs to Causal Graphs: Hierarchical Failure Attribution for LLM-based Multi-Agent Systems
- Tracing Agentic Failure from the Flow of Success · Paper Radio
- CORRECT: COndensed eRror RECognition via knowledge Transfer in multi-agent systems
- AgenTracer: Who Is Inducing Failure in the LLM Agentic Systems?
- Where LLM Agents Fail and How They can Learn From Failures
The paper
Can Failed Trajectories Reveal Where Agents Go Wrong? Agentic Failure Attribution Without Step-Level Labels · Read on arXiv
Nguyen-Thanh, Junlin Fang, Bing Li, Zhen Fang, Sean Du
Nanyang Technological University · Australian Artificial Intelligence Institute
Failure attribution for LLM agents aims to identify decisive steps responsible for task failure, which is critical for debugging and improving agentic systems. Existing methods rely on costly LLM prompting, step-level error annotations, or verified successful trajectories that lack failure signals for assistance. In this paper, we study failure attribution from step-unlabeled failure trajectories, where each trajectory is known to have failed but its decisive step is unknown. We propose SOAP (Spectral scOring with Attention-guided Propagation), an effective framework requiring neither step-level training labels nor a separate success-only reference set. SOAP first constructs a spectral reference space from LLM representations and assigns each step a base error score according to its projection behavior. Importantly, later steps may exhibit stronger failure signals because they inherit an earlier mistake, causing independent scorers to favor downstream consequences over the decisive error. To address this downstream contamination, SOAP derives soft step dependencies from attention patterns and propagates downstream error evidence toward its likely upstream sources. Extensive experiments show that SOAP consistently improves attribution performance over competitive baselines.
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: Today's paper: "Can Failed Trajectories Reveal Where Agents Go Wrong? Agentic Failure Attribution Without Step-Level Labels".
Jane: The gist Failure attribution for LLM agents aims to identify decisive steps responsible for task failure,
Tom: First, who's behind it and why it matters.
Title and authors: Jane: Speaking of localization, what exactly is this SOAP framework doing? Tom, can you explain the core idea behind how they're trying to find that decisive step?
Tom: Well, SOAP has two main parts. First, they build a spectral reference space from the representations extracted by a frozen language model on those failure trajectories. They use singular value decomposition for that part.
Lu: So they create these orthogonal directions in a spectral reference space based on how the frozen language model represents every step in all the failure trajectories. Then they compute a base error score for each step by measuring its average squared projection onto a selected spectral band and inverting that quantity.
Tom: That sounds like it's exploiting an imbalance where ordinary steps dominate, so the decisive-error steps show lower projection energy within that chosen band.
Meng: Okay, but that sounds mathematical and abstract. How does the second part of SOAP deal with the contamination problem they mentioned? Downstream contamination seems like a big issue for any error scoring system.
Jane: That's where they introduce attention-guided rescoring to combat that downstream contamination. They derive soft dependency graphs from models' attention patterns, showing how much later steps rely on earlier ones.
Lalam: They calculate the dependency weight by aggregating post-softmax attention routed from tokens in step s to tokens in an earlier step s i, and they normalize those masses over the retained predecessors.
Tom: And then they use that to calculate a final rescoring score for an earlier step, S(s i), using the formula (s i) = S(s i) + gamma B i, where B i is the dependency-weighted average of downstream base scores.
Lu: That propagation mechanism promotes an earlier step when anomalous behavior is systematically built upon it, which should help pull the signal back to the source.
Meng: So it sounds like they are using attention to trace failure backward through time, instead of just looking at isolated scores for each step. That’s a clever way to handle that contamination issue.
The paper's summary: Jane: Let's recap the main problem again. The central challenge this paper addresses is identifying the decisive step in failed trajectories without step-level annotations, which is something that is usually very costly and often ambiguous in practice.
Tom: They are specifically studying failure attribution from step-unlabeled failure trajectories, where we know the trajectory failed, but no single step gets a label for being either decisive or non-decisive.
Lu: The paper notes that these failure-conditioned datasets directly expose the behaviors that arise when agents fail, unlike methods that require verified successful trajectories which are scarce.
Jane: And their main contribution is proposing SOAP, which they claim consistently improves decisive-step localization over competitive prompt-based and training-based baselines across different evaluation settings.
Tom: On a specific benchmark called TRACEELEPHANT with the DeepSeek-R1-Distill-Llama model, SOAP improved step-level accuracy by twenty-four point six six percent compared to the strongest baseline they tested <ref:2610.13105#pg3,step-level accuracy by 24.66>.
Meng: That's a significant number improvement on accuracy, which is what we actually care about when we move models into production. But how robust is this improvement across different agent types?
Lalam: They show strong generalization across different backbones and data distributions, even when they constructed their method on a source subset and tested it on a target subset.
Jane: That’s good because it suggests the method isn't just tuned to one specific model or one specific way of failing; it seems to capture a more general signal.
The paper's improvements: Tom: Beyond just getting better results on TRACEELEPHANT, they highlight two key technical contributions in their main summary. First, formulating the localization from step-unlabeled trajectories that bypasses the need for decisive-error annotations or carefully verified successful trajectories.
Lu: They explicitly identify downstream contamination as a central obstacle to this localization problem because later steps can show stronger failure signals just because they inherited an earlier mistake.
Jane: And their second major contribution is proposing SOAP itself, which combines spectral step scoring and attention-guided rescoring to solve this identification challenge.
Meng: So the improvement isn't just a new scoring function; it’s the entire pipeline that handles both the initial error estimation and the propagation of that error backward.
Lalam: They also emphasize that they require neither step-level training labels nor a separate success-only reference set to work, which makes it much more practical for real-world debugging scenarios.
Tom: And on the efficiency front, they say SOAP is lightweight because it doesn't need those extra labels. The computational cost for fitting their SVD on the unlabeled reference set is very low: zero point zero eight seconds on WW-AG and zero point two nine seconds on WW-HC, which is much faster than methods like OAT and StepFinder which can be two to three orders of magnitude slower.
Jane: That speed is important for practical deployment because it doesn't require massive computational overhead just to get a preliminary attribution score.
Conclusion: Jane: So, to wrap up, this paper presents the SOAP framework as an effective way to attribute failures in LLM-based multi-agent systems by scoring steps against a spectral reference and routing late contamination back using attention propagation.
Tom: It's lightweight, it requires no step-level annotation, and it consistently outperforms prompt-based and training-based baselines across benchmarks like WHO andWHEN, CORRECT-ERROR, and TRACEELEPHANT.
Lu: The main implication is that step-unlabeled failure trajectories are a viable source of localization signals for debugging agents without the need for extensive manual annotation.
Meng: For production environments, this means we can get faster feedback on where an agent went wrong without having to halt training or spend days manually annotating failures.
Lalam: I'm sure SOAP is quite confident in its answer because it works across different backbones and data distributions, showing high performance even when constructed on a source subset and evaluated on a target subset.
Tom: So, the full title is "Can Failed Trajectories Reveal Where Agents Go Wrong? Agentic Failure Attribution Without Step-Level Labels". It's a solid framework for finding that decisive step without needing those costly labels.
Jane: A very practical and efficient approach to debugging agentic systems that seems highly relevant right now. We'll take a quick break before we talk about some of the other papers we looked at today.
More episodes
- 2610.07529-Targeted search shows that random-device testing underestimates worst-case error in a simulated wave-based neural operator
- 2610.07559-TAFFY: A Task-Adaptive Tabular Foundation Model with In-Context Diversity
- 2610.07615-AFA-BANDIT: Provably Near-Optimal Online Multi-Feature Classification Under Budget Constraints
- 2610.07704-Independent Multi-Agent Reinforcement Learning with Counterfactual Semantic-Social World Models
- 2610.07859-Tram-FL: Reducing Communication and Computation Costs through Sequential Model Circulation in Decentralized Federated Learning
- 2610.07810-SIFT: Search Intent-to-Filter Transformer for Multi-Task Personalized Filter Ranking at Airbnb
- 2610.07884-Learned Adaptive Multiresolution Diffusion Imaging
- 2610.07857-A Decision-Focused Neural Optimization Framework for Personalized Route Reproduction from Vehicle Trajectories
- 2610.07874-On-Policy Distillation with Negative-Policy Rollouts
- 2610.07938-Generalized Matheron Variational Implicit Processes