{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T03:18:05Z","timestamp":1772767085331,"version":"3.50.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"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":["DMS-1622134"],"award-info":[{"award-number":["DMS-1622134"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-1664803"],"award-info":[{"award-number":["DMS-1664803"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1934904"],"award-info":[{"award-number":["CCF-1934904"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["DMS-1348721"],"award-info":[{"award-number":["DMS-1348721"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF BIGDATA","doi-asserted-by":"publisher","award":["1740325"],"award-info":[{"award-number":["1740325"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF DMS","doi-asserted-by":"publisher","award":["2011140"],"award-info":[{"award-number":["2011140"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Stanford UAR Major Grant"},{"DOI":"10.13039\/501100000038","name":"NSERC Discovery","doi-asserted-by":"publisher","award":["22R23068"],"award-info":[{"award-number":["22R23068"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"PIMS CRG 33: High-Dimensional Data Analysis"},{"name":"Tier II CRC in Data Science"},{"DOI":"10.13039\/100000001","name":"NSF CAREER Award","doi-asserted-by":"publisher","award":["CCF-1844628"],"award-info":[{"award-number":["CCF-1844628"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1109\/tit.2020.3039308","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T05:20:55Z","timestamp":1605849655000},"page":"1264-1290","source":"Crossref","is-referenced-by-count":24,"title":["Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns"],"prefix":"10.1109","volume":"67","author":[{"given":"Simon","family":"Foucart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8058-8638","authenticated-orcid":false,"given":"Deanna","family":"Needell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reese","family":"Pathak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaniv","family":"Plan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2345-2531","authenticated-orcid":false,"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref38","article-title":"Noisy low-rank matrix completion with general sampling distribution","author":"klopp","year":"2012","journal-title":"arXiv 1203 0108"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569166"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20483"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/11-EJS637"},{"key":"ref36","article-title":"High dimensional matrix estimation with unknown variance of the noise","author":"klopp","year":"2011","journal-title":"arXiv 1112 3055"},{"key":"ref35","first-page":"1391","article-title":"The algebraic combinatorial approach for low-rank matrix completion","volume":"16","author":"kir\u00e1ly","year":"2015","journal-title":"Mach Learn"},{"key":"ref34","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref60","first-page":"1","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2004","journal-title":"Proc Adv Neural Process Syst (NIPS)"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"ref61","first-page":"2056","article-title":"Collaborative filtering in a non-uniform world: Learning with the weighted trace norm","author":"srebro","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/BF00129684"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011419012209"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref65","article-title":"Introduction to the non-asymptotic analysis of random matrices","author":"vershynin","year":"2010","journal-title":"arXiv 1011 3027"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273499"},{"key":"ref1","article-title":"Low-rank matrix factorization with attributes","author":"abernethy","year":"2006","journal-title":"arXiv cs\/0611124"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref22","article-title":"Weighted matrix completion and recovery with prior subspace information","author":"eftekhari","year":"2016","journal-title":"arXiv 1612 01720"},{"key":"ref21","article-title":"MC2: A two-phase algorithm for leveraged matrix completion","author":"eftekhari","year":"2016","journal-title":"arXiv 1609 01795"},{"key":"ref24","first-page":"315","article-title":"Concentration-based guarantees for low-rank matrix reconstruction","author":"foygel","year":"2011","journal-title":"Proc 24th Annu Conf Learn Theory"},{"key":"ref23","article-title":"De-biasing low-rank projection for matrix completion","volume":"10394","author":"foucart","year":"2017","journal-title":"Proc SPIE Opt Photon"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020425"},{"key":"ref25","article-title":"Sharp oracle inequalities for the prediction of a high-dimensional matrix","author":"ga\u00efffas","year":"2010","journal-title":"arXiv 1008 4886"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541268"},{"key":"ref51","first-page":"1","article-title":"High-dimensional estimation with geometric constraints","volume":"6","author":"plan","year":"2017","journal-title":"Inf Inference"},{"key":"ref59","first-page":"1321","article-title":"Generalization error bounds for collaborative prediction with low-rank matrices","author":"srebro","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/090750688"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709842104"},{"key":"ref56","article-title":"Matrix completion with deterministic pattern—A geometric perspective","author":"shapiro","year":"2018","journal-title":"arXiv 1802 00047"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v18-2865"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS860"},{"key":"ref53","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref52","first-page":"93","article-title":"Bounded matrix rigidity and john’s theorem","volume":"23","author":"rashtchian","year":"2016","journal-title":"Electron Colloq Comput Complex"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1147"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS926"},{"key":"ref12","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"cai","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref16","article-title":"A deterministic theory of low rank matrix completion","author":"chatterjee","year":"2019","journal-title":"arXiv 1910 01079"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref18","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"chen","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010572-45"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2780983"},{"key":"ref3","first-page":"41","article-title":"Multi-task feature learning","author":"argyriou","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","first-page":"3422","article-title":"Rank determination for low-rank data completion","volume":"18","author":"ashraphijuo","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref5","first-page":"2116","article-title":"Fundamental conditions for low-CP-rank tensor completion","volume":"18","author":"ashraphijuo","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.62"},{"key":"ref7","first-page":"1881","article-title":"Universal matrix completion","author":"bhojanapalli","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2537145"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref45","article-title":"Matrix completion with deterministic sampling: Theories and methods","author":"liu","year":"2018","journal-title":"arXiv 1805 02313"},{"key":"ref48","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":"ref47","first-page":"1258","article-title":"Matrix completion from power-law distributed samples","author":"meka","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref42","first-page":"1297","article-title":"Practical large-scale optimization for max-norm regularization","author":"jason lee","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref44","first-page":"2358","article-title":"Recovery guarantee of weighted low-rank approximation via alternating minimization","author":"li","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","first-page":"1781","article-title":"Matrix completion from any given set of observations","author":"lee","year":"2013","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\/9333790\/9264187-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9333790\/09264187.pdf?arnumber=9264187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:16Z","timestamp":1652194456000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9264187\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":65,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3039308","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2]]}}}