Favorability of Loss Landscape with Weight Decay Requires Both Large Overparametrization and Initialization
Not on the map. Why?
Abstract (arXiv)
The optimization of neural networks under weight decay remains poorly understood from a theoretical standpoint. While weight decay is standard practice in modern training procedures, most theoretical analyses focus on unregularized settings. In this work, we investigate the loss landscape of the ℓ2-regularized training loss for two-layer ReLU networks. We show that the landscape becomes benign -- i.e., free of spurious local minima -- under large overparametrization, specifically when the network width m satisfies m gtrsim min(nd, 2n), where n is the number of data points and d the input dimension. More precisely in this regime, almost all constant activation regions contain a global minimum and no spurious local minima. We further show that this level of overparametrization is not only sufficient but also necessary via the example of orthogonal data. Finally, we demonstrate that such loss landscape results primarily hold relevance in the large initialization regime. In contrast, for small initializations -- corresponding to the feature learning regime -- optimization can still converge to spurious local minima, despite the global benignity of the landscape.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 50 of its 65 references that are in the map. First posted on arXiv 28 May 2025.
Builds on
50 of 65 references.
References · 50
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 641
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 426
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
- 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 331
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
38 more
- 2016Deep Learning without Poor Local Minimacited by 234
- 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 146
- 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 127
- 2018Stochastic subgradient method converges on tame functionscited by 124
- 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 106
- 2019How do infinite width bounded norm networks look in function space?cited by 106
- 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
- 2020Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networkscited by 98
- 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 83
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 80
- 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 76
- 2023Why Do We Need Weight Decay in Modern Deep Learning?cited by 72
- 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
- 2018Gradient Descent Quantizes ReLU Network Featurescited by 61
- 2020The Global Landscape of Neural Networks: An Overviewcited by 57
- 2019On Connected Sublevel Sets in Deep Learningcited by 51
- 2020Convex Geometry and Duality of Over-parameterized Neural Networkscited by 49
- 2024Clarabel: An interior-point solver for conic programs with quadratic objectivescited by 44
- 2020On the Convergence of Gradient Descent Training for Two-layer ReLU-networks in the Mean Field Regimecited by 39
- 2023SGD Finds then Tunes Features in Two-Layer Neural Networks with near-Optimal Sample Complexity: A Case Study in the XOR problemcited by 39
- 2020The Hidden Convex Optimization Landscape of Two-Layer ReLU Neural Networks: an Exact Characterization of the Optimal Solutionscited by 30
- 2018Small nonlinearities in activation functions create bad local minima in neural networkscited by 28
- 2023Early Neuron Alignment in Two-layer ReLU Networks with Small Initializationcited by 28
- 2022Convergence of gradient descent for deep neural networkscited by 24
- 2019Truth or Backpropaganda? An Empirical Investigation of Deep Learning Theorycited by 21
- 2020Piecewise linear activations substantially shape the loss surfaces of neural networkscited by 19
- 2023Penalising the biases in norm regularisation enforces sparsitycited by 19
- 2024Early alignment in two-layer networks training is a two-edged swordcited by 18
- 2024How Uniform Random Weights Induce Non-uniform Bias: Typical Interpolating Neural Networks Generalize with Narrow Teacherscited by 18
- 2023Mildly Overparameterized ReLU Networks Have a Favorable Loss Landscapecited by 17
- 2023Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputscited by 16
- 2025A Theoretical Framework for Grokking: Interpolation followed by Riemannian Norm Minimisationcited by 13
- 2024Exploring the loss landscape of regularized neural networks via convex dualitycited by 12
- 2021When Are Solutions Connected in Deep Networks?cited by 11
- 2024Simplicity bias and optimization threshold in two-layer ReLU networkscited by 11
- 2023Optimal Sets and Solution Paths of ReLU Networkscited by 10
- 2021A Note on Connectivity of Sublevel Sets in Deep Learningcited by 8
- 2025Convergence of Shallow ReLU Networks on Weakly Interacting Datacited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.