arXiv Computer Vision

Beyond Infraction Scores: Failure-Boundary Profiles for Closed-Loop Evaluation of Driving and Robot Navigation Agents

arXiv AI
1d ago

RACE: Calibrated Cumulative Scoring for Rollout-Free Robot Policy Checkpoint Selection

The paper introduces RACE, a rollout‑free metric for selecting robot policy checkpoints that uses held‑out successful trajectories to calibrate action deviations against state‑conditional thresholds. By aggregating these calibrated scores with a running product, RACE reduces the influence of later reference predictions when early deviations occur, and averages the cumulative scores over time and across trajectories to produce a checkpoint score. Experiments in simulation and on real robots show that RACE outperforms baseline methods and its rankings correlate with deployment success across various policy backbones and tasks.

By Changyeon Kim, Yekyung Nah, Kimin Lee
arXiv AI
Aug 25

TRACE: A Self-Evolving Skill Bank for Consistent, Limit-Aware LLM Agents

TRACE (TRAjectory-Contrastive Evolution) is a self‑evolving skill bank that improves the consistency and limit‑awareness of large‑language‑model agents without changing the model weights. By iteratively refining modular skills based on successful and failed trajectories, TRACE raises consistent performance (Pass^3) on the CAR‑bench in‑car assistant tasks from 59.9 % to 94.5 % on GPT‑5.5 and achieves first place on the hidden set with GPT‑5.6‑Sol. The approach demonstrates that a skill‑based, self‑evolution loop can convert a model’s potential into stable, reliable behavior.

By Wenhao Wu, Menghao Zhang, Xin Wang, Zhi Wang, Kun Shao, Jian Luan
Hugging Face Trending Papers
Oct 13

Executable Prefix Values for Locating Agent Failures

The paper investigates whether human or LLM‑judge‑identified ‘first mistake’ points truly indicate failure causes in LLM agents. By reconstructing intermediate states and computing a prefix value V(h_t) for each step, the authors identify a certified point of no return (PNR) and compare it to judge‑labeled steps. Their experiments on 150 SWE‑bench tasks show that judge labels often miss the decisive step, while restarting at the measured PNR improves success rates from 0.44 to 0.57.

arXiv Machine Learning
Sep 17

Locating Hidden Failures Makes Long-Horizon Agents More Reliable

The paper introduces Traverse, a benchmark of 2,518 agent trajectories and 6,967 annotated mistakes across software engineering, computer use, and science tasks, revealing that failures often go unrecovered and can cause irreversible harm before a run is deemed successful. It shows that human judges struggle to detect the first mistake in most runs, while a 4‑billion‑parameter verifier called Scout can locate failures more effectively and improve task success when used to select among candidate runs. The study demonstrates that making failure detection inexpensive and reliable can enable long‑horizon agents to learn from their own mistakes and increase trustworthiness in autonomous AI.

By Salman Rahman, Yubin Kim, Mihir Parmar, A. Ali Heydari, Genglin Liu, Simon A. Lee, Weizhi Zhang, Arian Hosseini, Ahmed A. Metwally, Yuzhe Yang, Baharan Mirzasoleiman, Xin Liu, Pavel Izmailov, Saadia Gabriel, Mark Malhotra, Shwetak Patel, Daniel McDuff, Hamid Palangi