On Nonconvex Optimization for Machine Learning

DOI10.1145/3418526zbMath1499.68309arXiv1902.04811OpenAlexW3132024219MaRDI QIDQ5056442

Rong Ge, Praneeth Netrapalli, Sham M. Kakade, Chi Jin, Michael I. Jordan

Publication date: 8 December 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.04811

zbMATH Keywords

efficiencyperturbationssaddle points(stochastic) gradient descent

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05) Methods of reduced gradient type (90C52)

Related Items

Unnamed Item ⋮ Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization ⋮ Decentralized nonconvex optimization with guaranteed privacy and accuracy ⋮ On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization ⋮ Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness ⋮ Optimizing mean field spin glasses with external field ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Adaptive Hamiltonian Variational Integrators and Applications to Symplectic Accelerated Optimization

This page was built for publication: On Nonconvex Optimization for Machine Learning