Global optimality in low-rank matrix optimization

2017 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2017 - Proceedings

Volumn 2018-January, Issue , 2018, Pages 1275-1279

  Zhu, Zhihui ^a   Li, Qiuwei ^a   Tang, Gongguo ^a   Wakin, Michael B ^a  

^a Department of Geology and Geological Engineering   (United States)

Author keywords

Low rank matrix optimization; matrix sensing; nonconvex optimization; optimization geometry; strict saddle

Indexed keywords

COMPUTATIONAL GEOMETRY; ITERATIVE METHODS;

COMPUTATIONAL BURDEN; GEOMETRIC PROPERTIES; ITERATIVE OPTIMIZATION ALGORITHMS; LOW-RANK MATRICES; NONCONVEX OPTIMIZATION; OBJECTIVE FUNCTIONS; OPTIMIZATION GEOMETRIES; STRICT SADDLE;

OPTIMIZATION;

EID: 85048103010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GlobalSIP.2017.8309166     Document Type: Conference Paper

References (31)

1. S. Aaronson, "The learnability of quantum states," in Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol. 463, pp. 3089-3114, The Royal Society, 2007.
2. T. Hong, H. Bai, S. Li, and Z. Zhu, "An efficient algorithm for designing projection matrix in compressive sensing based on alternating optimization," Signal Processing, vol. 125, pp. 9- 20, 2016.
3. N. Srebro, J. Rennie, and T. S. Jaakkola, "Maximum-margin matrix factorization," in Advances in Neural Information Processing Systems, pp. 1329-1336, 2004.
4. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization," SIAM Review, vol. 52, no. 3, pp. 471-501, 2010.
5. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," Foundations of Computational Mathematics, vol. 9, no. 6, pp. 717-772, 2009.
6. 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), pp. 3386-3393, IEEE, 2012.
7. M. A. Davenport and J. Romberg, "An overview of low-rank matrix recovery from incomplete observations," IEEE Journal of Selected Topics in Signal Processing, vol. 10, no. 4, pp. 608- 622, 2016.
8. K. Mohan and M. Fazel, "Reweighted nuclear norm minimization with application to system identification," in Proceedings of the 2010 American Control Conference, pp. 2953-2959, IEEE, 2010.
9. S. Burer and R. D. Monteiro, "A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization," Mathematical Programming, vol. 95, no. 2, pp. 329-357, 2003.
10. S. Burer and R. D. Monteiro, "Local minima and convergence in low-rank semidefinite programming," Mathematical Programming, vol. 103, no. 3, pp. 427-444, 2005.
11. S. Bhojanapalli, B. Neyshabur, and N. Srebro, "Global optimality of local search for low rank matrix recovery," arXiv preprint arXiv:1605.07221, 2016.
12. R. Ge, J. D. Lee, and T. Ma, "Matrix completion has no spurious local minimum," arXiv preprint arXiv:1605.07272, 2016.
13. D. Park, A. Kyrillidis, C. Caramanis, and S. Sanghavi, "Nonsquare matrix sensing without spurious local minima via the Burer-Monteiro approach," arXiv preprint arXiv:1609.03240, 2016.
14. Q. Li and G. Tang, "The nonconvex geometry of low-rank matrix optimizations with general objective functions," arXiv preprint arXiv:1611.03060, 2016.
15. X. Li, Z. Wang, J. Lu, R. Arora, J. Haupt, H. Liu, and T. Zhao, "Symmetry, saddle points, and global geometry of nonconvex matrix factorization," arXiv preprint arXiv:1612.09296, 2016.
16. Q. Li, Z. Zhu, and G. Tang, "Geometry of factored nuclear norm regularization," arXiv preprint arXiv:1704.01265, 2017.
17. Z. Zhu, Q. Li, G. Tang, and M. B. Wakin, "The global optimization geometry of nonsymmetric matrix factorization and sensing," arXiv preprint arXiv:1703.01256, 2017.
18. 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, pp. 797-842, 2015.
19. A. R. Conn, N. I. Gould, and P. L. Toint, Trust region methods. SIAM, 2000.
20. J. Sun, Q. Qu, and J. Wright, "When are nonconvex problems not scary?," arXiv preprint arXiv:1510.06096, 2015.
21. J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht, "Gradient descent converges to minimizers," University of California, Berkeley, vol. 1050, p. 16, 2016.
22. S. Tu, R. Boczar, M. Soltanolkotabi, and B. Recht, "Low-rank solutions of linear matrix equations via Procrustes flow," arXiv preprint arXiv:1507.03566, 2015.
23. L. Wang, X. Zhang, and Q. Gu, "A unified computational and statistical framework for nonconvex low-rank matrix estimation," arXiv preprint arXiv:1610.05275, 2016.
24. J. Sun, Q. Qu, and J. Wright, "A geometric analysis of phase retrieval," arXiv preprint arXiv:1602.06664, 2016.
25. E. J. Candès and Y. Plan, "Tight oracle inequalities for lowrank matrix recovery from a minimal number of noisy random measurements," IEEE Transactions on Information Theory, vol. 57, no. 4, pp. 2342-2359, 2011.
26. M. Udell, C. Horn, R. Zadeh, and S. Boyd, "Generalized low rank models," arXiv preprint arXiv:1410.0342, 2014.
27. E. J. Candès, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?," Journal of the ACM (JACM), vol. 58, no. 3, p. 11, 2011.
28. M. A. Davenport, Y. Plan, E. van den Berg, and M. Wootters, "1-bit matrix completion," Information and Inference, vol. 3, no. 3, pp. 189-223, 2014.
29. J. Salmon, Z. Harmany, C.-A. Deledalle, and R. Willett, "Poisson noise reduction with non-local PCA," Journal of Mathematical Imaging and Vision, vol. 48, no. 2, pp. 279-294, 2014.
30. P. Jain, R. Meka, and I. S. Dhillon, "Guaranteed rank minimization via singular value projection," in Advances in Neural Information Processing Systems, pp. 937-945, 2010.
31. J.-F. Cai, E. J. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956-1982, 2010.