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:2609.00023v1 Announce Type: cross
Abstract: In this paper, we introduce ES-AHD, a novel framework that fundamentally integrates Evolution Strategy (ES) into Large Language Model (LLM)-driven Au...
By Yutao Lai, Kezhao Lai, Hai-Lin Liu, Yuping Wang, Ping Guo
arXiv:2606. 29082v1 Announce Type: cross Abstract: Would experience designing faster GPU kernels also help close in on a long-standing open mathematical conjecture?
By Young-Jun Lee, Seungone Kim, Minki Kang, Alistair Cheong Liang Chuen, Zerui Chen, Seungho Han, Taehee Jung, Dongyeop Kang
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
arXiv:2610.00675v1 Announce Type: cross
Abstract: Evolutionary approaches to LLM-driven discovery often generate new programs from a small set of selected ancestors. This keeps contexts manageable bu...
By Bo Yuan, Wenqian Ye, Zelin Zhao, Lama Moukheiber, Henry Kautz, Aidong Zhang, Yongxin Chen
MAPLE is a new agent that maintains and updates optimization problems through successive natural‑language requests, combining language‑based problem construction with mathematical programming and evolutionary search. It preserves the optimization program, accepted plans, earlier updates, and candidate solutions for future requests, enabling rapid adaptation to changing business constraints. In a benchmark of 15 trajectories and 180 updates across various operational domains, MAPLE completed all trajectories with high online scalar quality and Pareto hypervolume ratio, and maintained update validity and useful search information across substantial revisions.
By Kesheng Chen, Yamin Hu, Wenjian Luo