{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:04:24Z","timestamp":1774991064668,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541479","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1148-1152","source":"Crossref","is-referenced-by-count":10,"title":["Minimax lower bounds for Kronecker-structured dictionary learning"],"prefix":"10.1109","author":[{"given":"Zahra","family":"Shakeri","sequence":"first","affiliation":[{"name":"Dept. of Electrical and Computer Engineering, Rutgers University, Piscataway, New Jersey 08854, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Waheed U.","family":"Bajwa","sequence":"additional","affiliation":[{"name":"Dept. of Electrical and Computer Engineering, Rutgers University, Piscataway, New Jersey 08854, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[{"name":"Dept. of Electrical and Computer Engineering, Rutgers University, Piscataway, New Jersey 08854, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Exact recovery of sparsely used overcomplete dictionaries","author":"agarwal","year":"0","journal-title":"arXiv preprint arXiv 1309 1952 2013"},{"key":"ref11","first-page":"779","article-title":"New algorithms for learning incoherent and overcomplete dictionaries","author":"arora","year":"2014","journal-title":"Proceedings of The 27th Conference on Learning Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.01.005"},{"key":"ref13","first-page":"1211","article-title":"Local identification of overcomplete dictionaries","volume":"16","author":"schnass","year":"2015","journal-title":"Journal of Machine Learning Research"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472522"},{"key":"ref15","first-page":"765","article-title":"Performance limits of dictionary learning for sparse coding","author":"jung","year":"2014","journal-title":"Proc IEEE 22nd European Signal Process Conf (EUSIPCO)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2517006"},{"key":"ref17","article-title":"Minimax lower bounds on dictionary learning for tensor data","author":"shakeri","year":"2016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.63"},{"key":"ref3","first-page":"493","article-title":"K-CPD: Learning of overcomplete dictionaries for tensor sparse coding","author":"duan","year":"2012","journal-title":"Proc IEEE 21st Int Conf Pattern Recognition (ICPR)"},{"key":"ref6","first-page":"2949","article-title":"De-composable nonlocal tensor dictionary learning for multispectral image denoising","author":"peng","year":"2014","journal-title":"Proc IEEE Conf Comput Vision and Pattern Recognition (CVPR)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2013.6622725"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.06.035"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-016-0607-z"},{"key":"ref2","article-title":"Denoising and completion of 3D data via multidimensional dictionary learning","author":"zhang","year":"2015","journal-title":"arXiv preprint arXiv 1512 00327"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1162\/089976603762552951"},{"key":"ref9","article-title":"Learning sparsely used overcomplete dictionaries via alternating minimization","author":"agarwal","year":"0","journal-title":"arXiv preprint arXiv 1310 7991 2013"},{"key":"ref20","author":"smilde","year":"2005","journal-title":"Multi-Way Analysis Applications in the Chemical Sciences"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00393-9"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541479.pdf?arnumber=7541479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:11Z","timestamp":1774986791000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541479\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541479","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}