{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:30:27Z","timestamp":1768563027119,"version":"3.49.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"European Union\u2019s Horizon 2020 Research and Innovation Program through the ERCBNYQ Project"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["335\/14"],"award-info":[{"award-number":["335\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/tit.2016.2517006","type":"journal-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T20:50:34Z","timestamp":1452631834000},"page":"1501-1515","source":"Crossref","is-referenced-by-count":26,"title":["On the Minimax Risk of Dictionary Learning"],"prefix":"10.1109","volume":"62","author":[{"given":"Alexander","family":"Jung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonina C.","family":"Eldar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Gortz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346508"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.08.010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513573"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424238"},{"key":"ref36","first-page":"3259","article-title":"The sample complexity of dictionary learning","volume":"12","author":"vainsencher","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS998"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191659"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620308"},{"key":"ref27","first-page":"1","article-title":"Learning sparsely used overcomplete dictionaries via alternating minimization","volume":"35","author":"agarwal","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref2","year":"2010","journal-title":"The Data Deluge"},{"key":"ref1","article-title":"The zettabyte era&#x2014;Trends and analysis","year":"2015"},{"key":"ref20","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":"ref22","doi-asserted-by":"crossref","first-page":"3523","DOI":"10.1109\/TIT.2010.2048466","article-title":"Dictionary identification&#x2014;Sparse matrix-factorization via $\\ell _{1}$ -minimization","volume":"56","author":"gribonval","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"ref21","author":"jenatton","year":"2012"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357776"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016257"},{"key":"ref26","first-page":"37.1","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2012","journal-title":"Proc Conf Learn Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357773"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/97.700921"},{"key":"ref55","author":"billingsley","year":"1995","journal-title":"Probability and Measure"},{"key":"ref54","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6289001"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/71.1.135"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-008-0120-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2081679"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2011.6116277"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459452"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.911828"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/089976601300014385"},{"key":"ref17","article-title":"Structured sparse principal component analysis","author":"jenatton","year":"2009"},{"key":"ref18","article-title":"Convex sparse matrix factorizations","author":"bach","year":"2008"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.01.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref3","year":"2010","journal-title":"A special Report on Managing Information Data Data Everywhere"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref8","article-title":"New algorithms for learning incoherent and overcomplete dictionaries","author":"arora","year":"2013"},{"key":"ref7","author":"eldar","year":"2015","journal-title":"Sampling Theory Beyond Bandlimited Systems"},{"key":"ref49","author":"foucart","year":"2012","journal-title":"A Mathematical Introduction to Compressive Sensing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2008.2008065"},{"key":"ref46","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2007.366913"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817449"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2006.1661433"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref44","author":"lehmann","year":"1998","journal-title":"Theory of Point Estimation"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1561\/2000000008"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7406786\/07378975.pdf?arnumber=7378975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:22Z","timestamp":1642003342000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7378975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":55,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2517006","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}