In plain words: Instead of changing candidate solutions with random mutations and swaps, this approach trains a system to pick better changes as conditions shift. It raised fitness faster each generation and reached higher final fitness than standard evolutionary algorithms on both puzzle-like and number-based problems.
Abstract
Evolution and learning are two of the fundamental mechanisms by which life adapts in order to survive and to transcend limitations. These biological phenomena inspired successful computational methods such as evolutionary algorithms and deep learning. Evolution relies on random mutations and on random genetic recombination. Here we show that learning to evolve, i.e. learning to mutate and recombine better than at random, improves the result of evolution in terms of fitness increase per generation and even in terms of attainable fitness. We use deep reinforcement learning to learn to dynamically adjust the strategy of evolutionary algorithms to varying circumstances. Our methods outperform classical evolutionary algorithms on combinatorial and continuous optimization problems.
Jan Schuchardt, Vladimir Golkov, Daniel Cremers
arXiv:1905.03389 · cs.NE, cs.AI, cs.CV, cs.LG, stat.ML · submitted May 8, 2019
abstract · pdf · html