{"list":"other","total":54,"rows":[{"id":"1703.00887","title":"How to Escape Saddle Points Efficiently","created":"2017-03-02","cited_by_count":285},{"id":"1503.02101","title":"Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition","created":"2015-03-06","cited_by_count":243},{"id":"1806.00900","title":"Algorithmic Regularization in Learning Deep Homogeneous Models: Layers are Automatically Balanced","created":"2018-06-04","cited_by_count":177},{"id":"1809.09573","title":"Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview","created":"2018-09-25","cited_by_count":160},{"id":"1704.00708","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","created":"2017-04-03","cited_by_count":129},{"id":"1407.1065","title":"Phase Retrieval via Wirtinger Flow: Theory and Algorithms","created":"2014-07-03","cited_by_count":125},{"id":"1507.03566","title":"Low-rank Solutions of Linear Matrix Equations via Procrustes Flow","created":"2015-07-13","cited_by_count":97},{"id":"1602.06664","title":"A Geometric Analysis of Phase Retrieval","created":"2016-02-22","cited_by_count":92},{"id":"1605.07221","title":"Global Optimality of Local Search for Low Rank Matrix Recovery","created":"2016-05-23","cited_by_count":82},{"id":"2005.08898","title":"Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent","created":"2020-05-18","cited_by_count":71},{"id":"1509.03025","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","created":"2015-09-10","cited_by_count":70},{"id":"1711.10467","title":"Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution","created":"2017-11-28","cited_by_count":63},{"id":"1605.08101","title":"Global rates of convergence for nonconvex optimization on manifolds","created":"2016-05-25","cited_by_count":62},{"id":"1306.0160","title":"Phase Retrieval using Alternating Minimization","created":"2013-06-02","cited_by_count":58},{"id":"1505.05114","title":"Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems","created":"2015-05-19","cited_by_count":50},{"id":"2106.14289","title":"Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization","created":"2021-06-27","cited_by_count":45},{"id":"1509.03917","title":"Dropping Convexity for Faster Semi-definite Optimization","created":"2015-09-14","cited_by_count":40},{"id":"1609.03240","title":"Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach","created":"2016-09-12","cited_by_count":38},{"id":"1702.07945","title":"Global Optimality in Low-rank Matrix Optimization","created":"2017-02-25","cited_by_count":36},{"id":"1906.05450","title":"A Brief Introduction to Manifold Optimization","created":"2019-06-13","cited_by_count":35},{"id":"1506.06081","title":"A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements","created":"2015-06-19","cited_by_count":34},{"id":"1906.07355","title":"Escaping from saddle points on Riemannian manifolds","created":"2019-06-18","cited_by_count":33},{"id":"1312.0925","title":"Understanding Alternating Minimization for Matrix Completion","created":"2013-12-03","cited_by_count":32},{"id":"1904.10020","title":"Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence","created":"2019-04-22","cited_by_count":31},{"id":"1605.08285","title":"Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow","created":"2016-05-26","cited_by_count":29},{"id":"2007.06753","title":"From Symmetry to Geometry: Tractable Nonconvex Problems","created":"2020-07-14","cited_by_count":29},{"id":"2010.13364","title":"Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number","created":"2020-10-26","cited_by_count":28},{"id":"1901.01631","title":"Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery","created":"2019-01-07","cited_by_count":27},{"id":"1703.01256","title":"The Global Optimization Geometry of Low-Rank Matrix Optimization","created":"2017-03-03","cited_by_count":25},{"id":"1906.04321","title":"Efficiently escaping saddle points on manifolds","created":"2019-06-10","cited_by_count":24},{"id":"1606.03168","title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","created":"2016-06-10","cited_by_count":22},{"id":"1610.05275","title":"A Unified Computational and Statistical Framework for Nonconvex Low-Rank Matrix Estimation","created":"2016-10-17","cited_by_count":21},{"id":"1310.0807","title":"Exact and Stable Covariance Estimation from Quadratic Sampling via Convex Programming","created":"2013-10-02","cited_by_count":20},{"id":"1405.6055","title":"Riemannian preconditioning","created":"2014-05-23","cited_by_count":19},{"id":"1804.02008","title":"Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs","created":"2018-04-05","cited_by_count":19},{"id":"1310.5791","title":"ROP: Matrix recovery via rank-one projections","created":"2013-10-22","cited_by_count":18},{"id":"1706.03896","title":"A Well-Tempered Landscape for Non-convex Robust Subspace Recovery","created":"2017-06-13","cited_by_count":18},{"id":"1708.00257","title":"Robust PCA by Manifold Optimization","created":"2017-08-01","cited_by_count":13},{"id":"1707.08028","title":"A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points","created":"2017-07-25","cited_by_count":12},{"id":"1711.01742","title":"Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA","created":"2017-11-06","cited_by_count":12},{"id":"2104.10356","title":"General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds","created":"2021-04-21","cited_by_count":12},{"id":"2011.08360","title":"Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence","created":"2020-11-17","cited_by_count":11},{"id":"1803.00186","title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form","created":"2018-03-01","cited_by_count":10},{"id":"2002.01849","title":"Rank $2r$ iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries","created":"2020-02-05","cited_by_count":10},{"id":"2012.15467","title":"Fast Global Convergence for Low-rank Matrix Recovery via Riemannian Gradient Descent with Random Initialization","created":"2020-12-31","cited_by_count":9},{"id":"2003.10981","title":"The Global Geometry of Centralized and Distributed Low-rank Matrix Recovery without Regularization","created":"2020-03-24","cited_by_count":7},{"id":"1506.07868","title":"The local convexity of solving systems of quadratic equations","created":"2015-06-25","cited_by_count":6},{"id":"1611.03060","title":"The Non-convex Geometry of Low-rank Matrix Optimization","created":"2016-11-09","cited_by_count":6},{"id":"2103.14768","title":"A Riemannian rank-adaptive method for low-rank matrix completion","created":"2021-03-26","cited_by_count":4},{"id":"2102.00937","title":"Riemannian Perspective on Matrix Factorization","created":"2021-02-01","cited_by_count":3},{"id":"2006.07925","title":"A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees","created":"2020-06-14","cited_by_count":2},{"id":"2010.12191","title":"Escape saddle points faster on manifolds via perturbed Riemannian stochastic recursive gradient","created":"2020-10-23","cited_by_count":2},{"id":"1703.03898","title":"A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery","created":"2017-03-11","cited_by_count":1},{"id":"2103.15411","title":"An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs","created":"2021-03-29","cited_by_count":1}],"next_cursor":null}