Program evolution can measure whether a mutation helped, but it rarely controls how far the mutation moves in behavior space. Syntactic edit size is an unreliable proxy: a small code change can alter nearly every action, while a larger rewrite can preserve the same execution trace.
arXiv:2608. 10196v1 Announce Type: cross Abstract: Program evolution can measure whether a mutation helped, but it rarely controls how far the mutation moves in behavior space.
By Matthew Siper, Ahmed Khalifa, Julian Togelius
The paper introduces PACEvolve, a framework that improves self‑evolving agents powered by Large Language Models by addressing their tendency to become trapped in local contexts and repeat flawed hypotheses. It does so through three techniques: Hierarchical Context Management to prune memory, Momentum‑Based Backtracking to escape local minima, and a self‑adaptive Collaborative Evolution policy to balance refinement and knowledge transfer. These methods enable the agents to maintain a global view of search momentum and achieve state‑of‑the‑art results on complex evolutionary benchmarks.
By Minghao Yan, Bo Peng, Benjamin Coleman, Ziqi Chen, Zhouhang Xie, Shuo Chen, Zhankui He, Noveen Sachdeva, Isabella Ye, Weili Wang, Chi Wang, Ed H. Chi, Fernando Pereira, Wang-Cheng Kang, Derek Zhiyuan Cheng, Beidou Wang
arXiv:2606. 26173v1 Announce Type: new Abstract: Recent work shows that Large Language Models (LLMs) can act as semantic mutation operators for the evolutionary discovery of programs and proofs.
By Dhruv Sharma, Gautam Shroff
Successful mutation strategies in evolutionary code search may contain reusable knowledge that is useful beyond a single run, and in some cases may transfer across related tasks and domains. However, existing LLM-driven evolutionary frameworks largely discard such knowledge, repeatedly rediscovering similar ideas and limiting opportunities for cross-run and cross-task learning.
arXiv:2608. 10795v1 Announce Type: new Abstract: Successful mutation strategies in evolutionary code search may contain reusable knowledge that is useful beyond a single run, and in some cases may transfer across related tasks and domains.
By Viktor Volkov, Valentin Khrulkov, Andrey V. Galichin, Danil Sivtsov, Nikita Glazkov, Olga Volkova, Konstantin Pchelin, Iaroslav Bespalov, Dmitry V. Dylov, Petr Anokhin, Ivan Oseledets
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.
By Tanmay Sah, Dolly Sah, Harshul Jain, Tanya Sah
arXiv:2608. 07645v1 Announce Type: new Abstract: Self-improving coding agents that iteratively rewrite their own source code have demonstrated impressive performance on coding tasks.
By Changzhi Liu, Yilun Liu, Sikuan Yan, Volker Tresp, Yunpu Ma
arXiv:2609.37371v1 Announce Type: cross
Abstract: Model adaptation is typically governed by a fixed recipe, even though different update programs can produce substantially different behavioral outcom...
By Rebecca Ramnauth, Brian Scassellati
arXiv:2608. 05651v1 Announce Type: cross Abstract: Large language model (LLM)-driven evolution has shown promise for program search and algorithm discovery, but relying on strong models throughout long evolutionary runs is costly.
By Sichun Luo, Yi Huang, Guanzhi Deng, Haibo Wang, Haochen Luo, Lei Li, Zefa Hu, Junlan Feng, Qi Liu
arXiv:2609.38639v1 Announce Type: new
Abstract: LLM-guided evolutionary search can discover complex programs, but existing methods mostly only save candidate programs and fitness scores while discard...
By Ethan Lin, Jinming Nian, Yi Fang
The paper demonstrates that large language models can generate executable procedural content generators, enabling direct search over generator programs rather than individual levels. Using Sokoban, Zelda, Dangerous Dave, and Lode Runner, the authors evolve complete Python generators via language‑model mutation and crossover, and introduce Continual Abstraction Discovery (CAD) to extract reusable primitives into a run‑specific helper module. Experiments show that CAD consistently improves mean final best fitness across all domain and API comparisons, with learned libraries being adopted by subsequent programs and repeatedly rediscovering useful utilities.
By Matthew Siper, Ahmed Khalifa, Julian Togelius