mlsanityData to 14 Oct 2026

Direct From Darwin: Deriving Advanced Optimizers From Evolutionary First Principles

arXiv 2605.05284 ↗First posted 6 May 2026cs.NE cs.LG q-bio.PEcited by 0

Not on the map. Why?

Abstract (arXiv)

Evolutionary computation has long promised to deliver both high-performance optimization tools as well as rigorous scientific simulations of Darwinian evolution. However, modern algorithms frequently abandon evolutionary fidelity for physics-inspired heuristics or superficial biological metaphors. This paper derives a suite of advanced gradient-based optimization algorithms directly from evolutionary first principles. We introduce Darwinian Lineage Simulations (DLS) to prove that, in an asexual context, Fisher's and Wright's historically opposed views of evolution are actually formally equivalent; One can partition Fisher's deterministically-evolving total population into Wright's randomly-drifting sub-populations. We prove that proper bookkeeping requires introducing a specific kind of structured noise (the DLS noise relation). Crucially, any bookkeeping choices which satisfy this relation will yield a faithful simulation of evolution. Using this vast representational freedom, we prove that a broad family of battle-tested optimization algorithms are already perfectly compatible with evolutionary dynamics. These include: Stochastic Gradient Descent as well as many regularizations/approximations of Newton's method and Natural Gradient Descent. By simply adding DLS noise (i.e., evolutionarily faithful genetic drift), these algorithms become scientifically valid in silico simulations of Darwinian evolution. Finally, we demonstrate that even the state-of-the-art Adam optimizer can be brought into evolutionary compliance through a minor mathematical surgery.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 60 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

14 of 60 references.

References · 14

  1. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  2. 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 574
  3. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  4. 2024Challenges in Training PINNs: A Loss Landscape Perspectivecited by 113
  5. 2025Optimizing the Optimizer for Physics-Informed Neural Networks and Kolmogorov-Arnold Networkscited by 42
  6. 2023An operator preconditioning perspective on training in physics-informed machine learningcited by 27
  7. 2026The Newton-Muon Optimizercited by 18
  8. 2026Muon2: Boosting Muon via Adaptive Second-Moment Preconditioningcited by 17
  9. 2020Correspondence between neuroevolution and gradient descentcited by 11
  10. 2023Evolutionary Optimization of Physics-Informed Neural Networks: Advancing Generalizability by the Baldwin Effectcited by 5
  11. 2019Information-geometric optimization with natural selectioncited by 3
  12. 2025The Paradox of Success in Evolutionary and Bioinspired Optimization: Revisiting Critical Issues, Key Studies, and Methodological Pathwayscited by 3
2 more
  1. 2023Evolutionary Algorithms in the Light of SGD: Limit Equivalence, Minima Flatness, and Transfer Learningcited by 1
  2. 2025The Price equation reveals a universal force-metric-bias law of algorithmic learning and natural selectioncited by 1

Built on by

Not cited yet.