arXiv (Cornell University) · 2016 · 43 citations · 17 references
Natural SciencesMathematicsCost-minimization AnalysisDynamical SystemsOptimizationConvex AnalysisConvex OptimizationCost MinimizationEigenvalue ProblemsGradient-based OptimizationOptimization TheoryCritical PointsExistence Of MinimizersGradient DescentInvariant SubspacesNonsmooth Convex OptimizationSaddle Point OptimizationSaddle Point ProblemsSmooth Optimization
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.
17
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
D Seung, Lin-Wen Lee · 2001 · 4.8K citations
The Loss Surfaces of Multilayer Networks
Anna Choromanska, Mikael Henaff, Michaël Mathieu et al. · arXiv (Cornell University) · 2014 · 720 citations · Full text
Matrix completion from a few entries
Raghunandan H. Keshavan, Sewoong Oh, Andrea Montanari · 2009 · 662 citations