{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:46:17Z","timestamp":1757616377063,"version":"3.44.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/ieeeconf44664.2019.9048714","type":"proceedings-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T01:10:33Z","timestamp":1585617033000},"page":"721-725","source":"Crossref","is-referenced-by-count":3,"title":["Beyond Procrustes: Balancing-free Gradient Descent for Asymmetric Low-Rank Matrix Sensing"],"prefix":"10.1109","author":[{"given":"Cong","family":"Ma","sequence":"first","affiliation":[{"name":"Princeton University,Department of Operations Research and Financial Engineering"}]},{"given":"Yuanxin","family":"Li","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Department of Electrical and Computer Engineering"}]},{"given":"Yuejie","family":"Chi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Department of Electrical and Computer Engineering"}]}],"member":"263","reference":[{"key":"ref33","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref32","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref31","article-title":"Algorithmic regularization in learning deep homogeneous models: Layers are automatically balanced","author":"du","year":"2018","journal-title":"arXiv preprint arXiv 1806 00900"},{"key":"ref30","article-title":"Nonconvex rectangular matrix completion via gradient descent without `2,? regularization","author":"chen","year":"2019","journal-title":"arXiv preprint arXiv 1901 04217"},{"key":"ref36","first-page":"1246","article-title":"Gradient descent only converges to minimizers","author":"lee","year":"2016","journal-title":"Conference on Learning Theory"},{"key":"ref35","article-title":"The global optimization geometry of shallow linear neural networks","author":"zhu","year":"2018","journal-title":"arXiv preprint arXiv 1805 04938"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835403"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2773497"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref13","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"98888","author":"negahban","year":"2012","journal-title":"The Journal of Machine Learning Research"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref15","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343623"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref19","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","author":"zheng","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref28","article-title":"Nonconvex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent","author":"li","year":"2017","journal-title":"arXiv preprint arXiv 1709 08115"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref27","article-title":"Nonconvex optimization meets low-rank matrix factorization: An overview","author":"chi","year":"2018","journal-title":"arXiv preprint arXiv 1809 09573"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref6","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":"ref29","first-page":"5751","article-title":"Fast and sample efficient inductive matrix completion via multi-phase procrustes flow","author":"zhang","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref5","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"tu","year":"2016","journal-title":"International Conference Machine Learning"},{"key":"ref8","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150189"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2821706"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.25"},{"key":"ref24","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015","journal-title":"arXiv preprint arXiv 1509 03025"},{"key":"ref23","article-title":"Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion and blind deconvolution","author":"ma","year":"2017","journal-title":"arXiv preprint arXiv 1711 11585"},{"key":"ref26","article-title":"Rapid, robust, and reliable blind deconvolution via nonconvex optimization","author":"li","year":"2018","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"ref25","article-title":"Nonconvex matrix factorization from rank-one measurements","author":"li","year":"2018","journal-title":"arXiv preprint arXiv 1802 06360"}],"event":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2019,11,3]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2019,11,6]]}},"container-title":["2019 53rd Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9034466\/9048648\/09048714.pdf?arnumber=9048714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:16:24Z","timestamp":1757096184000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9048714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf44664.2019.9048714","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}