This work applies closed sequential pattern mining (BIDE+) to K-step prefixes of agent execution traces to produce a small, human-reviewable failure-signature library that organizes into a four-category failure taxonomy with associated repair recommendations.
Abstract
Web navigation agents built on open-weight language models fail often and fail late, with most of the tokens spent after the trajectory has become unrecoverable. Recent work has shown that early termination is a viable cost-reduction strategy, but existing approaches produce opaque termination decisions that do not support diagnosis or human oversight. In this work we apply closed sequential pattern mining (BIDE+) to K-step prefixes of agent execution traces to produce a small, human-reviewable failure-signature library that organizes into a four-category failure taxonomy with associated repair recommendations. We use a multi-variant evaluation protocol that explicitly removes contamination artifacts (zero-step crashes and trivially separable single-step successes) so that reported detection accuracy reflects behavioral discrimination rather than trace-length distributions. We evaluate our methodology on 1,544 MiniWoB++ traces collected from three open-weight language models, achieving the best F1 at K=3 on the Exclude-errors configuration across eight methods (0.717), recovering 88% of test-set failures within three steps, and supporting an early-termination policy that saves 26.3% of tokens at 92% precision.
Autonomous agents powered by Large Language Models (LLMs) can automate complex web tasks, but their reliability is limited by uncertain action outcomes: the consequence of interacting with a web element is often known only after execution. Existing sequential methods are vulnerable to error propagation after wrong deci...
Han-Xun Li, Bin Li, Jing-Tao Qi et al.· Proceedings of the 35th ACM...· 0 citations
The Adaptive Consistency Graph (ACG) is introduced, which incrementally organizes execution evidence and its provenance in a persistent graph, then constructs a temporary requirement-centered view for each decision under a bounded context budget.
LONGSEARCHEVAL is introduced, a trajectory-aware agent evaluation framework that combines a unified agent execution protocol with source constrained outcome verification and retrospective failure-node localization that support controlled model comparison and retrospective inspection of answer-related content.
Questions about an agent's history often require aggregating events, which retrieval alone does not resolve. We combine source-preserving evidence access with executable aggregation. Trajectory Memory (TM) retains the original trajectory and constructs a source-addressable reading view at question time. TallyMem augmen...
Ze-Rui Yang, Quan Xue, Chao-Rui Zhang et al.· 0 citations
This paper proposes FRESH, a Failure-aware Retrieval framework over Experience-Structured Heterogeneous graphs, which transforms historical successes and failures into structured external experience for tool-using agents and consistently improves task success and tool-use reliability over no-memory agents and represent...
Jia-Xing Li, Lei Song, Rui Dong et al.· arXiv.org· 0 citations
Tool-use agents pay per decision: at each hop a language model re-reads the state and thinks for seconds, though its actions are finite and decisions recur. We present NIOCIS, a routing layer that folds execution logs into a loop-collapsed action graph (forward transitions plus recovery back-edges) answering one typed...
Jin-Sung Han, Ming-Feng Xin, Feng Liang et al.· 0 citations