[17] H. Zhang, Y. Bi, and J. Lavaei, "General low-rank matrix optimization: Geometric analysis and sharper bounds," Advances in Neural Information Processing Systems, vol. 34, pp. 27369-27380, 2021.
[18] R. Y. Zhang, "Sharp global guarantees for nonconvex low-rank matrix recovery in the overparameterized regime," arXiv preprint arXiv:2104.10790, 2021.
[19] R. Y. Zhang, "Improved global guarantees for the nonconvex burer-monteiro factorization via rank overparameterization," arXiv preprint arXiv:2207.01789, 2022.
[20] B. Yalcin, Z. Ma, J. Lavaei, and S. Sojoudi, "Semidefinite programming versus burer-monteiro factorization for matrix sensing," in Proceedings of the AAAI Conference on Artificial Intelligence, 2023.
[21] Z. Ma, I. Molybog, J. Lavaei, and S. Sojoudi, “Over-parametrization via lifting for low-rank matrix sensing: Conversion of spurious solutions to strict saddle points,” in International Conference on Machine Learning, PMLR, 2023.
[22] J. B. Lasserre, “Global optimization with polynomials and the problem of moments,” SIAM Journal on optimization, vol. 11, no. 3, pp. 796–817, 2001.
[23] E. Kofidis and P. A. Regalia, "On the best rank-1 approximation of higher-order supersymmetric tensors," SIAM Journal on Matrix Analysis and Applications, vol. 23, no. 3, pp. 863–884, 2002.
[24] L. Wu, X. Liu, and Z. Wen, "Symmetric rank-1 approximation of symmetric high-order tensors," Optimization Methods and Software, vol. 35, no. 2, pp. 416-438, 2020.
[25] E. Levin, J. Kileel, and N. Boumal, "The effect of smooth parametrizations on nonconvex optimization landscapes," arXiv preprint arXiv:2207.03512, 2022.
[26] P. Li, X. Liang, and H. Song, "A survey on implicit bias of gradient descent," in 2022 14th International Conference on Computer Research and Development (ICCRD), pp. 108-114, IEEE, 2022.
[27] D. Stöger and M. Soltanolkotabi, “Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction,” Advances in Neural Information Processing Systems, vol. 34, pp. 23831–23843, 2021.
[28] J. Jin, Z. Li, K. Lyu, S. S. Du, and J. D. Lee, "Understanding incremental learning of gradient descent: A fine-grained analysis of matrix sensing," arXiv preprint arXiv:2301.11500, 2023.
[29] J. Ma and S. Fattahi, “Global convergence of sub-gradient method for robust matrix recovery: Small initialization, noisy measurements, and over-parameterization,” arXiv preprint arXiv:2202.08788, 2022.
[30] Z. Ma, Y. Bi, J. Lavaei, and S. Sojoudi, "Geometric analysis of noisy low-rank matrix recovery in the exact parametrized and the overparametrized regimes," INFORMS Journal on Optimization, 2023.
[31] B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization," SIAM Review, vol. 52, no. 3, pp. 471-501, 2010.
[32] T. T. Cai and A. Zhang, "Sharp rip bound for sparse signal and low-rank matrix recovery," Applied and Computational Harmonic Analysis, vol. 35, no. 1, pp. 74-93, 2013.
[33] J. Zhuo, J. Kwon, N. Ho, and C. Caramanis, "On the computational and statistical complexity of over-parameterized matrix sensing," arXiv preprint arXiv:2102.02756, 2021.
[34] N. Razin, A. Maman, and N. Cohen, "Implicit regularization in tensor factorization," in International Conference on Machine Learning, pp. 8913-8924, PMLR, 2021.
[35] N. Razin, A. Maman, and N. Cohen, "Implicit regularization in hierarchical tensor factorization and deep convolutional neural networks," in International Conference on Machine Learning, pp. 18422-18462, PMLR, 2022.