{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T02:54:23Z","timestamp":1782874463001,"version":"3.54.5"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849683","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"41-45","source":"Crossref","is-referenced-by-count":6,"title":["Iterative Collaborative Filtering for Sparse Noisy Tensor Estimation"],"prefix":"10.1109","author":[{"given":"Devavrat","family":"Shah","sequence":"first","affiliation":[{"name":"Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christina Lee","family":"Yu","sequence":"additional","affiliation":[{"name":"Operations Research and Information Engineering, Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref12","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref16","article-title":"Blind regression: Nonparametric regression for latent variable models via collaborative filtering","author":"song","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref17","first-page":"4715","article-title":"Thy friend is my friend: Iterative collaborative filtering for sparse matrix estimation","author":"borgs","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref28","article-title":"Nuclear norm of higher-order tensors","author":"friedland","year":"2014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21748"},{"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":"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":"Journal of Machine Learning Research"},{"key":"ref2","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref9","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref20","article-title":"Estimation of low-rank tensors via convex optimization","author":"tomioka","year":"2010"},{"key":"ref22","article-title":"Provable tensor factorization with missing data","author":"jain","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref21","first-page":"972","article-title":"Statistical performance of convex tensor decomposition","author":"tomioka","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9269-5"},{"key":"ref23","article-title":"A new sampling technique for tensors","author":"bhojanapalli","year":"2015"},{"key":"ref26","article-title":"Exact tensor completion with sum-of-squares","author":"potechin","year":"2017"},{"key":"ref25","article-title":"Noisy tensor completion via the sum-of-squares hierarchy","author":"barak","year":"2016","journal-title":"Conference on Learning Theory"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849683.pdf?arnumber=8849683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:54Z","timestamp":1773347634000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849683","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}