No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis

3 April 2017

Papers citing "No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis"

20 / 220 papers shown

Title
Matrix Completion with Nonconvex Regularization: Spectral Operators and Scalable Algorithms Rahul Mazumder Diego Saldana Haolei Weng 18 13 0 24 Jan 2018
Algorithmic Regularization in Over-parameterized Matrix Sensing and Neural Networks with Quadratic Activations Yuanzhi Li Tengyu Ma Hongyang R. Zhang 10 31 0 26 Dec 2017
Fast Low-Rank Matrix Estimation without the Condition Number Mohammadreza Soltani C. Hegde 13 10 0 08 Dec 2017
Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minima S. Du J. Lee Yuandong Tian Barnabás Póczós Aarti Singh MLT 24 234 0 03 Dec 2017
Convolutional Phase Retrieval via Gradient Descent Qing Qu Yuqian Zhang Yonina C. Eldar John N. Wright 22 29 0 03 Dec 2017
Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent Chi Jin Praneeth Netrapalli Michael I. Jordan ODL 16 260 0 28 Nov 2017
Stochastic Cubic Regularization for Fast Nonconvex Optimization Nilesh Tripuraneni Mitchell Stern Chi Jin Jeffrey Regier Michael I. Jordan 16 172 0 08 Nov 2017
Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA Ji Chen Xiaodong Li 35 27 0 06 Nov 2017
Learning One-hidden-layer Neural Networks with Landscape Design Rong Ge J. Lee Tengyu Ma MLT 21 260 0 01 Nov 2017
Smooth Sensitivity Based Approach for Differentially Private Principal Component Analysis Ran Gilad-Bachrach Alon Gonen 20 10 0 29 Oct 2017
First-order Methods Almost Always Avoid Saddle Points J. Lee Ioannis Panageas Georgios Piliouras Max Simchowitz Michael I. Jordan Benjamin Recht ODL 80 82 0 20 Oct 2017
Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization Paris V. Giampouras A. Rontogiannis K. Koutroumbas 19 4 0 05 Oct 2017
On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization Mingrui Liu Tianbao Yang 14 23 0 25 Sep 2017
Sparse Coding and Autoencoders Akshay Rangamani Anirbit Mukherjee A. Basu T. Ganapathi Ashish Arora S. Chin T. Tran 33 19 0 12 Aug 2017
Deep Learning is Robust to Massive Label Noise David Rolnick Andreas Veit Serge J. Belongie Nir Shavit NoLa 14 547 0 30 May 2017
Gradient Descent Can Take Exponential Time to Escape Saddle Points S. Du Chi Jin J. Lee Michael I. Jordan Barnabás Póczós Aarti Singh 16 245 0 29 May 2017
Matrix Completion and Related Problems via Strong Duality Maria-Florina Balcan Yingyu Liang David P. Woodruff Hongyang R. Zhang 11 8 0 27 Apr 2017
Geometry of Factored Nuclear Norm Regularization Qiuwei Li Zhihui Zhu Gongguo Tang 11 24 0 05 Apr 2017
Phase retrieval with random Gaussian sensing vectors by alternating projections Irène Waldspurger 11 96 0 10 Sep 2016
Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity Quanming Yao James T. Kwok 11 52 0 13 Jun 2016