AINeutralarXiv – CS AI · Jun 116/10
🧠
Mathematical perspective on genetic algorithms with optimization guided operators
Researchers present a mathematical framework for genetic algorithms that employ ML-guided mutation and recombination operators instead of random transformations, modeling the approach as a query-complexity problem. The work demonstrates that certain optimization problems require all three components—generation, mutation, and recombination—to be solved efficiently, with solution diversity playing a critical role in practical performance.