Non-attracting Regions of Local Minima in Deep and Wide Neural Networks
Not on the map. Why?
Abstract (arXiv)
Understanding the loss surface of neural networks is essential for the design of models with predictable performance and their success in applications. Experimental results suggest that sufficiently deep and wide neural networks are not negatively impacted by suboptimal local minima. Despite recent progress, the reason for this outcome is not fully understood. Could deep networks have very few, if at all, suboptimal local optima? or could all of them be equally good? We provide a construction to show that suboptimal local minima (i.e., non-global ones), even though degenerate, exist for fully connected neural networks with sigmoid activation functions. The local minima obtained by our construction belong to a connected set of local solutions that can be escaped from via a non-increasing path on the loss curve. For extremely wide neural networks of decreasing width after the wide layer, we prove that every suboptimal local minimum belongs to such a connected set. This provides a partial explanation for the successful application of deep neural networks. In addition, we also characterize under what conditions the same construction leads to saddle points instead of local minima for deep neural networks.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 3; 2026: 2.
8 papers.
- 2024Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivitycited by 9
- 2022On the Omnipresence of Spurious Local Minima in Certain Neural Network Training Problemscited by 8
- 2022Convergence and Implicit Regularization Properties of Gradient Descent for Deep Residual Networkscited by 3
- 2025Flat Channels to Infinity in Neural Loss Landscapescited by 3
- 2025From Sublinear to Linear: Local Convergence in Finite-Width Networks via Locally Polyak-Lojasiewicz Regionscited by 1
- 2025A novel Information-Driven Strategy for Optimal Regression Assessmentcited by 0
- 2026Single Pixel Image Classification using an Ultrafast Digital Light Projectorcited by 0
- 2026Benign Loss Landscapes Can Coexist with Worst-Case Hardnesscited by 0
- 2026Benign Loss Landscapes Can Coexist with Worst-Case Hardness11 Sep 2026
- 2026Single Pixel Image Classification using an Ultrafast Digital Light Projector12 Mar 2026
- 2025A novel Information-Driven Strategy for Optimal Regression Assessment16 Oct 2025
- 2025From Sublinear to Linear: Local Convergence in Finite-Width Networks via Locally Polyak-Lojasiewicz Regions29 Jul 2025
- 2025Flat Channels to Infinity in Neural Loss Landscapes17 Jun 2025
- 2024Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivity9 Apr 2024
- 2022Convergence and Implicit Regularization Properties of Gradient Descent for Deep Residual Networks14 Apr 2022
- 2022On the Omnipresence of Spurious Local Minima in Certain Neural Network Training Problems23 Feb 2022