arXiv AI

Co-Evolving Agents: Learning from Failures as Hard Negatives

The paper introduces a co‑evolving framework where a target agent improves by learning from its own failures, and a separate failure agent is trained to generate hard negative trajectories. These hard negatives, derived from plausible but incorrect attempts, help the target agent better distinguish successful behavior from subtle errors. Experiments on online shopping, scientific reasoning, and interactive SQL querying show a 5.7% average reward improvement over baseline methods.

arXiv AI
2d ago

Survival is the Only Reward: Sustainable Self-Training Through Environment-Mediated Selection

arXiv:2601.12310v2 Announce Type: replace Abstract: Self-training systems often degenerate due to the lack of an external criterion for judging data quality, leading to reward hacking and semantic dr...

By Jennifer Dodgson, Alfath Daryl Alhajir, Michael Joedhitya, Akira Rafhael Janson Pattirane, Surender Suresh Kumar, Joseph Lim, C. H. Peh, Adith Ramdas, Steven Zhang Zhexu
arXiv AI
Sep 2

HarnessEvolve: Learning from Reference Trajectories for Reliable Agent Self-Evolution

HarnessEvolve is a self‑evolving framework that improves agent harnesses—prompts, skills, tools, and execution logic—by learning from reference trajectories. It separates execution, evaluation, optimization, and gating into independent modules, addressing credit assignment failure, shortcut learning, and catastrophic forgetting. The approach uses reference trajectories to extract error signals, applies quality and performance gates to candidate updates, and validates updates on held‑out data, consistently outperforming state‑of‑the‑art baselines across diverse benchmarks.

By Wen Jiang, Mingmin Chu, Yimeng Tian, Qianxin Zhang, Haofei Yang, Rui Yang, Yang Liu, Tao Lv, Fangming Li
arXiv AI
Aug 26

CAFE: Self-Improving Search Agents Need Co-Evolving Feedback

CAFE (Coupled Agent–Feedback Evolution) is a framework that lets a shared‑parameter model alternate between acting as a search agent and as a critic that provides corrective feedback. By learning when to request feedback and how to use it, CAFE trains the agent to recover from its own failures and shapes rewards both online and offline. Experiments on seven search benchmarks show that CAFE outperforms other RL‑based agents, maintains gains on out‑of‑domain tests, and reduces hallucinations, indicating that co‑evolving feedback is essential for self‑improving search agents.

By Boyang Liu, Senjie Jin, Peixin Wang, Zhangyue Yin, Yibo Wang, Yuhao Zhou, Xinbing Liang, Shizheng Zhu, Yuhui Wang, Jingqi Tong, Zhiheng Xi, Jiazheng Zhang, Clive Bai, Clarenceai, Blaze Chen, Tao Gui, Qi Zhang, Xuanjing Huang
arXiv AI
Sep 25

A Wrong Turn Does Not Ruin the Journey: Deviation-Guided Skill Self-Evolution for LLM Agents

The paper introduces SkillPivot, a framework that guides large language model agents to evolve their skills by pinpointing the exact moment a useful problem‑solving sequence turns into an erroneous suffix. SkillPivot uses execution validity, goal progress, and action diversity to detect this deviation point, then employs a stronger teacher to generate a successful alternative from the same prefix. By contrasting the failed and successful suffixes, the method produces localized, compact skill updates that preserve existing effective guidance, outperforming other skill‑evolution techniques on benchmarks such as ToolQA, LogicBench, and WildClawBench.

By Yichun Feng, Jiawei Wang, Haozhe Sun
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