arXiv AI By Matthew Siper, Ahmed Khalifa, Julian Togelius

Procedural Content Metageneration via Program Search and Continual Abstraction Discovery

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

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