pith. sign in

arxiv: 1905.03389 · v1 · pith:FM272HMYnew · submitted 2019-05-08 · 💻 cs.NE · cs.AI· cs.CV· cs.LG· stat.ML

Learning to Evolve

classification 💻 cs.NE cs.AIcs.CVcs.LGstat.ML
keywords learningalgorithmsevolutionevolutionaryrandomdeepevolvefitness
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.