{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,7]],"date-time":"2026-09-07T12:15:38Z","timestamp":1788783338016,"version":"build-2803163510"},"reference-count":96,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Gordon Y. S. Wu Fellowship in Engineering"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1908308"],"award-info":[{"award-number":["CCF-1908308"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Princeton Schmidt Data-X Research Award"},{"name":"Alfred P. Sloan Research Fellowship"},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research (AFOSR) Young Investigator Program","doi-asserted-by":"publisher","award":["FA9550-19-1-0030"],"award-info":[{"award-number":["FA9550-19-1-0030"]}],"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-19-1-2120"],"award-info":[{"award-number":["N00014-19-1-2120"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office (ARO) YIP","doi-asserted-by":"publisher","award":["W911NF-20-1-0097"],"award-info":[{"award-number":["W911NF-20-1-0097"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1907661"],"award-info":[{"award-number":["CCF-1907661"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1900140\/2218713"],"award-info":[{"award-number":["IIS-1900140\/2218713"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-2100158\/2218773"],"award-info":[{"award-number":["IIS-2100158\/2218773"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-2014279"],"award-info":[{"award-number":["DMS-2014279"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Princeton School of Engineering and Applied Science (SEAS) Innovation Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1109\/tit.2022.3205781","type":"journal-article","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T15:56:03Z","timestamp":1662998163000},"page":"407-452","source":"Crossref","is-referenced-by-count":16,"title":["Uncertainty Quantification for Nonconvex Tensor Completion: Confidence Intervals, Heteroscedasticity and Optimality"],"prefix":"10.1109","volume":"69","author":[{"given":"Changxiao","family":"Cai","sequence":"first","affiliation":[{"name":"Department of Biostatistics, University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2062-131X","authenticated-orcid":false,"given":"H. Vincent","family":"Poor","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9256-5815","authenticated-orcid":false,"given":"Yuxin","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Statistics and Data Science, The Wharton School, University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3205781"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2106"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.21236\/ada604494"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1694"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/21-aos2061"},{"key":"ref8","article-title":"Low-rank tensor estimation via Riemannian gauss-Newton: Statistical optimality and second-order convergence","author":"Luo","year":"2021","journal-title":"arXiv:2104.12031"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2022.2063131"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2305840"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1190\/geo2013-0022.1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"issue":"2","key":"ref14","first-page":"339","article-title":"Provable models for robust low-rank tensor completion","volume":"11","author":"Huang","year":"2015","journal-title":"Pacific J. Optim."},{"key":"ref15","first-page":"2967","article-title":"A new convex relaxation for tensor completion","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Romera-Paredes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21748"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1986"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/2200000079"},{"key":"ref19","first-page":"417","article-title":"Noisy tensor completion via the sum-of-squares hierarchy","volume-title":"Proc. 29th Annu. Conf. Learn. Theory","author":"Barak"},{"key":"ref20","first-page":"1619","article-title":"Exact tensor completion with sum-of-squares","volume-title":"Proc. Conf. Learn. Theory","author":"Potechin"},{"key":"ref21","first-page":"1431","article-title":"Provable tensor factorization with missing data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Jain"},{"key":"ref22","first-page":"18905","article-title":"Tensor completion made practical","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/19M1290000"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-012-9176-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9269-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2724549"},{"key":"ref30","article-title":"Estimation of low-rank tensors via convex optimization","author":"Tomioka","year":"2010","journal-title":"arXiv:1010.0789"},{"key":"ref31","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","volume-title":"Proc. 31st Int. Conf. Mach. Learn.","author":"Mu"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1942"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-018-09408-6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.049"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-22758-x_8"},{"key":"ref40","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"Keshavan","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21638"},{"key":"ref44","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":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21760"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01363-6"},{"key":"ref48","first-page":"1107","article-title":"Non-convex robust PCA","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Netrapalli"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2982499"},{"key":"ref50","first-page":"1022","article-title":"Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050427"},{"key":"ref52","article-title":"Fast rank one alternating minimization algorithm for phase retrieval","author":"Cai","year":"2017","journal-title":"arXiv:1708.08751"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2992234"},{"key":"ref54","first-page":"568","article-title":"Solving random systems of quadratic equations via truncated generalized gradient flow","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2066"},{"key":"ref56","article-title":"A non-asymptotic framework for approximate message passing in spiked models","author":"Li","year":"2022","journal-title":"arXiv:2208.03313"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950717"},{"key":"ref59","article-title":"Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent","author":"Tong","year":"2020","journal-title":"arXiv:2005.08898"},{"issue":"1","key":"ref60","first-page":"5164","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":"ref61","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2021.1956501"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2022.02.003"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-016-0754-9"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1307842110"},{"key":"ref65","article-title":"De-biasing the lasso: Optimal sample size for Gaussian designs","author":"Javanmard","year":"2015","journal-title":"arXiv:1508.02757"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2023.2451"},{"key":"ref67","article-title":"Settling the sample complexity of model-based offline reinforcement learning","author":"Li","year":"2022","journal-title":"arXiv:2204.05275"},{"key":"ref68","article-title":"Inference for heteroskedastic PCA with missing data","author":"Yan","year":"2021","journal-title":"arXiv:2107.12365"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1745"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1910053116"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12400"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3111828"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924900"},{"key":"ref74","article-title":"Normal approximation and confidence region of singular subspaces","author":"Xia","year":"2019","journal-title":"arXiv:1901.00304"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1214\/21-aos2146"},{"key":"ref76","article-title":"Power iteration for tensor PCA","author":"Huang","year":"2020","journal-title":"arXiv:2012.13669"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12026"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1221"},{"issue":"1","key":"ref79","first-page":"2869","article-title":"Confidence intervals and hypothesis testing for high-dimensional regression","volume":"15","author":"Javanmard","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1286"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1448"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1214\/23-aos2327"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1461"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1426"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2020.1841645"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-018-00896-9"},{"key":"ref87","article-title":"De-biased sparse PCA: Inference and testing for eigenstructure of large covariance matrices","author":"Jankov\u00e1","year":"2018","journal-title":"arXiv:1801.10567"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1214\/20-aos2038"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1214\/21-aos2074"},{"key":"ref90","first-page":"2897","article-title":"A statistical model for tensor PCA","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Richard"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1137\/s0040585x97981123"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22147-7"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90052-C"},{"key":"ref94","article-title":"Model-free nonconvex matrix completion: Local minima analysis and applications in memory-efficient kernel PCA","author":"Chen","year":"2017","journal-title":"arXiv:1711.01742"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v17-2079"},{"key":"ref96","doi-asserted-by":"crossref","DOI":"10.1007\/b97553","volume-title":"Mathematical Statistics","author":"Shao","year":"2003"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9997158\/9885218-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9997158\/09885218.pdf?arnumber=9885218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T16:19:20Z","timestamp":1705940360000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9885218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":96,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3205781","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]}}}