Perturbed Proximal Descent to Escape Saddle Points for Non-convex and Non-smooth Objective Functions
arXiv:1901.08958 · doi:10.1007/978-3-030-16841-4_7
Abstract
We consider the problem of finding local minimizers in non-convex and non-smooth optimization. Under the assumption of strict saddle points, positive results have been derived for first-order methods. We present the first known results for the non-smooth case, which requires different analysis and a different algorithm.
arXiv admin note: text overlap with arXiv:1703.00887 by other authors