{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T17:40:25Z","timestamp":1772473225065,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000896","name":"EU FETOpen programme through the SMALL Project","doi-asserted-by":"publisher","award":["225913"],"award-info":[{"award-number":["225913"]}],"id":[{"id":"10.13039\/501100000896","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council through the PLEASE Project","doi-asserted-by":"publisher","award":["ERC-StG-2011-277906"],"award-info":[{"award-number":["ERC-StG-2011-277906"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation (DFG) through the Cluster of Excellence CoTeSyS (Cognition for Technical Systems)10.13039\/501100001659","doi-asserted-by":"publisher","award":["KL 2189\/8-1"],"award-info":[{"award-number":["KL 2189\/8-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/tit.2015.2424238","type":"journal-article","created":{"date-parts":[[2015,4,17]],"date-time":"2015-04-17T18:10:57Z","timestamp":1429294257000},"page":"3469-3486","source":"Crossref","is-referenced-by-count":41,"title":["Sample Complexity of Dictionary Learning and Other Matrix Factorizations"],"prefix":"10.1109","volume":"61","author":[{"given":"Remi","family":"Gribonval","sequence":"first","affiliation":[]},{"given":"Rodolphe","family":"Jenatton","sequence":"additional","affiliation":[]},{"given":"Francis","family":"Bach","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Kleinsteuber","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Seibert","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850052"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2307\/2282438"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS400"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-01-00923-5"},{"key":"ref30","article-title":"Learning sparsely used overcomplete dictionaries via alternating minimization","author":"agarwal","year":"2013"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v17-2079"},{"key":"ref36","article-title":"Introduction to the non-asymptotic analysis of random matrices","author":"vershynin","year":"2010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-013-0435-4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref28","first-page":"37.1","article-title":"Exact recovery of sparsely-used dictionaries","volume":"23","author":"spielman","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/188","volume":"188","author":"buldygin","year":"2000","journal-title":"Metric Characterization of Random Variables and Random Processes"},{"key":"ref29","article-title":"New algorithms for learning incoherent and overcomplete dictionaries","author":"arora","year":"2013"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2037655"},{"key":"ref1","author":"mallat","year":"2008","journal-title":"A Wavelet Tour of Signal Processing The Sparse Way"},{"key":"ref20","first-page":"3259","article-title":"The sample complexity of dictionary learning","volume":"12","author":"vainsencher","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref21","first-page":"2777","article-title":"Structured variable selection with sparsity-inducing norms","volume":"12","author":"jenatton","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref24","first-page":"2297","article-title":"Proximal methods for hierarchical sparse coding","volume":"12","author":"jenatton","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref23","article-title":"Shift-invariant dictionary learning for sparse representations: Extending K-SVD","author":"mailh\u00e9","year":"2008","journal-title":"Proc 16th Eur Signal Process Conf (EUSIPCO)"},{"key":"ref26","article-title":"Local stability and robustness of sparse dictionary learning in the presence of noise","author":"jenatton","year":"2012"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"3523","DOI":"10.1109\/TIT.2010.2048466","article-title":"Dictionary identification—Sparse matrix-factorization via $\\ell _{1}$ -minimization","volume":"56","author":"gribonval","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"ref51","article-title":"On the local correctness of ${\\ell _{1}}$ -minimization for dictionary learning","author":"geng","year":"2011"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895290954"},{"key":"ref54","first-page":"395","article-title":"Metric entropy of homogeneous spaces and Finsler geometry of classical Lie groups","volume":"43","author":"szarek","year":"1998","journal-title":"Quantum Probability"},{"key":"ref53","article-title":"The incomplete gamma functions since Tricomi","volume":"147","author":"gautschi","year":"1998","journal-title":"Tricomi's ideas and contemporary applied mathematics Atti dei Convegni Lincei"},{"key":"ref52","article-title":"On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD","author":"schnass","year":"2013"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939537"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6895-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2040551"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.63"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2036477"},{"key":"ref14","first-page":"556","article-title":"Algorithms for non- negative matrix factorization","volume":"13","author":"lee","year":"2001","journal-title":"Advances in neural information processing systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.563524"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxp008"},{"key":"ref18","article-title":"Large-scale sparse principal component analysis with application to text data","author":"zhang","year":"2012"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2069250"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.760624"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"key":"ref8","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":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1293"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1162\/089976603762552951"},{"key":"ref9","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913516"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/18.340451"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/13-EJS822"},{"key":"ref47","first-page":"1545","article-title":"Fast rates for regularized objectives","volume":"21","author":"sridharan","year":"2008","journal-title":"Advances in neural information processing systems"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.850705"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993713"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856980"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.705560"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7109216\/07088631.pdf?arnumber=7088631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:47:43Z","timestamp":1641988063000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7088631\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":55,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2424238","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}