{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:51:18Z","timestamp":1759042278849,"version":"3.37.3"},"reference-count":84,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000164","name":"Division of Astronomical Sciences through NSF","doi-asserted-by":"publisher","award":["AST-1247885"],"award-info":[{"award-number":["AST-1247885"]}],"id":[{"id":"10.13039\/100000164","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency within the Young Faculty Award","doi-asserted-by":"publisher","award":["N66001-14-1-4047"],"award-info":[{"award-number":["N66001-14-1-4047"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/tit.2016.2549040","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T14:15:45Z","timestamp":1459433745000},"page":"3636-3661","source":"Crossref","is-referenced-by-count":24,"title":["Noisy Matrix Completion Under Sparse Factor Models"],"prefix":"10.1109","volume":"62","author":[{"given":"Akshay","family":"Soni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swayambhoo","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarvis","family":"Haupt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Gonella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0714-4"},{"key":"ref72","first-page":"1727","article-title":"Probabilistic low-rank matrix completion on finite alphabets","author":"lafond","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3242-6"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.863009"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref74","volume":"105","author":"van de geer","year":"2000","journal-title":"Empirical Processes in M-Estimation"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2160072"},{"key":"ref75","volume":"2033","author":"koltchinskii","year":"2011","journal-title":"Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems École d-Été de Probabilités de Saint-Flour XXXVIII-2008"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/110837486"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref79","first-page":"3284","article-title":"Tight convex relaxations for sparse matrix factorization","author":"richard","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2049997"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903139"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1214\/009053604000000076","article-title":"Multiscale likelihood analysis and complexity penalized estimation","volume":"32","author":"kolaczyk","year":"2004","journal-title":"Ann Statist"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s004400050210"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.10.024"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032147"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6855091"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875184"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0099-z"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2012.6290247"},{"key":"ref61","first-page":"1","article-title":"High-rank matrix completion and subspace clustering with missing data","author":"eriksson","year":"2012","journal-title":"Proc Int Conf Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2038076"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001523"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880031"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"article-title":"Estimation of mixture models","year":"1999","author":"li","key":"ref29"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/35.3-4.246"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2441072"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847692"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345465"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref22","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":"ref21","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"},{"article-title":"High-dimensional estimation with geometric constraints","year":"2014","author":"plan","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"aharon","year":"2006","journal-title":"IEEE Trans Signal Process"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"article-title":"Learning sparsely used overcomplete dictionaries via alternating minimization","year":"2013","author":"agarwal","key":"ref50"},{"article-title":"Local stability and robustness of sparse dictionary learning in the presence of noise","year":"2012","author":"jenatton","key":"ref51"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.1315101"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0490-5_20"},{"key":"ref57","first-page":"1278","article-title":"Minimax rates of estimation for sparse PCA in high dimensions","author":"vu","year":"2012","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0_31"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2007.06.007"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/050645506"},{"key":"ref53","first-page":"915","article-title":"Spectral bounds for sparse PCA: Exact and greedy algorithms","author":"moghaddam","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref10","first-page":"1959","article-title":"Sparse factor analysis for learning and content analytics","volume":"15","author":"lan","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"article-title":"Generalized low rank models","year":"2014","author":"udell","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004678431677"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.244"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1034"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref82","first-page":"1","article-title":"Mixture density estimation","author":"li","year":"1999","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1199"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref81"},{"key":"ref17","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177732803"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"ref83","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","author":"gr\u00fcnwald","year":"2007","journal-title":"The Minimum Description Length Principle"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"article-title":"Minimax lower bounds for noisy matrix completion under sparse factor models","year":"2015","author":"sambasivan","key":"ref80"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref5","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495899"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.01.005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.911828"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"3523","DOI":"10.1109\/TIT.2010.2048466","article-title":"Dictionary identification: Sparse matrix-factorization via $l_{1}$ -minimization","volume":"56","author":"gribonval","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.06.035"},{"key":"ref48","first-page":"3087","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref47","first-page":"3180","article-title":"On the local correctness of $l^{1}$ -minimization for dictionary learning","author":"geng","year":"2014","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"ref41","first-page":"1","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","author":"donoho","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref44","first-page":"1214","article-title":"Factoring nonnegative matrices with linear programs","author":"recht","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2190081"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7473802\/07445217.pdf?arnumber=7445217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:44:01Z","timestamp":1641987841000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7445217\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":84,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2549040","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}