Fetching the paper…
Reading the bibliography…
We consider the non-square matrix sensing problem, under restricted isometry property (RIP) assumptions.
Nonlinear iterative partial least squares (NIPALS) estimation procedures
H. Wold and E. Lyttkens · 1969
Earlier work this paper cites.
The one component model with incomplete data
A. Christoffersson · 1970
Earlier work this paper cites.
Numerical computation of principal components when several observations are missing
A. Ruhe · 1974
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R. Monteiro · 2003
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
S. Burer and R. Monteiro · 2005
Earlier work this paper cites.
The learnability of quantum states
S. Aaronson · 2007
Earlier work this paper cites.
The restricted isometry property and its implications for compressed sensing
E. Candes · 2008
Earlier work this paper cites.
Compressed sensing and robust recovery of low rank matrices
M. Fazel, E. Candes, B. Recht, and P. Parrilo · 2008
Earlier work this paper cites.
Sparse and low-rank matrix decompositions
V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky · 2009
Earlier work this paper cites.
Interior-point method for nuclear norm approximation with application to system identification
Z. Liu and L. Vandenberghe · 2009
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. Parrilo · 2010
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
E. Candes and Y. Plan · 2011
Earlier work this paper cites.
Robust principal component analysis?
E. Candes, X. Li, Y. Ma, and J. Wright · 2011
Earlier work this paper cites.
New and improved Johnson-Lindenstrauss embeddings via the restricted isometry property
F. Krahmer and R. Ward · 2011
Earlier work this paper cites.
Universal low-rank matrix recovery from Pauli measurements
Y.-K. Liu · 2011
Cited alongside, same era.
SpaRCS: Recovering low-rank and sparse matrices from compressive measurements
A. Waters, A. Sankaranarayanan, and R. Baraniuk · 2011
Cited alongside, same era.
Quantum tomography via compressed sensing: Error bounds, sample complexity and efficient estimators
S. Flammia, D. Gross, Y.-K. Liu, and J. Eisert · 2012
Cited alongside, same era.
Localization from incomplete noisy distance measurements
A. Javanmard and A. Montanari · 2013
Cited alongside, same era.
Global convergence of stochastic gradient descent for some non-convex matrix problems
C. De Sa, K. Olukotun, and C. Re · 2014
Cited alongside, same era.
Matrix recipes for hard thresholding methods
A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements
Q. Zheng and J. Lafferty · 2015
Later among the works it cites.
Efficient approaches for escaping higher order saddle points in non-convex optimization
A. Anandkumar and R. Ge · 2016
Closest in time.
A. Bandeira, N. Boumal, and V. Voroninski · 2016
Closest in time.
Global optimality of local search for low rank matrix recovery
S. Bhojanapalli, B. Neyshabur, and N. Srebro · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Kyrillidis and V. Cevher · 2014
Cited alongside, same era.
Dropping convexity for faster semi-definite optimization
S. Bhojanapalli, A. Kyrillidis, and S. Sanghavi · 2015
Cited alongside, same era.
Y. Chen and M. Wainwright · 2015
Cited alongside, same era.
Escaping from saddle points—online stochastic gradient for tensor decomposition
R. Ge, F. Huang, C. Jin, and Y. Yuan · 2015
Cited alongside, same era.
Computing matrix squareroot via non convex local search
P. Jain, C. Jin, S. Kakade, and P. Netrapalli · 2015
Cited alongside, same era.
Quantum tomography protocols with positivity are compressed sensing protocols
A. Kalev, R. Kosut, and I. Deutsch · 2015
Cited alongside, same era.
Complete dictionary recovery over the sphere I: Overview and the geometric picture
J. Sun, Q. Qu, and J. Wright · 2015
Cited alongside, same era.
N. Boumal · 2016
Closest in time.
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
N. Boumal, V. Voroninski, and A. Bandeira · 2016
Closest in time.
An overview of low-rank matrix recovery from incomplete observations
M. Davenport and J. Romberg · 2016
Closest in time.
Matrix completion has no spurious local minimum
R. Ge, J. Lee, and T. Ma · 2016
Closest in time.
Provable efficient online matrix completion via non-convex stochastic gradient descent
C. Jin, S. Kakade, and P. Netrapalli · 2016
Closest in time.
Gradient descent converges to minimizers
J. Lee, M. Simchowitz, M. Jordan, and B. Recht · 2016
Closest in time.
A geometric analysis of phase retrieval
J. Sun, Q. Qu, and J. Wright · 2016
Closest in time.
Low-rank solutions of linear matrix equations via Procrustes flow
S. Tu, R. Boczar, M. Soltanolkotabi, and B. Recht · 2016
Closest in time.
Fast algorithms for robust PCA via gradient descent
Xinyang Yi, Dohyung Park, Yudong Chen, and Constantine Caramanis · 2016
Closest in time.
Q. Zheng and J. Lafferty · 2016
Closest in time.