{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T11:41:41Z","timestamp":1784288501322,"version":"3.55.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/tit.2020.2992234","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T19:46:58Z","timestamp":1588621618000},"page":"5806-5841","source":"Crossref","is-referenced-by-count":29,"title":["Nonconvex Rectangular Matrix Completion via Gradient Descent Without <i>\u2113<\/i>\u2082,<sub>\u221e<\/sub> Regularization"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9537-2434","authenticated-orcid":false,"given":"Ji","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of California at Davis, Davis, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dekai","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of California at Davis, Davis, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503198"},{"key":"ref38","article-title":"Leave-one-out approach for matrix completion: Primal and dual analysis","author":"ding","year":"2018","journal-title":"arXiv 1803 07554"},{"key":"ref33","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":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","article-title":"Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval","author":"chen","year":"2018","journal-title":"arXiv 1803 07726"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1443"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref37","article-title":"Entrywise eigenvector analysis of random matrices with low expected rank","author":"abbe","year":"2017","journal-title":"arXiv 1709 09565"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2018.01.001"},{"key":"ref35","first-page":"2","article-title":"Algorithmic regularization in over-parameterized matrix sensing and neural networks with quadratic activations","author":"li","year":"2018","journal-title":"Proc Conf Learn Theory"},{"key":"ref34","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","volume":"48","author":"tu","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref10","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref40","volume":"78","author":"paulsen","year":"2002","journal-title":"Completely bounded maps and operator algebras CUP"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref13","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref16","first-page":"638","article-title":"Fast matrix completion without the condition number","author":"hardt","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref17","first-page":"559","article-title":"A nonconvex optimization framework for low rank matrix estimation","author":"zhao","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref19","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015","journal-title":"arXiv 1509 03025"},{"key":"ref28","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","volume":"70","author":"ge","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46084-5_113"},{"key":"ref27","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020425"},{"key":"ref6","first-page":"1","article-title":"Model-free nonconvex matrix completion: Local minima analysis and applications in memory-efficient kernel PCA","volume":"20","author":"chen","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495105"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref2","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 1711 10467"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref1","article-title":"Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent","author":"zheng","year":"2016","journal-title":"arXiv 1605 07051"},{"key":"ref20","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/0707001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1307842110"},{"key":"ref21","first-page":"981","article-title":"A unified computational and statistical framework for nonconvex low-rank matrix estimation","volume":"54","author":"wang","year":"2017","journal-title":"Proc 20th Int Conf Artif Intell Statist"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548317000463"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0614041"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOP1025"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref44","article-title":"The global optimization geometry of nonsymmetric matrix factorization and sensing","author":"zhu","year":"2017","journal-title":"arXiv 1703 01256"},{"key":"ref26","first-page":"2358","article-title":"Recovery guarantee of weighted low-rank approximation via alternating minimization","author":"li","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1561\/2200000048"},{"key":"ref25","first-page":"1881","article-title":"Universal matrix completion","volume":"32","author":"bhojanapalli","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9170933\/09086040.pdf?arnumber=9086040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T19:09:18Z","timestamp":1742584158000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9086040\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":45,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2992234","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]}}}