$Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(ε^{-7/4})$ Complexity$

v1v2v3v4 (latest)

Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(ε^{-7/4})$ Complexity

27 January 2022

ArXiv (abs)PDF HTML Github (1★)

Papers citing "Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(ε^{-7/4})$ Complexity"

18 / 18 papers shown

Title
Provable Acceleration of Heavy Ball beyond Quadratics for a Class of Polyak-Łojasiewicz Functions when the Non-Convexity is Averaged-Out Jun-Kun Wang Chi-Heng Lin Andre Wibisono Bin Hu 82 22 0 22 Jun 2022
Heavy-ball Algorithms Always Escape Saddle Points Tao Sun Dongsheng Li Zhe Quan Hao Jiang Shengguo Li Y. Dou ODL 54 21 0 23 Jul 2019
Sharp Analysis for Nonconvex SGD Escaping from Saddle Points Cong Fang Zhouchen Lin Tong Zhang 83 104 0 01 Feb 2019
Tight Analyses for Non-Smooth Stochastic Gradient Descent Nicholas J. A. Harvey Christopher Liaw Y. Plan Sikander Randhawa 65 138 0 13 Dec 2018
Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent Chi Jin Praneeth Netrapalli Michael I. Jordan ODL 80 262 0 28 Nov 2017
Neon2: Finding Local Minima via First-Order Oracles Zeyuan Allen-Zhu Yuanzhi Li 93 131 0 17 Nov 2017
First-order Stochastic Algorithms for Escaping From Saddle Points in Almost Linear Time Yi Tian Xu Rong Jin Tianbao Yang ODL 85 116 0 03 Nov 2017
Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization Qunwei Li Yi Zhou Yingbin Liang P. Varshney 121 94 0 14 May 2017
On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation Max Simchowitz A. Alaoui Benjamin Recht 62 13 0 14 Apr 2017
How to Escape Saddle Points Efficiently Chi Jin Rong Ge Praneeth Netrapalli Sham Kakade Michael I. Jordan ODL 237 838 0 02 Mar 2017
Finding Approximate Local Minima Faster than Gradient Descent Naman Agarwal Zeyuan Allen-Zhu Brian Bullins Elad Hazan Tengyu Ma 124 83 0 03 Nov 2016
Non-convex Robust PCA Praneeth Netrapalli U. Niranjan Sujay Sanghavi Anima Anandkumar Prateek Jain 108 286 0 28 Oct 2014
Phase Retrieval via Wirtinger Flow: Theory and Algorithms Emmanuel Candes Xiaodong Li Mahdi Soltanolkotabi 199 1,291 0 03 Jul 2014
iPiano: Inertial Proximal Algorithm for Non-Convex Optimization Peter Ochs Yunjin Chen Thomas Brox Thomas Pock 81 434 0 18 Apr 2014
Understanding Alternating Minimization for Matrix Completion Moritz Hardt 98 259 0 03 Dec 2013
Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes Ohad Shamir Tong Zhang 162 576 0 08 Dec 2012
1-Bit Matrix Completion Mark A. Davenport Y. Plan E. Berg Mary Wootters 221 353 0 17 Sep 2012
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise S. Negahban Martin J. Wainwright 219 522 0 10 Sep 2010

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.