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.
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.
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...
arXiv:2606. 13799v1 Announce Type: cross Abstract: Finding the shortest program that generates a sequence is uncomputable, and for six decades that fact has been mistaken for a wall around finding any generating program.
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.
arXiv:2606. 12279v1 Announce Type: cross Abstract: Recent work in ML applies genetic algorithms at inference time to iteratively improve solutions to optimization problems.
arXiv:2609.36735v1 Announce Type: new Abstract: In branch-and-bound (B&B) for mixed-integer linear programming (MILP), branching variable selection critically impacts efficiency. Existing neural bran...
arXiv:2605. 29649v2 Announce Type: replace Abstract: Heuristic search is the dominant paradigm in symbolic AI planning, and the strongest heuristics are the result of decades of work by planning researchers.