The paper introduces a new framework for genetic algorithms where mutation and recombination operators are guided by machine‑learning optimization rather than random changes. It shows that such operators can improve objective values but at higher computational cost, and demonstrates three key phenomena: the necessity of solution‑pool diversity for parity learning, the simultaneous need for generation, mutation, and recombination to achieve near‑optimal solutions, and a phase transition in Gaussian settings where positive drift yields exponential speedup.
By Anna Brandenberger, Ilan Doron-Arad, Elchanan Mossel
The paper introduces LLM-EBG, an evolutionary framework that uses a large language model as a generative operator to automatically create optimization benchmarks. By generating unconstrained single-objective continuous minimization problems expressed as mathematical formulas, the framework can produce benchmarks that consistently favor a target algorithm over a comparison algorithm in over 80% of trials. Landscape analysis shows that these generated problems exhibit distinct geometric traits, such as sensitivity to variable scaling, reflecting the search behaviors of different optimization methods.
By Yuhiro Ono, Tomohiro Harada, Yukiya Miura
arXiv:2601.08696v2 Announce Type: replace-cross
Abstract: Neural Combinatorial Optimization (NCO) has mostly focused on learning policies, typically neural networks, that operate on a single candidat...
By Andoni Irazusta Garmendia, Josu Ceberio, Alexander Mendiburu
arXiv:2608. 06808v1 Announce Type: new Abstract: The Automatic Construction of Portfolios via Large Language Models (LLM-ACP) suffers from poor generalization in practical few-shot scenarios when solving complex combinatorial optimization problems.
By Shaofeng Zhang, Shengcai Liu, Zhiyuan Wang, Ke Tang
arXiv:2606. 15923v1 Announce Type: cross Abstract: Cartesian Genetic Programming (CGP) is among the practical and popular forms of Genetic Programming as it uses a graph-based representation of programs.
By Duc-Cuong Dang, Roman Kalkreuth, Andre Opris
arXiv:2606. 02438v1 Announce Type: new Abstract: Learned heuristics have recently become a competitive alternative to traditional domain-independent heuristics for satisficing planning.
By Windy Phung, Dominik Drexler, Arnaud Lequen, Jendrik Seipp
arXiv:2606. 25832v1 Announce Type: new Abstract: Achieving strong optimization generalization across diverse optimization problems while requiring limited training resources remains a challenging problem for optimization-oriented large language models (LLMs).
By Ke Zhao, Zixiang Di, Hong Qian, Xiang Shu, Yaolin Wen, Qitao Shi, Bingdong Li, Xingyu Lu, Xiangfeng Wang, Jun Zhou, Ke Tang, Yang Yu
arXiv:2608. 12679v1 Announce Type: new Abstract: Large Language Models (LLMs) are increasingly deployed in discovery domains such as math and science.
By Conor F. Hayes, Elliot Meyerson, Kajetan Schweighofer, Roberto Dailey, Babak Hodjat, Risto Miikkulainen, Xin Qiu
arXiv:2609.00129v1 Announce Type: cross
Abstract: The performance of artificial intelligence (AI) and machine learning (ML) models degrades when the problem they were trained on drifts. This is a nea...
By J. M. Diederik Kruijssen (Allora Foundation)
arXiv:2607. 10127v1 Announce Type: cross Abstract: Evolutionary program search guided by Large Language Models (LLMs) has emerged as a powerful paradigm for automated scientific discovery.
By Xuanzhou Chen, Taoli Cheng
arXiv:2505. 15201v5 Announce Type: replace-cross Abstract: Reinforcement Learning (RL) algorithms sample multiple n>1 solution attempts for each problem and reward them independently.
By Christian Walder, Deep Karkhanis
arXiv:2605.28703v2 Announce Type: replace-cross
Abstract: Baldwinian and Lamarckian evolution have existed for a long time in evolutionary algorithms (EAs) without ever dominating the academic litera...
By In\`es Benito, Johannes F. Lutzeyer, Benjamin Doerr