AI RESEARCH
Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima
arXiv CS.LG
•
ArXi:2307.07030v3 Announce Type: replace-cross This paper considers the problem of understanding the behavior of a general class of accelerated gradient methods on smooth nonconvex functions.