{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:36Z","timestamp":1740131676812,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1948256","CNS-1955997"],"award-info":[{"award-number":["CCF-1948256","CNS-1955997"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Rising Stars Award","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tit.2023.3237231","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:25:38Z","timestamp":1673897138000},"page":"3121-3149","source":"Crossref","is-referenced-by-count":0,"title":["Robust Max Entrywise Error Bounds for Tensor Estimation From Sparse Observations via Similarity-Based Collaborative Filtering"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0737-3259","authenticated-orcid":false,"given":"Devavrat","family":"Shah","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2165-5220","authenticated-orcid":false,"given":"Christina Lee","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1745"},{"key":"ref12","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":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1854"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1986"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/17M1122025"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1942"},{"key":"ref30","first-page":"1","article-title":"On polynomial time methods for exact low-rank tensor completion","volume":"19","author":"xia","year":"2017","journal-title":"Found Comput Math"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3239"},{"key":"ref10","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":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2724549"},{"key":"ref2","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950299"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2992769"},{"key":"ref16","first-page":"2155","article-title":"Blind regression: Nonparametric regression for latent variable models via collaborative filtering","author":"song","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","first-page":"3345","article-title":"Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval and matrix completion","author":"ma","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2193"},{"key":"ref18","first-page":"4715","article-title":"Thy friend is my friend: Iterative collaborative filtering for sparse matrix estimation","author":"borgs","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"1","article-title":"Provable tensor factorization with missing data","author":"jain","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","volume":"48","author":"wainwright","year":"2019","journal-title":"High-dimensional statistics A non-asymptotic viewpoint"},{"key":"ref23","first-page":"972","article-title":"Statistical performance of convex tensor decomposition","author":"tomioka","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"The Probabilistic Method","year":"2016","author":"alon","key":"ref45"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9269-5"},{"key":"ref25","article-title":"A new sampling technique for tensors","author":"bhojanapalli","year":"2015","journal-title":"arXiv 1502 05023"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref42","first-page":"41","article-title":"Iterative collaborative filtering for sparse noisy tensor estimation","author":"shah","year":"2019","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref41","first-page":"1271","article-title":"Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality","author":"cai","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","article-title":"Estimation of low-rank tensors via convex optimization","author":"tomioka","year":"2010","journal-title":"arXiv 1010 0789"},{"key":"ref44","first-page":"1","article-title":"Nonparametric modeling of higher-order interactions via hypergraphons","volume":"22","author":"balasubramanian","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref28","first-page":"1619","article-title":"Exact tensor completion with sum-of-squares","author":"potechin","year":"2017","journal-title":"Proc Conf Learn Theory"},{"key":"ref27","first-page":"417","article-title":"Noisy tensor completion via the sum-of-squares hierarchy","author":"barak","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21748"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref7","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref9","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref40","first-page":"1","article-title":"Nonconvex low-rank tensor completion from noisy data","volume":"32","author":"cai","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10106509\/10018198-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10106509\/10018198.pdf?arnumber=10018198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T18:42:19Z","timestamp":1683571339000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10018198\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":47,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3237231","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}