Searching the Space of Feed-Forward Neural-Network Weight-Update Rules with Fixed Depth Symbolic Regression
Not on the map. Why?
Abstract (arXiv)
We investigate whether symbolic regression can discover explicit neural network weight-update rules that outperform standard hand-designed optimizers on small symbolic regression benchmarks. Candidate update rules are represented as fixed-depth symbolic expressions over operands derived from common optimizers, including gradient, momentum, adaptive-gradient, and moment-estimate quantities. Across 30 benchmark/neural network combinations, the symbolic regression procedure found an update rule outperforming the best hyperparameter-tuned established optimizer in 25 cases, with an aggregate MSE reduction of 44.47% over the improved cases. The discovered rules do not all share a single common symbolic form, but many combine adaptive normalization, momentum-like quantities, nonlinear transformations, and rational expressions. These results suggest that symbolic regression can serve as a lightweight mechanism for discovering compact optimizer variants, while also highlighting the need for larger-scale validation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 14 references that are in the map. First posted on arXiv 23 Jul 2026.
Builds on
6 of 14 references.
References · 6
- 2016Learning to learn by gradient descent by gradient descentcited by 620
- 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 548
- 2020AutoML-Zero: Evolving Machine Learning Algorithms From Scratchcited by 143
- 2017Neural Optimizer Search with Reinforcement Learningcited by 82
- 2020Finding online neural update rules by learning to remembercited by 2
- 2024Solving the 2D Advection-Diffusion Equation using Fixed-Depth Symbolic Regression and Symbolic Differentiation without Expression Treescited by 1
Built on by
Not cited yet.