Fetching the paper…
Reading the bibliography…
This work studies low-rank approximation of a positive semidefinite matrix from partial entries via nonconvex optimization.
Minimization of functions having Lipschitz continuous first partial derivatives
Larry Armijo · 1966
Earlier work this paper cites.
Neural networks and principal component analysis: Learning from examples without local minima
Pierre Baldi and Kurt Hornik · 1989
Earlier work this paper cites.
Nonlinear component analysis as a kernel eigenvalue problem
Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller · 1998
Earlier work this paper cites.
Using the nyström method to speed up kernel machines
Christopher KI Williams and Matthias Seeger · 2001
Earlier work this paper cites.
Sampling techniques for kernel methods
Dimitris Achlioptas, Frank McSherry, and Bernhard Schölkopf · 2002
Earlier work this paper cites.
Kernel matrix completion by semidefinite programming
Thore Graepel · 2002
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Samuel Burer and Renato DC Monteiro · 2003
Earlier work this paper cites.
Iterative methods for sparse linear systems , volume 82
Yousef Saad · 2003
Earlier work this paper cites.
On the Nyström method for approximating a gram matrix for improved kernel-based learning
Petros Drineas and Michael W Mahoney · 2005
Earlier work this paper cites.
Iterative kernel principal component analysis for image modeling
Kwang In Kim, Matthias O Franz, and Bernhard Schölkopf · 2005
Earlier work this paper cites.
Fast maximum margin matrix factorization for collaborative prediction
Jasson DM Rennie and Nathan Srebro · 2005
Earlier work this paper cites.
Fast computation of low-rank matrix approximations
Dimitris Achlioptas and Frank McSherry · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Earlier work this paper cites.
Note on sampling without replacing from a finite collection of matrices
David Gross and Vincent Nesme · 2010
Earlier work this paper cites.
A nonparametric bayesian model for kernel matrix completion
John Paisley and Lawrence Carin · 2010
Earlier work this paper cites.
Recovering low-rank matrices from few coefficients in any basis
David Gross · 2011
Earlier work this paper cites.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp · 2011
Earlier work this paper cites.
Inequalities: theory of majorization and its applications
Albert W Marshall, Ingram Olkin, and Barry C Arnold · 2011
Earlier work this paper cites.
A simpler approach to matrix completion
Benjamin Recht · 2011
Cited alongside, same era.
Matrix Computations , volume 3
Gene H Golub and Charles F Van Loan · 2012
Cited alongside, same era.
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Sahand Negahban and Martin J Wainwright · 2012
Cited alongside, same era.
Kernel principal component analysis and its applications in face recognition and active shape models
Quan Wang · 2012
Cited alongside, same era.
Matrix Analysis
Rajendra Bhatia · 2013
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi · 2013
Cited alongside, same era.
Optimal rates of convergence for noisy sparse phase retrieval via thresholded wirtinger flow
T Tony Cai, Xiaodong Li, Zongming Ma, et al · 2016
Later among the works it cites.
Matrix completion has no spurious local minimum
Rong Ge, Jason D Lee, and Tengyu Ma · 2016
Later among the works it cites.
Gradient descent only converges to minimizers
Jason D Lee, Max Simchowitz, Michael I Jordan, and Benjamin Recht · 2016
Later among the works it cites.
Guaranteed matrix completion via non-convex factorization
Ruoyu Sun and Zhi-Quan Luo · 2016
Later among the works it cites.
Fast algorithms for robust PCA via gradient descent
Xinyang Yi, Dohyung Park, Yudong Chen, and Constantine Caramanis · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Universal matrix completion
Srinadh Bhojanapalli and Prateek Jain · 2014
Cited alongside, same era.
Phase retrieval via wirtinger flow: Theory and algorithms
Emmanuel J Candes, Xiaodong Li, and Mahdi Soltanolkotabi · 2015
Cited alongside, same era.
Matrix estimation by universal singular value thresholding
Sourav Chatterjee · 2015
Cited alongside, same era.
Yudong Chen and Martin J Wainwright · 2015
Cited alongside, same era.
Escaping from saddle points–online stochastic gradient for tensor decomposition
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan · 2015
Cited alongside, same era.
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
Po-Ling Loh and Martin J. Wainwright · 2015
Cited alongside, same era.
Qinqing Zheng and John Lafferty · 2016
Later among the works it cites.
Maria-Florina Balcan, Yingyu Liang, David P Woodruff, and Hongyang Zhang · 2017
Closest in time.
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
Rong Ge, Chi Jin, and Yi Zheng · 2017
Closest in time.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Closest in time.
First-order methods almost always avoid saddle points
Jason D. Lee, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I. Jordan, and Benjamin Recht · 2017
Closest in time.
Geometry of factored nuclear norm regularization
Qiuwei Li, Zhihui Zhu, and Gongguo Tang · 2017
Closest in time.
Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions
Ioannis Panageas and Georgios Piliouras · 2017
Closest in time.
The global optimization geometry of nonsymmetric matrix factorization and sensing
Zhihui Zhu, Qiuwei Li, Gongguo Tang, and Michael B Wakin · 2017
Closest in time.
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
Xiaodong Li, Shuyang Ling, Thomas Strohmer, and Ke Wei · 2018
Closest in time.
A geometric analysis of phase retrieval
Ju Sun, Qing Qu, and John Wright · 2018
Closest in time.
A Simple SVD Algorithm for Finding Hidden Partitions
Van Vu · 2018
Closest in time.
Matrix completion from noisy entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2078
Closest in time.