Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 1, 2019 | Submitted
Report Open

Efficient approaches for escaping higher order saddle points in non-convex optimization

Abstract

Local search heuristics for non-convex optimizations are popular in applied machine learning. However, in general it is hard to guarantee that such algorithms even converge to a local minimum, due to the existence of complicated saddle point structures in high dimensions. Many functions have degenerate saddle points such that the first and second order derivatives cannot distinguish them with local optima. In this paper we use higher order derivatives to escape these saddle points: we design the first efficient algorithm guaranteed to converge to a third order local optimum (while existing techniques are at most second order). We also show that it is NP-hard to extend this further to finding fourth order local optima.

Attached Files

Submitted - 1602.05908.pdf

Files

1602.05908.pdf
Files (509.3 kB)
Name Size Download all
md5:e30278d2fd6069d78c2f3d2de21ebb5d
509.3 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 20, 2023