arXiv AI

EvoUndo: Recoverability-Constrained Self-Evolution for LLM Agent Harnesses

EvoUndo is a framework that enables large language model agents to self‑evolve—modifying prompts, tools, and execution harnesses—while ensuring that these changes can be reliably reversed across different states. The study evaluates EvoUndo on 600 unseen one‑shot self‑evolution tasks, finding that 197 capability‑improving mutations fail recoverability checks. By extending the recovery language and adding exact state‑address diagnostics, the framework recovers up to 191 out of 197 failures, demonstrating that robust self‑evolution requires co‑designing verification, grounding, witness semantics, and recovery expressivity.

arXiv AI
Jul 31

Living-Harness Is an Interactive-Agent Evolver

arXiv:2607. 26598v1 Announce Type: cross Abstract: Large language model (LLM) agents may recover from a failure within an episode or after a retry, yet the same execution failure can recur in later tasks because post-episode feedback rarely revises the persistent harness that guides future interactions.

By Yuetian Du, Yucheng Wang, He Xu, Jiexu Xu, Shanwen Tan, Bing Zhao, Boyu Yang, Zhijie Xu, Ming Kong, Hu Wei, Jie Liu, Qiang Zhu
arXiv Computation and Language
5d ago

LegoEnv: Self-Evolving Agentic Environments via Modular Recombination

LegoEnv introduces a new paradigm for creating agentic environments by recombining reusable atoms—intent, rule, data, and server—rather than building each environment from scratch. The system automatically evolves these atoms when an environment fails to provide reliable feedback, leading to a significant increase in solvable environments from 71.6% to 88.3% after one evolution round. Experiments on AutomationBench show that training on LegoEnv environments doubles the performance of large language models, with SFT boosting Qwen3.6-27B from 16.0% to 32.0% and RL improving Qwen3.8-27B from 37.6% to 40.3%. whyItMatters":"LegoEnv’s modular, self‑evolving approach enables scalable, generalizable environment construction that directly enhances the training and performance of LLM agents on diverse tasks."

By Zhuosong Jiang, Chengxu Wu, Junqi Liu, Yujie Yi, Siqin Wang, Zhixuan Huang, Jinqian Jiang, Lijun Xiao, Jianxun Li, Yongyang Pan, Jieran Wang, Shiqi Shen, Fei Liu, Xinyu Lin
arXiv Computation and Language
Oct 22

VeriEvolve: Evaluator-First Evolution for Tool-Using Agents

VeriEvolve is an evaluator-first evolution framework that first builds an executable evaluator from task instructions, then uses this evaluator as a frozen fitness signal while evolving agents. The system generates challenge states and counterfactual test cases to refine the evaluator across rounds, producing 30 evaluators for 30 MCPMark Filesystem tasks with perfect agreement on generated suites and high agreement on held-out states. Evaluator-guided evolution significantly improves externally verified success rates for GLM-5.2 and Claude, and cross-environment studies reveal complementary limits from observability, state representation, and search/execution capacity.

By Yueshen Li, Kamer Ali Yuksel, Gokhan Tur, Dilek Hakkani-T\"ur, Jo\~ao Pedro Maia
arXiv AI
Oct 16

Don't Regenerate, Debug: A Domain-Specific Agent for Repairing Near-Miss Accelerator Kernels

The paper introduces a domain‑specific debugging agent for repairing near‑miss accelerator kernels, arguing that debugging is more efficient than regenerating kernels from scratch. It tackles knowledge scarcity, integrity, and cost control through pattern retrieval, anti‑cheat detection, and convergence safeguards. Empirical results show the debug agent achieves a 66.7% Pass@1 rate and uses 92.8% fewer tokens per success compared to traditional regeneration methods.

By Yansong Sun, Shenxiu Wu, Siyuan Chen, Runlin Hou, Junhao Qiu, Junming Cao, Shudi Shao, Zhichao Lu, Qingfu Zhang
arXiv AI
Aug 5

Don't Regenerate, Debug: A Domain-Specific Agent for Repairing Near-Miss Hardware Operators

arXiv:2608. 02712v1 Announce Type: cross Abstract: Kernel generation for hardware accelerators such as GPUs and NPUs has become a proving ground for large language models (LLMs), and state-of-the-art systems raise correctness through pipelines that couple LLMs with agentic reinforcement learning and evolutionary search.

By Yansong Sun, Shenxiu Wu, Siyuan Chen, Runlin Hou, Junhao Qiu, Junming Cao, Shudi Shao, Zhichao Lu, Qingfu Zhang