mlsanityData to 7 Oct 2026

Spurious Valleys in Two-layer Neural Network Optimization Landscapes

arXiv 1802.06384 ↗First posted 18 Feb 2018math.OC cs.LG stat.MLcited by 20

Not on the map. Why?

Abstract (arXiv)

Neural networks provide a rich class of high-dimensional, non-convex optimization problems. Despite their non-convexity, gradient-descent methods often successfully optimize these models. This has motivated a recent spur in research attempting to characterize properties of their loss surface that may explain such success. In this paper, we address this phenomenon by studying a key topological property of the loss: the presence or absence of spurious valleys, defined as connected components of sub-level sets that do not include a global minimum. Focusing on a class of two-layer neural networks defined by smooth (but generally non-linear) activation functions, we identify a notion of intrinsic dimension and show that it provides necessary and sufficient conditions for the absence of spurious valleys. More concretely, finite intrinsic dimension guarantees that for sufficiently overparametrised models no spurious valleys exist, independently of the data distribution. Conversely, infinite intrinsic dimension implies that spurious valleys do exist for certain data distributions, independently of model overparametrisation. Besides these positive and negative results, we show that, although spurious valleys may exist in general, they are confined to low risk levels and avoided with high probability on overparametrised models.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Feb 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 7; 2023: 3; 2024: 1; 2025: 0; 2026: 2.

20 papers.

Sort:

  1. 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Frameworkcited by 106
  2. 2023NTK-SAP: Improving neural network pruning by aligning training dynamicscited by 30
  3. 2021Analyzing Monotonic Linear Interpolation in Neural Network Loss Landscapescited by 27
  4. 2021Exponentially Many Local Minima in Quantum Neural Networkscited by 22
  5. 2021Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorizationcited by 15
  6. 2022Plateau in Monotonic Linear Interpolation -- A "Biased" View of Loss Landscape for Deep Networkscited by 10
  7. 2021A Note on Connectivity of Sublevel Sets in Deep Learningcited by 8
  8. 2022When Expressivity Meets Trainability: Fewer than n Neurons Can Workcited by 8
  9. 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activationscited by 7
  10. 2021A Convergence Theory Towards Practical Over-parameterized Deep Neural Networkscited by 4
  11. 2022Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysiscited by 4
  12. 2023A qualitative difference between gradient flows of convex functions in finite- and infinite-dimensional Hilbert spacescited by 3
8 more
  1. 2023Minimum norm interpolation by perceptra: Explicit regularization and implicit biascited by 3
  2. 2026Sharp description of local minima in the loss landscape of high-dimensional two-layer ReLU neural networkscited by 2
  3. 2022Deep learning, stochastic gradient descent and diffusion mapscited by 1
  4. 2024A topological description of loss surfaces based on Betti Numberscited by 1
  5. 2022Global Convergence Analysis of Deep Linear Networks with A One-neuron Layercited by 0
  6. 2022Complexity from Adaptive-Symmetries Breaking: Global Minima in the Statistical Mechanics of Deep Neural Networkscited by 0
  7. 2022Demystifying the Global Convergence Puzzle of Learning Over-parameterized ReLU Nets in Very High Dimensionscited by 0
  8. 2026Benign Loss Landscapes Can Coexist with Worst-Case Hardnesscited by 0