v1v2 (latest)

When Are Nonconvex Problems Not Scary?

21 October 2015

Ju Sun

Qing Qu

John N. Wright

ArXiv (abs)PDF HTML

Papers citing "When Are Nonconvex Problems Not Scary?"

37 / 37 papers shown

Title
Exponentially vanishing sub-optimal local minima in multilayer neural networks Daniel Soudry Elad Hoffer 149 97 0 19 Feb 2017
A Grothendieck-type inequality for local maxima Andrea Montanari 36 0 0 13 Mar 2016
A Geometric Analysis of Phase Retrieval Ju Sun Qing Qu John N. Wright 129 526 0 22 Feb 2016
Efficient approaches for escaping higher order saddle points in non-convex optimization Anima Anandkumar Rong Ge 32 143 0 18 Feb 2016
Gradient Descent Converges to Minimizers Jason D. Lee Max Simchowitz Michael I. Jordan Benjamin Recht 71 212 0 16 Feb 2016
Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations Anima Anandkumar Prateek Jain Yang Shi U. Niranjan 106 84 0 15 Oct 2015
Dropping Convexity for Faster Semi-definite Optimization Srinadh Bhojanapalli Anastasios Kyrillidis Sujay Sanghavi 80 173 0 14 Sep 2015
Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees Yudong Chen Martin J. Wainwright 205 318 0 10 Sep 2015
The local convexity of solving systems of quadratic equations Christopher D. White Sujay Sanghavi Rachel A. Ward 57 72 0 25 Jun 2015
A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements Qinqing Zheng John D. Lafferty 107 186 0 19 Jun 2015
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems Yuxin Chen Emmanuel J. Candes 111 590 0 19 May 2015
Complete Dictionary Recovery over the Sphere Ju Sun Qing Qu John N. Wright 57 202 0 26 Apr 2015
Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition Rong Ge Furong Huang Chi Jin Yang Yuan 140 1,059 0 06 Mar 2015
Simple, Efficient, and Neural Algorithms for Sparse Coding Sanjeev Arora Rong Ge Tengyu Ma Ankur Moitra 105 193 0 02 Mar 2015
Finding a sparse vector in a subspace: Linear sparsity using alternating directions Qing Qu Ju Sun John N. Wright 83 112 0 15 Dec 2014
Provable Tensor Methods for Learning Mixtures of Generalized Linear Models Hanie Sedghi Majid Janzamin Anima Anandkumar 102 15 0 09 Dec 2014
The Loss Surfaces of Multilayer Networks A. Choromańska Mikael Henaff Michaël Mathieu Gerard Ben Arous Yann LeCun ODL 261 1,200 0 30 Nov 2014
Guaranteed Matrix Completion via Non-convex Factorization Ruoyu Sun Zhi-Quan Luo 112 453 0 28 Nov 2014
Analyzing Tensor Power Method Dynamics in Overcomplete Regime Anima Anandkumar Rong Ge Majid Janzamin 103 27 0 06 Nov 2014
Fast Exact Matrix Completion with Finite Samples Prateek Jain Praneeth Netrapalli 92 92 0 04 Nov 2014
Non-convex Robust PCA Praneeth Netrapalli U. Niranjan Sujay Sanghavi Anima Anandkumar Prateek Jain 102 286 0 28 Oct 2014
Fast matrix completion without the condition number Moritz Hardt Mary Wootters 102 108 0 15 Jul 2014
Phase Retrieval via Wirtinger Flow: Theory and Algorithms Emmanuel Candes Xiaodong Li Mahdi Soltanolkotabi 199 1,288 0 03 Jul 2014
Provable Tensor Factorization with Missing Data Prateek Jain Sewoong Oh 181 196 0 11 Jun 2014
Identifying and attacking the saddle point problem in high-dimensional non-convex optimization Yann N. Dauphin Razvan Pascanu Çağlar Gülçehre Kyunghyun Cho Surya Ganguli Yoshua Bengio ODL 129 1,389 0 10 Jun 2014
On the saddle point problem for non-convex optimization Razvan Pascanu Yann N. Dauphin Surya Ganguli Yoshua Bengio ODL 62 105 0 19 May 2014
Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank- $1$ Updates Anima Anandkumar Rong Ge Majid Janzamin 127 132 0 21 Feb 2014
More Algorithms for Provable Dictionary Learning Sanjeev Arora Aditya Bhaskara Rong Ge Tengyu Ma 79 55 0 03 Jan 2014
Understanding Alternating Minimization for Matrix Completion Moritz Hardt 91 259 0 03 Dec 2013
Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization Alekh Agarwal Anima Anandkumar Prateek Jain Praneeth Netrapalli 132 173 0 30 Oct 2013
A Clustering Approach to Learn Sparsely-Used Overcomplete Dictionaries Alekh Agarwal Anima Anandkumar Praneeth Netrapalli 150 50 0 08 Sep 2013
New Algorithms for Learning Incoherent and Overcomplete Dictionaries Sanjeev Arora Rong Ge Ankur Moitra 77 206 0 28 Aug 2013
Manopt, a Matlab toolbox for optimization on manifolds Nicolas Boumal Bamdev Mishra P.-A. Absil R. Sepulchre 105 1,033 0 23 Aug 2013
Phase Retrieval using Alternating Minimization Praneeth Netrapalli Prateek Jain Sujay Sanghavi 221 633 0 02 Jun 2013
Low-rank Matrix Completion using Alternating Minimization Prateek Jain Praneeth Netrapalli Sujay Sanghavi 224 1,066 0 03 Dec 2012
Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders Sanjeev Arora Rong Ge Ankur Moitra Sushant Sachdeva 145 86 0 23 Jun 2012
Matrix Completion from a Few Entries Raghunandan H. Keshavan Andrea Montanari Sewoong Oh 429 1,246 0 20 Jan 2009