Fetching the paper…
Reading the bibliography…
Low-rank matrix recovery is a fundamental problem in signal processing and machine learning.
J. J. Moré and D. C. Sorensen, “Computing a trust region step,” SIAM Journal on Scientific and Statistical Computing
1983
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.
2003
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.
Y. Nesterov and B. T. Polyak, “Cubic regularization of Newton method and its global performance,” Mathematical Programming
2006
Earlier work this paper cites.
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
Earlier work this paper cites.
S. Tu, R. Boczar, M. Simchowitz, M. Soltanolkotabi, and B. Recht, “Low-rank solutions of linear matrix equations via Procrustes Flow,” in Proceedings of the 33rd International Conference on International Conference on Machine Learning-Volume 48
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
J. Sun, Q. Qu, and J. Wright, “Complete dictionary recovery over the sphere II: Recovery by Riemannian trust-region method,” IEEE Transactions on Information Theory
2016
Earlier work this paper cites.
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht, “Gradient descent only converges to minimizers,” in Proceedings of 29th Annual Conference on Learning Theory
2016
Earlier work this paper cites.
K. Kawaguchi, “Deep learning without poor local minima,” in Advances in Neural Information Processing Systems
2016
Cited alongside, same era.
Q. Li, Z. Zhu, and G. Tang, “Geometry of factored nuclear norm regularization,” arxiv:1704.01265
2017
Cited alongside, same era.
2017
Cited alongside, same era.
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
Cited alongside, same era.
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
Y. Chi, Y. M. Lu, and Y. Chen, “Nonconvex optimization meets low-rank matrix factorization: An overview,” IEEE Transactions on Signal Processing
2019
Later among the works it cites.
Q. Li, Z. Zhu, and G. Tang, “The non-convex geometry of low-rank matrix optimization,” Information and Inference: A Journal of the IMA
2019
Later among the works it cites.
S. Li, G. Tang, and M. B. Wakin, “The landscape of non-convex empirical risk with degenerate population risk,” in Advances in Neural Information Processing Systems
2019
Later among the works it cites.
Q. Li, Z. Zhu, and G. Tang, “Alternating minimizations converge to second-order optimal solutions,” in International Conference on Machine Learning
2019
Later among the works it cites.
S. Lu, M. Hong, and Z. Wang, “ PA-GD
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
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
Cited alongside, same era.
C. Jin, R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan, “How to escape saddle points efficiently,” in Proceedings of the 34th International Conference on Machine Learning
2017
Cited alongside, same era.
Z. Zhu, Q. Li, G. Tang, and M. B. Wakin, “Global optimality in low-rank matrix optimization,” IEEE Transactions on Signal Processing
2018
Cited alongside, same era.
S. S. Du, W. Hu, and J. D. Lee, “Algorithmic regularization in learning deep homogeneous models: Layers are automatically balanced,” in Advances in Neural Information Processing Systems
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Q. Li, Z. Zhu, G. Tang, and M. B. Wakin, “Provable Bregman-divergence based methods for nonconvex and non-Lipschitz problems,” Submitted to SIAM Journal on Optimization
Cited in the paper.
C. Ma, Y. Li, and Y. Chi, “Beyond Procrustes: Balancing-free gradient descent for asymmetric low-rank matrix sensing,” in 2019 53rd Asilomar Conference on Signals, Systems, and Computers
2019
Later among the works it cites.
S. Arora, N. Cohen, W. Hu, and Y. Luo, “Implicit regularization in deep matrix factorization,” in Advances in Neural Information Processing Systems 32
2019
Later among the works it cites.
C. Ma, K. Wang, Y. Chi, and Y. Chen, “Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution,” Foundations of Computational Mathematics
2019
Later among the works it cites.
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
Later among the works it cites.
Z. Zhu, D. Soudry, Y. C. Eldar, and M. B. Wakin, “The global optimization geometry of shallow linear neural networks,” Journal of Mathematical Imaging and Vision
2020
Closest in time.