Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions
Ioannis Panageas, Georgios Piliouras
TL;DR
The paper addresses the threat of saddle points in non-convex optimization by showing that gradient descent converges to saddles only on a measure-zero set of initial conditions, even when critical points are non-isolated. It extends previous results by removing strict isolation requirements and, in forward-invariant domains, relaxing global Lipschitz assumptions while providing an explicit step-size bound. The authors combine diffeomorphism properties of the gradient map with center-stable manifold theory and measure-theoretic arguments, and illustrate the results with examples highlighting non-isolated points, forward-invariant regions, and step-size effects. The findings strengthen the understanding of gradient-descent robustness and offer practical guidance for step-size selection and domain choices in non-convex settings.
Abstract
Given a non-convex twice differentiable cost function f, we prove that the set of initial conditions so that gradient descent converges to saddle points where \nabla^2 f has at least one strictly negative eigenvalue has (Lebesgue) measure zero, even for cost functions f with non-isolated critical points, answering an open question in [Lee, Simchowitz, Jordan, Recht, COLT2016]. Moreover, this result extends to forward-invariant convex subspaces, allowing for weak (non-globally Lipschitz) smoothness assumptions. Finally, we produce an upper bound on the allowable step-size.
