{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T08:18:18Z","timestamp":1793089098189,"version":"4.5.0"},"reference-count":31,"publisher":"National Academy of Sciences","issue":"46","license":[{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000006","name":"DOD | United States Navy | 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\/100000181","name":"DOD | USAF | AFMC | Air Force Office of Scientific Research","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\/100000183","name":"DOD | United States Army | RDECOM | Army Research Office","doi-asserted-by":"publisher","award":["W911NF-18-1-0303"],"award-info":[{"award-number":["W911NF-18-1-0303"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","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":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1900140"],"award-info":[{"award-number":["IIS-1900140"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1662139"],"award-info":[{"award-number":["DMS-1662139"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1712591"],"award-info":[{"award-number":["DMS-1712591"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"HHS | National Institutes of Health","doi-asserted-by":"publisher","award":["R01-GM072611-12"],"award-info":[{"award-number":["R01-GM072611-12"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.pnas.org"],"crossmark-restriction":true},"short-container-title":["Proc. Natl. Acad. Sci. U.S.A."],"published-print":{"date-parts":[[2019,11,12]]},"abstract":"<jats:title>Significance<\/jats:title>\n                  <jats:p>Matrix completion finds numerous applications in data science, ranging from information retrieval to medical imaging. While substantial progress has been made in designing estimation algorithms, it remains unknown how to perform optimal statistical inference on the unknown matrix given the obtained estimates\u2014a task at the core of modern decision making. We propose procedures to debias the popular convex and nonconvex estimators and derive distributional characterizations for the resulting debiased estimators. This distributional theory enables valid inference on the unknown matrix. Our procedures 1) yield optimal construction of confidence intervals for missing entries and 2) achieve optimal estimation accuracy in a sharp manner.<\/jats:p>","DOI":"10.1073\/pnas.1910053116","type":"journal-article","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T19:24:16Z","timestamp":1572463456000},"page":"22931-22937","update-policy":"https:\/\/doi.org\/10.1073\/pnas.cm10313","source":"Crossref","is-referenced-by-count":109,"title":["Inference and uncertainty quantification for noisy matrix completion"],"prefix":"10.1073","volume":"116","author":[{"given":"Yuxin","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Princeton University, Princeton, NJ 08544;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianqing","family":"Fan","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2532-0038","authenticated-orcid":false,"given":"Cong","family":"Ma","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuling","family":"Yan","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"341","published-online":{"date-parts":[[2019,10,30]]},"reference":[{"key":"e_1_3_3_1_2","unstructured":"N. Srebro \u201cLearning with matrix factorizations \u201d PhD thesis Massachusetts Institute of Technology Cambridge MA (2004)."},{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"e_1_3_3_5_2","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"Negahban S.","year":"2012","unstructured":"S. Negahban, M. Wainwright, Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. J. Mach. Learn. Res. 13, 1665\u20131697 (2012).","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"e_1_3_3_7_2","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"Keshavan R. H.","year":"2010","unstructured":"R. H. Keshavan, A. Montanari, S. Oh, Matrix completion from noisy entries. J. Mach. Learn. Res. 11, 2057\u20132078 (2010).","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"e_1_3_3_9_2","first-page":"315","volume-title":"Conference on Learning Theory","author":"Foygel R.","year":"2011","unstructured":"R. Foygel, N. Srebro, \u201cConcentration-based guarantees for low-rank matrix reconstruction\u201d in Conference on Learning Theory, S. M. Kakade, U. von Luxburg, Eds. (Proceedings of Machine Learning Research, Budapest, Hungary, 2011), pp. 315\u2013340."},{"key":"e_1_3_3_10_2","unstructured":"Y. Chen M. J. Wainwright Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees. arXiv:1509.03025 (10 September 2015)."},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.3150\/17-BEJ933"},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Y. Chen Y. Chi J. Fan C. Ma Y. Yan Noisy matrix completion: Understanding statistical guarantees for convex relaxation via nonconvex optimization. arXiv:1902.07698 (20 February 2019).","DOI":"10.1137\/19M1290000"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12026"},{"key":"e_1_3_3_15_2","first-page":"2869","article-title":"Confidence intervals and hypothesis testing for high-dimensional regression","volume":"15","author":"Javanmard A.","year":"2014","unstructured":"A. Javanmard, A. Montanari, Confidence intervals and hypothesis testing for high-dimensional regression. J. Mach. Learn. Res. 15, 2869\u20132909 (2014).","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_3_16_2","first-page":"413","article-title":"A significance test for the lasso","volume":"42","author":"Lockhart R.","year":"2014","unstructured":"R. Lockhart, J. Taylor, R. J. Tibshirani, R. Tibshirani, A significance test for the lasso. Ann. Stat. 42, 413\u2013468 (2014).","journal-title":"Ann. Stat."},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1221"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1080\/02331888.2016.1265969"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1448"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1214\/15-EJS1031"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1286"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"e_1_3_3_23_2","first-page":"545","volume-title":"International Conference on Computational Learning Theory","author":"Srebro N.","year":"2005","unstructured":"N. Srebro, A. Shraibman, \u201cRank, trace-norm and max-norm\u201d in International Conference on Computational Learning Theory, P. Auer, R. Meir, Eds. (Springer, Berlin, Germany, 2005), pp. 545\u2013560."},{"key":"e_1_3_3_24_2","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"Mazumder R.","year":"2010","unstructured":"R. Mazumder, T. Hastie, R. Tibshirani, Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11, 2287\u20132322 (2010).","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0040-1"},{"key":"e_1_3_3_28_2","unstructured":"E. Abbe J. Fan K. Wang Y. Zhong Entrywise eigenvector analysis of random matrices with low expected rank. arXiv:1709.09565 (2 May 2017)."},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.02.001"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12016"},{"key":"e_1_3_3_31_2","unstructured":"National Climatic Data Center. https:\/\/www.ncdc.noaa.gov\/ (31 August 2019)."}],"container-title":["Proceedings of the National Academy of Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.pnas.org\/syndication\/doi\/10.1073\/pnas.1910053116","content-type":"unspecified","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/pnas.org\/doi\/pdf\/10.1073\/pnas.1910053116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T05:48:11Z","timestamp":1649828891000},"score":1,"resource":{"primary":{"URL":"https:\/\/pnas.org\/doi\/full\/10.1073\/pnas.1910053116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,30]]},"references-count":31,"journal-issue":{"issue":"46","published-print":{"date-parts":[[2019,11,12]]}},"alternative-id":["10.1073\/pnas.1910053116"],"URL":"https:\/\/doi.org\/10.1073\/pnas.1910053116","relation":{},"ISSN":["0027-8424","1091-6490"],"issn-type":[{"value":"0027-8424","type":"print"},{"value":"1091-6490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,30]]},"assertion":[{"value":"2019-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}