mlsanityData to 7 Oct 2026

Removing spurious minima for planar features by skip connections

arXiv 2610.01728 ↗First posted 1 Oct 2026cs.LG cs.AI math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

Understanding loss landscapes is central to explaining neural-network training, yet their structure remains only partially understood even in simple models. We study the Gaussian population loss of shallow, bias-free ReLU networks in the teacher--student setting. This provides a simple model for studying essential aspects such as feature learning and overparameterization. For teacher networks with positive output weights and planar features, we show that including a learned linear skip removes all spurious local minima with non-negative student output weights once the student network is at least as wide as the teacher network. In contrast, without the skip, we construct a fixed teacher network with positive output weights and only three hidden neurons in input dimension two whose spurious local minima persist at every student width at least three. Thus, a learned linear skip can remove spurious minima that persist under arbitrary overparameterization. Furthermore, we show that a positive output weight student network always learns the subspace spanned by the teacher features: student features at local minima with non-negative student output weights lie in the span of the teacher features. For ReLU networks in two dimensions, even heavily overparameterized student networks have effective width controlled by the teacher width: every critical point with positive student output weights has at most twice as many distinct student feature directions as teacher neurons. Finally, we transfer the benignity result to empirical minima over parameter balls of any prescribed radius, with the required sampling accuracy depending on that radius.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 38 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

28 of 38 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Identity Mappings in Deep Residual Networkscited by 1,960
  3. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  4. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  5. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  6. 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
  7. 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 125
  8. 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
  9. 2020Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networkscited by 96
  10. 2016The Landscape of Empirical Risk for Non-convex Lossescited by 86
  11. 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 61
  12. 2017An Analytical Formula of Population Gradient for two-layered ReLU network and its Applications in Convergence and Critical Point Analysiscited by 52
16 more
  1. 2021A Local Convergence Theory for Mildly Over-Parameterized Two-Layer Neural Networkcited by 47
  2. 2018Uniform Convergence of Gradients for Non-Convex Learning and Optimizationcited by 38
  3. 2020The Effects of Mild Over-parameterization on the Optimization Landscape of Shallow ReLU Neural Networkscited by 33
  4. 2020The Hidden Convex Optimization Landscape of Two-Layer ReLU Neural Networks: an Exact Characterization of the Optimal Solutionscited by 30
  5. 2019Semi-flat minima and saddle points by embedding neural networks to overparameterizationcited by 29
  6. 2018Adding One Neuron Can Eliminate All Bad Local Minimacited by 21
  7. 2018Depth with Nonlinearity Creates No Bad Local Minima in ResNetscited by 17
  8. 2021Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks: A Tale of Symmetry IIcited by 16
  9. 2018Are ResNets Provably Better than Linear Predictors?cited by 12
  10. 2024Exploring the loss landscape of regularized neural networks via convex dualitycited by 11
  11. 2022Annihilation of Spurious Minima in Two-Layer ReLU Networkscited by 9
  12. 2019Are deep ResNets provably better than linear predictors?cited by 6
  13. 2024Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embeddingcited by 6
  14. 2026Mathematicians in the age of AIcited by 4
  15. 2026Shaping the Future of Mathematics in the Age of AIcited by 2
  16. 2026When Both Layers Learn: Training Dynamics of Representing Linear Models via ReLU Networkscited by 1

Built on by

Not cited yet.