{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:42:45Z","timestamp":1770745365999,"version":"3.49.0"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["MURI 133668-5079809"],"award-info":[{"award-number":["MURI 133668-5079809"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1462158"],"award-info":[{"award-number":["CMMI-1462158"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1634259"],"award-info":[{"award-number":["CMMI-1634259"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"TRIPODS"},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["W911NF-16-1-0551"],"award-info":[{"award-number":["W911NF-16-1-0551"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004358","name":"Samsung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004358","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Siebel Scholarship"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Claude E. Shannon Research Assistantship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tit.2019.2950299","type":"journal-article","created":{"date-parts":[[2019,10,29]],"date-time":"2019-10-29T20:12:07Z","timestamp":1572379927000},"page":"1760-1784","source":"Crossref","is-referenced-by-count":13,"title":["Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model"],"prefix":"10.1109","volume":"66","author":[{"given":"Yihua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5489-8213","authenticated-orcid":false,"given":"Dogyoon","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2165-5220","authenticated-orcid":false,"given":"Christina Lee","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref71","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","author":"mu","year":"2014","journal-title":"Proc ICML"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2151856"},{"key":"ref39","first-page":"972","article-title":"Statistical performance of convex tensor decomposition","author":"tomioka","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","article-title":"Estimation of low-rank tensors via convex optimization","author":"tomioka","year":"2010","journal-title":"arXiv 1010 0789"},{"key":"ref33","first-page":"2773","article-title":"Tensor decompositions for learning latent variable models","volume":"15","author":"anandkumar","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asx042"},{"key":"ref30","first-page":"692","article-title":"Stochastic blockmodel approximation of a graphon: Theory and consistent estimation","author":"airoldi","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref35","first-page":"595","article-title":"Learning mixed multinomial logit model from ordinal data","author":"oh","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","first-page":"1431","article-title":"Provable tensor factorization with missing data","author":"jain","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1354"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959878"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1454"},{"key":"ref63","first-page":"1135","article-title":"Nearest neighbors in high-dimensional spaces","year":"0","journal-title":"Handbook of Discrete and Computational Geometry"},{"key":"ref28","first-page":"3347","article-title":"A latent source model for online collaborative filtering","author":"bresler","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref64","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":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148257"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.91"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901469"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/Innovations.2013.6544390"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/06066518X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00539840"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000064"},{"key":"ref20","first-page":"5433","article-title":"Rates of convergence of spectral methods for graphon estimation","author":"xu","year":"2017","journal-title":"Proc ICML"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7637-6_2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3_5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.90"},{"key":"ref50","article-title":"Exchangeable random arrays","author":"austin","year":"2013","journal-title":"Proc Workshop Limit Theorems Probab"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2334607"},{"key":"ref59","first-page":"2163","article-title":"Blind regression: Nonparametric regression for latent variable models via collaborative filtering","author":"lee","year":"2016","journal-title":"Proc 30th Int Conf Neural Inf Process Syst"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437629"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.3150\/17-BEJ1000"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893911"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2634418"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1300"},{"key":"ref52","first-page":"1","article-title":"Statistical and computational tradeoffs in biclustering","volume":"4","author":"balakrishnan","year":"2011","journal-title":"Proc NIPS Workshop Comput Trade-Offs Statist Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref40","article-title":"A new sampling technique for tensors","author":"bhojanapalli","year":"2015","journal-title":"arXiv 1502 05023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.57"},{"key":"ref13","first-page":"1","article-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix","volume":"61","author":"lin","year":"2009","journal-title":"Proc CAMSAP"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557103"},{"key":"ref15","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":"ref16","first-page":"903","article-title":"Edge label inference in generalized stochastic block models: From spectral theory to impossibility results","author":"xu","year":"2014","journal-title":"Proc COLT"},{"key":"ref17","first-page":"1864","article-title":"Matrix completion under monotonic single index models","author":"ganti","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","first-page":"1","article-title":"LLORMA: Local low-rank matrix approximation","volume":"17","author":"lee","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref4","first-page":"1321","article-title":"Generalization error bounds for collaborative prediction with low-rank matrices","author":"srebro","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1201\/b14876"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS860"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref8","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref49","first-page":"281","article-title":"Row-column exchangeability and a generalized model for probability","author":"hoover","year":"1981","journal-title":"Proc Exchangeability Probab Statist (Rome)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.49"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21748"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(81)90099-3"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"ref42","first-page":"1619","article-title":"Exact tensor completion with sum-of-squares","author":"potechin","year":"2017","journal-title":"Proc Conf Learn Theory"},{"key":"ref41","first-page":"1","article-title":"Noisy tensor completion via the sum-of-squares hierarchy","author":"barak","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref44","first-page":"1","article-title":"On polynomial time methods for exact low-rank tensor completion","author":"xia","year":"2017","journal-title":"Found Comput Math"},{"key":"ref43","article-title":"Statistically optimal and computationally efficient low rank tensor completion from noisy entries","author":"xia","year":"2017","journal-title":"arXiv 1711 04934"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8999759\/8886428-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8999759\/08886428.pdf?arnumber=8886428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:30:03Z","timestamp":1651080603000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8886428\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":73,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2950299","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}