mlsanityData to 7 Oct 2026

The boundary of neural network trainability is fractal

arXiv 2402.06184 ↗First posted 9 Feb 2024cs.LG cs.NE nlin.CDcited by 12

Not on the map. Why?

Abstract (arXiv)

Some fractals -- for instance those associated with the Mandelbrot and quadratic Julia sets -- are computed by iterating a function, and identifying the boundary between hyperparameters for which the resulting series diverges or remains bounded. Neural network training similarly involves iterating an update function (e.g. repeated steps of gradient descent), can result in convergent or divergent behavior, and can be extremely sensitive to small changes in hyperparameters. Motivated by these similarities, we experimentally examine the boundary between neural network hyperparameters that lead to stable and divergent training. We find that this boundary is fractal over more than ten decades of scale in all tested configurations.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 5 of its 13 references that are in the map. First posted on arXiv 9 Feb 2024.

Builds on

5 of 13 references.

References · 5

  1. 2021Convex optimizationcited by 2,479
  2. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  3. 2018Understanding and correcting pathologies in the training of learned optimizerscited by 97
  4. 2020Stochasticity of Deterministic Gradient Descent: Large Learning Rate for Multiscale Objective Functioncited by 26
  5. 2023From Stability to Chaos: Analyzing Gradient Descent Dynamics in Quadratic Regressioncited by 16

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 9; 2026: 1.

12 papers.