Evolving Deep Learning Optimizers
Not on the map. Why?
Abstract (arXiv)
We present a genetic algorithm framework for automatically discovering deep learning optimization algorithms. Our approach encodes optimizers as genomes that specify combinations of primitive update terms (gradient, momentum, RMS normalization, Adam-style adaptive terms, and sign-based updates) along with hyperparameters and scheduling options. Through evolutionary search over 50 generations with a population of 50 individuals, evaluated across multiple vision tasks, we discover an evolved optimizer that outperforms Adam by 2.6% in aggregate fitness and achieves a 7.7% relative improvement on CIFAR-10. The evolved optimizer combines sign-based gradient terms with adaptive moment estimation, uses lower momentum coefficients than Adam (β1=0.86, β2=0.94), and notably disables bias correction while enabling learning rate warmup and cosine decay. Our results demonstrate that evolutionary search can discover competitive optimization algorithms and reveal design principles that differ from hand-crafted optimizers. Code is available at https://github.com/mmarfinetz/evo-optimizer.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 13 references that are in the map. First posted on arXiv 5 Dec 2025.
Builds on
6 of 13 references.
References · 6
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 909
- 2016Learning to learn by gradient descent by gradient descentcited by 620
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2016Learning to Optimizecited by 195
- 2017Learned Optimizers that Scale and Generalizecited by 110
- 2017Neural Optimizer Search with Reinforcement Learningcited by 82
Built on by
Citing papers per year: 2026: 2.
2 papers.