Global optimality conditions for deep neural networks
Not on the map. Why?
Abstract (arXiv)
We study the error landscape of deep linear and nonlinear neural networks with the squared error loss. Minimizing the loss of a deep linear neural network is a nonconvex problem, and despite recent progress, our understanding of this loss surface is still incomplete. For deep linear networks, we present necessary and sufficient conditions for a critical point of the risk function to be a global minimum. Surprisingly, our conditions provide an efficiently checkable test for global optimality, while such tests are typically intractable in nonconvex optimization. We further extend these results to deep nonlinear neural networks and prove similar sufficient conditions for global optimality, albeit in a more limited function space setting.
Key facts. Cited by 31 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Jul 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 12; 2022: 6; 2023: 3; 2024: 2; 2025: 6; 2026: 2.
31 papers.
Sort:
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 227
- 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscapecited by 39
- 2021Overparameterization of deep ResNet: zero loss and mean-field analysiscited by 24
- 2021The loss landscape of deep linear neural networks: a second-order analysiscited by 24
- 2021Convergence of gradient descent for learning linear neural networkscited by 22
- 2021Noether: The More Things Change, the More Stay the Samecited by 19
- 2025Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network Architecturescited by 15
- 2021On the Global Convergence of Gradient Descent for multi-layer ResNets in the mean-field regimecited by 12
- 2021When Are Solutions Connected in Deep Networks?cited by 11
- 2024Only Strict Saddles in the Energy Landscape of Predictive Coding Networks?cited by 10
- 2023Towards Training Without Depth Limits: Batch Normalization Without Gradient Explosioncited by 8
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activationscited by 7
19 more
- 2022Piecewise Linear Neural Networks and Deep Learningcited by 7
- 2023Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Losscited by 7
- 2021A Convergence Theory Towards Practical Over-parameterized Deep Neural Networkscited by 4
- 2024Exploring Loss Landscapes through the Lens of Spin Glass Theorycited by 4
- 2025Distributionally Robust Optimization via Diffusion Ambiguity Modelingcited by 4
- 2025Backward Oversmoothing: why is it hard to train deep Graph Neural Networks?cited by 3
- 2021The Landscape of Multi-Layer Linear Neural Network From the Perspective of Algebraic Geometrycited by 2
- 2021Analysis and Optimisation of Bellman Residual Errors with Neural Function Approximationcited by 2
- 2022Memorization-Dilation: Modeling Neural Collapse Under Label Noisecited by 2
- 2023Transferring Learning Trajectories of Neural Networkscited by 2
- 2025Non-Adaptive Adversarial Face Generationcited by 2
- 2022Parameter Convex Neural Networkscited by 1
- 2022A Dynamics Theory of Implicit Regularization in Deep Low-Rank Matrix Factorizationcited by 1
- 2025Learnable Game-theoretic Policy Optimization for Data-centric Self-explanation Rationalizationcited by 1
- 2026Structural Correspondence and Universal Approximation in Diagonal plus Low-Rank Neural Networkscited by 1
- 2021Training Deep Neural Networks via Branch-and-Boundcited by 0
- 2022Complexity from Adaptive-Symmetries Breaking: Global Minima in the Statistical Mechanics of Deep Neural Networkscited by 0
- 2025Computing frustration and near-monotonicity in deep neural networkscited by 0
- 2026Benign Loss Landscapes Can Coexist with Worst-Case Hardnesscited by 0
- 2026Benign Loss Landscapes Can Coexist with Worst-Case Hardness11 Sep 2026
- 2026Structural Correspondence and Universal Approximation in Diagonal plus Low-Rank Neural Networks7 May 2026
- 2025Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network Architectures23 Dec 2025
- 2025Distributionally Robust Optimization via Diffusion Ambiguity Modeling26 Oct 2025
- 2025Learnable Game-theoretic Policy Optimization for Data-centric Self-explanation Rationalization15 Oct 2025
- 2025Computing frustration and near-monotonicity in deep neural networks6 Oct 2025
- 2025Non-Adaptive Adversarial Face Generation16 Jul 2025
- 2025Backward Oversmoothing: why is it hard to train deep Graph Neural Networks?22 May 2025
- 2024Only Strict Saddles in the Energy Landscape of Predictive Coding Networks?21 Aug 2024
- 2024Exploring Loss Landscapes through the Lens of Spin Glass Theory30 Jul 2024
- 2023Towards Training Without Depth Limits: Batch Normalization Without Gradient Explosion3 Oct 2023
- 2023Transferring Learning Trajectories of Neural Networks23 May 2023
19 more
- 2023Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Loss6 Mar 2023
- 2022A Dynamics Theory of Implicit Regularization in Deep Low-Rank Matrix Factorization29 Dec 2022
- 2022Piecewise Linear Neural Networks and Deep Learning18 Jun 2022
- 2022Parameter Convex Neural Networks11 Jun 2022
- 2022Memorization-Dilation: Modeling Neural Collapse Under Label Noise11 Jun 2022
- 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscape20 Jan 2022
- 2022Complexity from Adaptive-Symmetries Breaking: Global Minima in the Statistical Mechanics of Deep Neural Networks3 Jan 2022
- 2021On the Global Convergence of Gradient Descent for multi-layer ResNets in the mean-field regime6 Oct 2021
- 2021Convergence of gradient descent for learning linear neural networks4 Aug 2021
- 2021The loss landscape of deep linear neural networks: a second-order analysis28 Jul 2021
- 2021Analysis and Optimisation of Bellman Residual Errors with Neural Function Approximation16 Jun 2021
- 2021Overparameterization of deep ResNet: zero loss and mean-field analysis30 May 2021
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Features6 May 2021
- 2021Noether: The More Things Change, the More Stay the Same12 Apr 2021
- 2021Training Deep Neural Networks via Branch-and-Bound5 Apr 2021
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activations25 Feb 2021
- 2021When Are Solutions Connected in Deep Networks?18 Feb 2021
- 2021The Landscape of Multi-Layer Linear Neural Network From the Perspective of Algebraic Geometry30 Jan 2021
- 2021A Convergence Theory Towards Practical Over-parameterized Deep Neural Networks12 Jan 2021
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 227
- 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscapecited by 39
- 2021Overparameterization of deep ResNet: zero loss and mean-field analysiscited by 24
- 2021The loss landscape of deep linear neural networks: a second-order analysiscited by 24
- 2021Convergence of gradient descent for learning linear neural networkscited by 22
- 2021Noether: The More Things Change, the More Stay the Samecited by 19
- 2025Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network Architecturescited by 15
- 2021On the Global Convergence of Gradient Descent for multi-layer ResNets in the mean-field regimecited by 12
- 2021When Are Solutions Connected in Deep Networks?cited by 11
- 2024Only Strict Saddles in the Energy Landscape of Predictive Coding Networks?cited by 10
- 2023Towards Training Without Depth Limits: Batch Normalization Without Gradient Explosioncited by 8
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activationscited by 7
12 most cited of 31 All 31 (JSON)
- 2026Benign Loss Landscapes Can Coexist with Worst-Case Hardness11 Sep 2026
- 2026Structural Correspondence and Universal Approximation in Diagonal plus Low-Rank Neural Networks7 May 2026
- 2025Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network Architectures23 Dec 2025
- 2025Distributionally Robust Optimization via Diffusion Ambiguity Modeling26 Oct 2025
- 2025Learnable Game-theoretic Policy Optimization for Data-centric Self-explanation Rationalization15 Oct 2025
- 2025Computing frustration and near-monotonicity in deep neural networks6 Oct 2025
- 2025Non-Adaptive Adversarial Face Generation16 Jul 2025
- 2025Backward Oversmoothing: why is it hard to train deep Graph Neural Networks?22 May 2025
- 2024Only Strict Saddles in the Energy Landscape of Predictive Coding Networks?21 Aug 2024
- 2024Exploring Loss Landscapes through the Lens of Spin Glass Theory30 Jul 2024
- 2023Towards Training Without Depth Limits: Batch Normalization Without Gradient Explosion3 Oct 2023
- 2023Transferring Learning Trajectories of Neural Networks23 May 2023
12 newest of 31 All 31 (JSON)