{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T21:09:30Z","timestamp":1771708170151,"version":"3.50.1"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-18-1-2142"],"award-info":[{"award-number":["N00014-18-1-2142"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-19-1-2404"],"award-info":[{"award-number":["N00014-19-1-2404"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CAREER ECCS-1818571"],"award-info":[{"award-number":["CAREER ECCS-1818571"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","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":"NSF","doi-asserted-by":"publisher","award":["CCF-1901199"],"award-info":[{"award-number":["CCF-1901199"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Liang Ji-Dian Graduate Fellowship"},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-18-1-2142"],"award-info":[{"award-number":["N00014-18-1-2142"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-19-1-2404"],"award-info":[{"award-number":["N00014-19-1-2404"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CAREER ECCS-1818571"],"award-info":[{"award-number":["CAREER ECCS-1818571"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","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":"NSF","doi-asserted-by":"publisher","award":["CCF-1901199"],"award-info":[{"award-number":["CCF-1901199"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/tit.2021.3075148","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T20:49:50Z","timestamp":1619124590000},"page":"4784-4811","source":"Crossref","is-referenced-by-count":8,"title":["Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4038-8620","authenticated-orcid":false,"given":"Laixi","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6766-5459","authenticated-orcid":false,"given":"Yuejie","family":"Chi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717778"},{"key":"ref71","doi-asserted-by":"crossref","DOI":"10.1017\/9781108627771","volume":"48","author":"wainwright","year":"2019","journal-title":"High-dimensional statistics A non-asymptotic viewpoint"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2517011"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2840711"},{"key":"ref32","article-title":"Composite optimization for robust blind deconvolution","author":"charisopoulos","year":"2019","journal-title":"arXiv 1901 01624"},{"key":"ref31","article-title":"Convex and nonconvex optimization are both minimax-optimal for noisy blind deconvolution","author":"chen","year":"2020","journal-title":"arXiv 2008 01724"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875385"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940657"},{"key":"ref36","first-page":"3570","article-title":"Geometry and symmetry in short-and-sparse deconvolution","author":"kuo","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2866826"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/16M1103634"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21638"},{"key":"ref62","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"tu","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref61","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref63","article-title":"Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent","author":"tong","year":"2020","journal-title":"arXiv 2005 08898"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2342651"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050427"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288477"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01363-6"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9048972"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2883623"},{"key":"ref67","first-page":"1090","article-title":"Learning convolutional feature hierarchies for visual recognition","author":"kavukcuoglu","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref68","first-page":"1","article-title":"Geometric analysis of nonconvex optimization landscapes for overcomplete learning","author":"qu","year":"2019","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-256420-8.50024-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2160058"},{"key":"ref20","first-page":"1","article-title":"Subgradient descent learns orthogonal dictionaries","author":"bai","year":"2019","journal-title":"Proc 7th Int Conf Learn Represent (ICLR)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2599104"},{"key":"ref21","first-page":"2252","article-title":"Efficient dictionary learning with gradient descent","author":"gilboa","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/31\/11\/115002"},{"key":"ref23","first-page":"4015","article-title":"A nonconvex approach for exact and efficient multichannel sparse blind deconvolution","author":"qu","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2018.01.001"},{"key":"ref50","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":"ref51","first-page":"65","article-title":"Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach","author":"park","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz009"},{"key":"ref58","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":"ref57","first-page":"1022","article-title":"Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow","author":"zhang","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1443"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835403"},{"key":"ref53","first-page":"3873","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref52","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.140"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1661412.1618491"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2226449"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/080732894"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(01)00243-9"},{"key":"ref14","first-page":"1132","article-title":"Global geometry of multichannel sparse blind deconvolution on the sphere","author":"li","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","article-title":"A unified framework for identifiability analysis in bilinear inverse problems with applications to subspace and sparsity models","author":"li","year":"2015","journal-title":"arXiv 1501 06120"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"key":"ref17","first-page":"1","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2012","journal-title":"Proc Conf Learn Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2543462"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294644"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.1997.630083"},{"key":"ref3","first-page":"3459","article-title":"Blind deconvolution for symmetric point-spread functions","author":"lou","year":"2005","journal-title":"Proc IEEE Eng Med Biol 27th Annu Conf"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S1053-8119(03)00058-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1121\/1.4983311"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2362861"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1190\/1.1444503"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/18M1217644"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.241"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref45","first-page":"113","article-title":"Simple, efficient, and neural algorithms for sparse coding","author":"arora","year":"2015","journal-title":"Proc Conf Learn Theory"},{"key":"ref48","article-title":"From symmetry to geometry: Tractable nonconvex problems","author":"zhang","year":"2020","journal-title":"arXiv 2007 06753"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2821706"},{"key":"ref42","first-page":"779","article-title":"New algorithms for learning incoherent and overcomplete dictionaries","author":"arora","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref41","article-title":"Complete dictionary learning via $\\ell^{4}$\n-norm maximization over the orthogonal group","author":"zhai","year":"2019","journal-title":"arXiv 1906 02435"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746605"},{"key":"ref43","first-page":"123","article-title":"Learning sparsely used overcomplete dictionaries","author":"agarwal","year":"2014","journal-title":"Proc Conf Learn Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9457114\/9410615-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9457114\/09410615.pdf?arnumber=9410615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:27Z","timestamp":1652194467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9410615\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":72,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3075148","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}