Fetching the paper…
Reading the bibliography…
This paper considers general rank-constrained optimization problems that minimize a general objective function $f(X)$ over the set of rectangular $n\times m$ matrices that have rank at most $r$.
N. Higham and P. Papadimitriou, “Matrix procrustes problems,” Rapport technique, University of Manchester
1995
Earlier work this paper cites.
SIAM, 2000
A. R. Conn, N. I. Gould, and P. L. Toint, Trust region methods · 2000
Earlier work this paper cites.
S. Burer and R. D. Monteiro, “A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,” Mathematical Programming
2003
Earlier work this paper cites.
N. Srebro, J. Rennie, and T. S. Jaakkola, “Maximum-margin matrix factorization,” in Advances in Neural Information Processing Systems
2004
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. Boyd, “Rank minimization and applications in system theory,” in American Control Conference
2004
Earlier work this paper cites.
S. Burer and R. D. Monteiro, “Local minima and convergence in low-rank semidefinite programming,” Mathematical Programming
2005
Earlier work this paper cites.
E. J. Candès and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory
2005
Earlier work this paper cites.
S. Aaronson, “The learnability of quantum states,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences
2007
Earlier work this paper cites.
Z. Liu and L. Vandenberghe, “Interior-point method for nuclear norm approximation with application to system identification,” SIAM Journal on Matrix Analysis and Applications
2009
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics
2009
Earlier work this paper cites.
Princeton university press, 2009
D. S. Bernstein, Matrix mathematics · 2009
Earlier work this paper cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review
2010
Earlier work this paper cites.
J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization
2010
Earlier work this paper cites.
E. J. Candès and Y. Plan, “Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements,” IEEE Transactions on Information Theory
2011
Earlier work this paper cites.
Z. Harchaoui, M. Douze, M. Paulin, M. Dudik, and J. Malick, “Large-scale image classification with trace-norm regularization,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
2012
Earlier work this paper cites.
Cambridge University Press, 2012
R. A. Horn and C. R. Johnson, Matrix analysis · 2012
Earlier work this paper cites.
P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing
2013
Earlier work this paper cites.
T. Cai and W.-X. Zhou, “A max-norm constrained minimization approach to 1-bit matrix completion.,” Journal of Machine Learning Research
2013
Earlier work this paper cites.
A. Agarwal, A. Anandkumar, P. Jain, P. Netrapalli, and R. Tandon, “Learning sparsely used overcomplete dictionaries.,” in Conference on Learning Theory (COLT)
2014
Cited alongside, same era.
M. A. Davenport, Y. Plan, E. van den Berg, and M. Wootters, “1-bit matrix completion,” Information and Inference
2014
Cited alongside, same era.
J. Salmon, Z. Harmany, C.-A. Deledalle, and R. Willett, “Poisson noise reduction with non-local PCA,” Journal of Mathematical Imaging and Vision
2014
Cited alongside, same era.
R. Ge, F. Huang, C. Jin, and Y. Yuan, “Escaping from saddle points—online stochastic gradient for tensor decomposition,” in Proceedings of The 28th Conference on Learning Theory
2015
Cited alongside, same era.
S. Bhojanapalli, A. Kyrillidis, and S. Sanghavi, “Dropping convexity for faster semi-definite optimization,” in Conference on Learning Theory
2016
Later among the works it cites.
Courier Dover Publications, 2016
G. S. Chirikjian and A. B. Kyatkin, Harmonic Analysis for Engineers and Applied Scientists: Updated and Expanded Edition · 2016
Later among the works it cites.
M. Udell, C. Horn, R. Zadeh, and S. Boyd, “Generalized low rank models,” Foundations and Trends® in Machine Learning
2016
Later among the works it cites.
D. Park, A. Kyrillidis, C. Carmanis, and S. Sanghavi, “Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach,” in Artificial Intelligence and Statistics
2017
Closest in time.
I. Panageas and G. Piliouras, “Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions,” in 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
E. J. Candès, X. Li, and M. Soltanolkotabi, “Phase retrieval via Wirtinger flow: Theory and algorithms,” IEEE Transactions on Information Theory
2015
Cited alongside, same era.
Y. Chen and E. Candès, “Solving random quadratic systems of equations is nearly as easy as solving linear systems,” in Advances in Neural Information Processing Systems
2015
Cited alongside, same era.
T. Zhao, Z. Wang, and H. Liu, “A nonconvex optimization framework for low rank matrix estimation,” in Advances in Neural Information Processing Systems
2015
Cited alongside, same era.
L. Xu and M. Davenport, “Dynamic matrix recovery from incomplete observations under an exact low-rank constraint,” in Advances in Neural Information Processing Systems
2016
Cited alongside, same era.
M. A. Davenport and J. Romberg, “An overview of low-rank matrix recovery from incomplete observations,” IEEE Journal of Selected Topics in Signal Processing
2016
Cited alongside, same era.
S. Bhojanapalli, B. Neyshabur, and N. Srebro, “Global optimality of local search for low rank matrix recovery,” pp. 3873–3881, 2016
2016
Cited alongside, same era.
R. Ge, J. D. Lee, and T. Ma, “Matrix completion has no spurious local minimum,” in Advances in Neural Information Processing Systems
2016
Cited alongside, same era.
2017
Closest in time.
C. Jin, M. Jordan, R. Ge, P. Netrapalli, and S. Kakade, “How to escape saddle points efficiently,” in International Conference on Machine Learning
2017
Closest in time.
H. Liu, M.-C. Yue, and A. Man-Cho So, “On the estimation performance and convergence rate of the generalized power method for phase synchronization,” SIAM Journal on Optimization
2017
Closest in time.
L. Wang, X. Zhang, and Q. Gu, “A unified computational and statistical framework for nonconvex low-rank matrix estimation,” in Artificial Intelligence and Statistics
2017
Closest in time.
R. Ge, C. Jin, and Y. Zheng, “No spurious local minima in nonconvex low rank problems: a unified geometric analysis,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70
2017
Closest in time.
J. Sun, Q. Qu, and J. Wright, “A geometric analysis of phase retrieval,” Foundations of Computational Mathematics
2018
Closest in time.
K. Lee, N. Tian, and J. Romberg, “Fast and guaranteed blind multichannel deconvolution under a bilinear system model,” IEEE Transactions on Information Theory
2018
Closest in time.
Q. Li, Z. Zhu, and G. Tang, “The non-convex geometry of low-rank matrix optimization,” Information and Inference: A Journal of the IMA
2018
Closest in time.
Z. Zhu, Q. Li, G. Tang, and M. B. Wakin, “Global optimality in low-rank matrix optimization,” IEEE Transactions on Signal Processing
2018
Closest in time.
Q. Li, Z. Zhu, and G. Tang, “Alternating minimizations converge to second-order optimal solutions,” in International Conference on Machine Learning
2019
Closest in time.
X. Li, S. Ling, T. Strohmer, and K. Wei, “Rapid, robust, and reliable blind deconvolution via nonconvex optimization,” Applied and computational harmonic analysis
2019
Closest in time.
X. Li, J. Lu, R. Arora, J. Haupt, H. Liu, Z. Wang, and T. Zhao, “Symmetry, saddle points, and global optimization landscape of nonconvex matrix factorization,” IEEE Transactions on Information Theory
2019
Closest in time.
Z. Zhu, Q. Li, X. Yang, G. Tang, and M. B. Wakin, “Distributed low-rank matrix factorization with exact consensus,” in Advances in Neural Information Processing Systems
2019
Closest in time.