arXiv AI

Mutation Without Variation: Convergence Dynamics in LLM-Driven Program Evolution

arXiv:2606. 05408v1 Announce Type: new Abstract: When an LLM repeatedly mutates a program, does it explore new forms or circle back to the same ones?

arXiv Machine Learning
Sep 14

PACEvolve: Enabling Progress-Aware Consistent Evolution

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
Hugging Face Trending Papers
Aug 11

EvoMem: Memory-Augmented Evolution for Code Optimization

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 AI
Aug 12

EvoMem: Memory-Augmented Evolution for Code Optimization

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
arXiv AI
Sep 17

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.

By Tanmay Sah, Dolly Sah, Harshul Jain, Tanya Sah
arXiv AI
Aug 19

Procedural Content Metageneration via Program Search and Continual Abstraction Discovery

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