First-order Methods Almost Always Avoid Saddle Points
Not on the map. Why?
Abstract (arXiv)
We establish that first-order methods avoid saddle points for almost all initializations. Our results apply to a wide variety of first-order methods, including gradient descent, block coordinate descent, mirror descent and variants thereof. The connecting thread is that such algorithms can be studied from a dynamical systems perspective in which appropriate instantiations of the Stable Manifold Theorem allow for a global stability analysis. Thus, neither access to second-order derivative information nor randomness beyond initialization is necessary to provably avoid saddle points.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 7; 2022: 3; 2023: 1; 2024: 2; 2025: 1.
14 papers.
Sort:
- 2021DC3: A learning method for optimization with hard constraintscited by 181
- 2022Understanding Gradient Descent on Edge of Stability in Deep Learningcited by 126
- 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Frameworkcited by 106
- 2022Understanding the Generalization Benefit of Normalization Layers: Sharpness Reductioncited by 86
- 2021Safe Reinforcement Learning Using Advantage-Based Interventioncited by 45
- 2024Transformers Learn Nonlinear Features In Context: Nonconvex Mean-field Dynamics on the Attention Landscapecited by 43
- 2021Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimizationcited by 31
- 2022Stochastic noise can be helpful for variational quantum algorithmscited by 16
- 2021Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascentcited by 8
- 2024Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embeddingcited by 6
- 2023A Critical Review of Physics-Informed Machine Learning Applications in Subsurface Energy Systemscited by 4
- 2021Training Generative Adversarial Networks with Adaptive Composite Gradientcited by 1
- 2025Uncovering Critical Sets of Deep Neural Networks via Sample-Independent Critical Lifting19 May 2025
- 2024Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embedding8 Feb 2024
- 2024Transformers Learn Nonlinear Features In Context: Nonconvex Mean-field Dynamics on the Attention Landscape2 Feb 2024
- 2023A Critical Review of Physics-Informed Machine Learning Applications in Subsurface Energy Systems6 Aug 2023
- 2022Stochastic noise can be helpful for variational quantum algorithms13 Oct 2022
- 2022Understanding the Generalization Benefit of Normalization Layers: Sharpness Reduction14 Jun 2022
- 2022Understanding Gradient Descent on Edge of Stability in Deep Learning19 May 2022
- 2021Training Generative Adversarial Networks with Adaptive Composite Gradient10 Nov 2021
- 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Framework13 Oct 2021
- 2021Constants of Motion: The Antidote to Chaos in Optimization and Game Dynamics8 Sep 2021
- 2021Safe Reinforcement Learning Using Advantage-Based Intervention16 Jun 2021
- 2021DC3: A learning method for optimization with hard constraints25 Apr 2021
- 2021DC3: A learning method for optimization with hard constraintscited by 181
- 2022Understanding Gradient Descent on Edge of Stability in Deep Learningcited by 126
- 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Frameworkcited by 106
- 2022Understanding the Generalization Benefit of Normalization Layers: Sharpness Reductioncited by 86
- 2021Safe Reinforcement Learning Using Advantage-Based Interventioncited by 45
- 2024Transformers Learn Nonlinear Features In Context: Nonconvex Mean-field Dynamics on the Attention Landscapecited by 43
- 2021Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimizationcited by 31
- 2022Stochastic noise can be helpful for variational quantum algorithmscited by 16
- 2021Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascentcited by 8
- 2024Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embeddingcited by 6
- 2023A Critical Review of Physics-Informed Machine Learning Applications in Subsurface Energy Systemscited by 4
- 2021Training Generative Adversarial Networks with Adaptive Composite Gradientcited by 1
12 most cited of 14 All 14 (JSON)
- 2025Uncovering Critical Sets of Deep Neural Networks via Sample-Independent Critical Lifting19 May 2025
- 2024Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embedding8 Feb 2024
- 2024Transformers Learn Nonlinear Features In Context: Nonconvex Mean-field Dynamics on the Attention Landscape2 Feb 2024
- 2023A Critical Review of Physics-Informed Machine Learning Applications in Subsurface Energy Systems6 Aug 2023
- 2022Stochastic noise can be helpful for variational quantum algorithms13 Oct 2022
- 2022Understanding the Generalization Benefit of Normalization Layers: Sharpness Reduction14 Jun 2022
- 2022Understanding Gradient Descent on Edge of Stability in Deep Learning19 May 2022
- 2021Training Generative Adversarial Networks with Adaptive Composite Gradient10 Nov 2021
- 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Framework13 Oct 2021
- 2021Constants of Motion: The Antidote to Chaos in Optimization and Game Dynamics8 Sep 2021
- 2021Safe Reinforcement Learning Using Advantage-Based Intervention16 Jun 2021
- 2021DC3: A learning method for optimization with hard constraints25 Apr 2021
12 newest of 14 All 14 (JSON)