{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T23:24:02Z","timestamp":1775604242505,"version":"3.50.1"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-16-1-0077"],"award-info":[{"award-number":["FA9550-16-1-0077"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1761506"],"award-info":[{"award-number":["CCF-1761506"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1818904"],"award-info":[{"award-number":["ECCS-1818904"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1806154"],"award-info":[{"award-number":["CCF-1806154"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1818571"],"award-info":[{"award-number":["ECCS-1818571"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0205"],"award-info":[{"award-number":["FA9550-15-1-0205"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2387"],"award-info":[{"award-number":["N00014-15-1-2387"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tit.2018.2847695","type":"journal-article","created":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T19:36:44Z","timestamp":1529091404000},"page":"7287-7310","source":"Crossref","is-referenced-by-count":39,"title":["Median-Truncated Nonconvex Approach for Phase Retrieval With Outliers"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2711-7295","authenticated-orcid":false,"given":"Huishuai","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6766-5459","authenticated-orcid":false,"given":"Yuejie","family":"Chi","sequence":"additional","affiliation":[]},{"given":"Yingbin","family":"Liang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"li","year":"2017","journal-title":"Nonconvex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent"},{"key":"ref38","author":"li","year":"2016","journal-title":"Symmetry saddle points and global optimization landscape of nonconvex matrix factorization"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref32","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04898-2_594"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/120893707"},{"key":"ref36","article-title":"Rapid, robust, and reliable blind deconvolution via nonconvex optimization","author":"li","year":"2018","journal-title":"Appl Comput Harmon Anal"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2017.8309158"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2636204"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050525"},{"key":"ref62","article-title":"Fast algorithms for robust pca via gradient descent","author":"yi","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2015.2498402"},{"key":"ref63","first-page":"1","article-title":"A nonconvex approach for phase retrieval: Reshaped wirtinger flow and incremental algorithms","volume":"18","author":"zhang","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref28","author":"hand","year":"2016","journal-title":"An Elementary Proof of Convex Phase Retrieval in the Natural Parameter Space via the Linear Program PhaseMax"},{"key":"ref64","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 (NIPS)"},{"key":"ref27","author":"hand","year":"2016","journal-title":"Corruption robust phase retrieval via linear programming"},{"key":"ref65","author":"zheng","year":"2016","journal-title":"Convergence analysis for rectangular matrix completion using burer-monteiro factorization and gradient descent"},{"key":"ref66","author":"chen","year":"2018","journal-title":"Gradient descent with random initialization Fast global convergence for nonconvex phase retrieval"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2821706"},{"key":"ref68","author":"fu","year":"2018","journal-title":"Local geometry of one-hidden-layer neural networks for logistic regression"},{"key":"ref2","article-title":"Simple, efficient, and neural algorithms for sparse coding","author":"arora","year":"2015","journal-title":"Proc Conf Learn Theory"},{"key":"ref1","article-title":"Tensor vs. matrix methods: Robust tensor decomposition under block sparse perturbations","author":"anandkumar","year":"2016","journal-title":"Proc Artif Intell Stat"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-013-9305-2"},{"key":"ref22","author":"drenth","year":"2007","journal-title":"X-Ray Crystallography"},{"key":"ref21","article-title":"Products and quotients of random variables and their applications","author":"donahue","year":"1964"},{"key":"ref24","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1364\/AO.21.002758"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2016.01.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800768"},{"key":"ref50","article-title":"Complete dictionary recovery using nonconvex optimization","author":"sun","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541725"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756858"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0738-9"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800663"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1029102.1029116"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.006"},{"key":"ref54","article-title":"Low-rank solutions of linear matrix equations via Procrustes flow","author":"tu","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref53","author":"tibshirani","year":"2008","journal-title":"Fast Computation of the Median by Successive Binning"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.25"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref11","first-page":"693","article-title":"Finding frequent items in data streams","author":"charikar","year":"0","journal-title":"Automata Languages and Programming"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620109"},{"key":"ref12","author":"chen","year":"2017","journal-title":"Robust wirtinger flow for phase retrieval with arbitrary corruption"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109687"},{"key":"ref14","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","author":"chen","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref15","author":"chen","year":"2016","journal-title":"The projected power method An efficient algorithm for joint alignment from pairwise differences"},{"key":"ref16","article-title":"Robust sparse regression under adversarial corruption","author":"chen","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref18","author":"chen","year":"2015","journal-title":"Fast low-rank estimation by projected gradient descent General statistical and algorithmic guarantees"},{"key":"ref19","author":"de sa","year":"2015","journal-title":"Global convergence of stochastic gradient descent for some non-convex matrix problems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.07.001"},{"key":"ref3","article-title":"Phase retrieval meets statistical learning theory: A flexible convex relaxation","author":"bahmani","year":"2017","journal-title":"Proc Artif Intell Stat"},{"key":"ref6","author":"boumal","year":"2016","journal-title":"Nonconvex phase synchronization"},{"key":"ref5","article-title":"On the low-rank approach for semidefinite programs arising in synchronization and community detection","author":"bandeira","year":"2016","journal-title":"Proc 29th Annu Conf Learn Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.09.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9162-z"},{"key":"ref49","article-title":"Algorithms theory for clustering nonconvex quadratic programming","author":"soltanolkotabi","year":"2014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref46","article-title":"Subspace clustering with irrelevant features via robust dantzig selector","author":"qu","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2740166"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/APS.2016.7696240"},{"key":"ref47","article-title":"Convolutional phase retrieval","author":"qu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref42","article-title":"Phase retrieval using alternating minimization","author":"netrapalli","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref41","author":"ma","year":"2017","journal-title":"Implicit regularization in nonconvex statistical estimation Gradient descent converges linearly for phase retrieval matrix completion and blind deconvolution"},{"key":"ref44","author":"park","year":"2016","journal-title":"Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems"},{"key":"ref43","article-title":"Non-convex robust PCA","author":"netrapalli","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8497120\/8386800-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8497120\/08386800.pdf?arnumber=8386800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:52:27Z","timestamp":1649443947000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8386800\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":68,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2847695","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}