{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:34:54Z","timestamp":1730277294467,"version":"3.28.0"},"reference-count":43,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/ita.2018.8503215","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T19:42:52Z","timestamp":1540496572000},"page":"1-9","source":"Crossref","is-referenced-by-count":1,"title":["Symmetry. Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization"],"prefix":"10.1109","author":[{"given":"Xingguo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarvis","family":"Haupt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junwei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoran","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raman","family":"Arora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuo","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Deep learning","author":"goodfellow","year":"2016","journal-title":"Book in Preparation"},{"key":"ref38","article-title":"Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions","author":"panageas","year":"2016","journal-title":"arXiv preprint arXiv 1605 00405"},{"key":"ref33","first-page":"2375","article-title":"Provable ICA with unknown Gaussian noise, with implications for Gaussian mixtures and autoencoders","author":"arora","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1214\/14-AOS1208","article-title":"Community detection in dense random networks","volume":"42","author":"arias-castro","year":"2014","journal-title":"The Annals of Statistics"},{"key":"ref31","first-page":"600","author":"gu","year":"2016","journal-title":"Low-rank and sparse structure pursuit via alternating minimization"},{"key":"ref30","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"2016","journal-title":"arXiv preprint arXiv 1605 07784"},{"key":"ref37","first-page":"16","article-title":"Gradient descent converges to minimizers","volume":"1050","author":"lee","year":"2016","journal-title":"University Of California Berkeley"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541725"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref34","first-page":"2238","article-title":"Contrastive learning using spectral methods","author":"zou","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref10","article-title":"Dropping convexity for faster semi-definite optimization","author":"bhojanapalli","year":"0","journal-title":"arXiv preprint 2015"},{"key":"ref40","article-title":"Introduction to differential geometry","author":"robbin","year":"0","journal-title":"ETH Lecture Notes preliminary version January 2011"},{"key":"ref11","first-page":"797","article-title":"Escaping from saddle points-online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref12","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015","journal-title":"ar Xiv preprint arXiv 1509 03025"},{"key":"ref13","article-title":"Efficient approaches for escaping higher order saddle points in non-convex optimization","author":"anandkumar","year":"2016","journal-title":"ar Xiv preprint arXiv 1602 05908"},{"key":"ref14","article-title":"Finding low-rank solutions via non-convex matrix factorization, efficiently and provably","author":"park","year":"2016","journal-title":"arXiv preprint arXiv 1606 03168"},{"key":"ref15","first-page":"559","article-title":"A nonconvex optimization framework for low-rank matrix estimation","author":"zhao","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref16","article-title":"Low-rank solutions of linear matrix equations vi a procrustes flow","author":"tu","year":"2015","journal-title":"ar Xiv preprint arXiv 1507 03566"},{"key":"ref17","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"ar Xiv preprint arXiv 1605 02224"},{"key":"ref18","article-title":"Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach","author":"park","year":"2016","journal-title":"arXiv preprint arXiv 1609 09861"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205567"},{"key":"ref28","article-title":"A non-convex one-pass framework for generalized factorization machines and rank-one matrix sensing","author":"lin","year":"2016","journal-title":"arXiv preprint arXiv 1608 05995"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1151"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"ref29","article-title":"Polynomial networks and factorization machines: New insights and efficient training algorithms","author":"blondel","year":"2016","journal-title":"arXiv preprint arXiv 1607 08810"},{"key":"ref5","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref7","article-title":"Large-scale convex minimization with a low-rank constraint","author":"shalev-shwartz","year":"2011","journal-title":"arXiv preprint arXiv 1106 1622"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref22","article-title":"Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent","author":"zheng","year":"2016","journal-title":"arXiv preprint arXiv 1605 07051"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.25"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(63)90382-3"},{"key":"ref24","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"ar Xiv preprint arXiv 1605 02224"},{"key":"ref41","article-title":"Gradient descent efficiently finds the cubic-regularized non-convex newton step","author":"carmon","year":"2016","journal-title":"arXiv preprint arXiv 1612 00547"},{"key":"ref23","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"arXiv preprint arXiv 1605 07272"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1014"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/978-3-319-46128-1_50","article-title":"Linear convergence of gradient and proximal-gradient methods under the Polyak-Lojasiewicz condition","author":"karimi","year":"2016","journal-title":"Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1178"}],"event":{"name":"2018 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2018,2,11]]},"location":"San Diego, CA","end":{"date-parts":[[2018,2,16]]}},"container-title":["2018 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8486613\/8502949\/08503215.pdf?arnumber=8503215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T15:44:28Z","timestamp":1643211868000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8503215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/ita.2018.8503215","relation":{},"subject":[],"published":{"date-parts":[[2018,2]]}}}