{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:03:07Z","timestamp":1781193787627,"version":"3.54.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Alan Turing Institute through EPSRC","doi-asserted-by":"publisher","award":["EP\/N510129\/1"],"award-info":[{"award-number":["EP\/N510129\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Turing Seed Funding","award":["SF019"],"award-info":[{"award-number":["SF019"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1409258"],"award-info":[{"award-number":["CCF-1409258"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-1149225"],"award-info":[{"award-number":["CCF-1149225"]}],"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":[[2018,6]]},"DOI":"10.1109\/tit.2018.2816685","type":"journal-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T19:54:57Z","timestamp":1521230097000},"page":"4044-4071","source":"Crossref","is-referenced-by-count":40,"title":["Weighted Matrix Completion and Recovery With Prior Subspace Information"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8202-6316","authenticated-orcid":false,"given":"Armin","family":"Eftekhari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6984-9553","authenticated-orcid":false,"given":"Dehui","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2165-4586","authenticated-orcid":false,"given":"Michael B.","family":"Wakin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref10","author":"eftekhari","year":"2016","journal-title":"SNIPE for memory-limited PCA from incomplete data"},{"key":"ref11","first-page":"2886","article-title":"Memory limited, streaming PCA","author":"mitliagkas","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074571"},{"key":"ref14","author":"eftekhari","year":"2016","journal-title":"MC2 A two-phase algorithm for leveraged matrix completion"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4948-7","author":"foucart","year":"2013","journal-title":"A Mathematical Introduction to Compressive Sensing"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-84800-155-8_7","article-title":"Graph implementations for nonsmooth convex programs","author":"grant","year":"2008","journal-title":"Recent Advances in Learning and Control"},{"key":"ref18","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"mohan","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5531594"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref4","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"chen","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1117\/12.894165"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721677"},{"key":"ref29","article-title":"Matrix computations","author":"golub","year":"2013","journal-title":"Studies in Mathematical Sciences"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref8","first-page":"3585","article-title":"Dynamic matrix recovery from incomplete observations under an exact low-rank constraint","author":"xu","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref7","first-page":"2098","article-title":"Collaborative filtering with graph information: Consistency and scalable methods","author":"rao","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","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","doi-asserted-by":"publisher","DOI":"10.1137\/130919210"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","first-page":"2301","article-title":"Speedup matrix completion with side information: Application to multi-label learning","author":"xu","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","first-page":"3447","article-title":"Matrix completion with noisy side information","author":"chiang","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","author":"jain","year":"2013","journal-title":"Provable Inductive Matrix Completion"},{"key":"ref24","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":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2684784"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2167214"},{"key":"ref25","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"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8361085\/8318676-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8361085\/08318676.pdf?arnumber=8318676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:16Z","timestamp":1649444116000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8318676\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":30,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2816685","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}