mlsanityData to 7 Oct 2026

First-order Methods Almost Always Avoid Saddle Points

arXiv 1710.07406 ↗First posted 20 Oct 2017stat.ML cs.LG math.OCcited by 14

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

Cited by year

Citing papers per year: 2021: 7; 2022: 3; 2023: 1; 2024: 2; 2025: 1.

14 papers.

Sort: