{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:21Z","timestamp":1740131661366,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100012338","name":"The Alan Turing Institute under EPSRC","doi-asserted-by":"publisher","award":["EP\/N510129\/1"],"award-info":[{"award-number":["EP\/N510129\/1"]}],"id":[{"id":"10.13039\/100012338","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ana Leaf Foundation"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tit.2022.3189278","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T19:33:01Z","timestamp":1657654381000},"page":"8310-8341","source":"Crossref","is-referenced-by-count":0,"title":["Encoder Blind Combinatorial Compressed Sensing"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1838-8950","authenticated-orcid":false,"given":"Michael","family":"Murray","sequence":"first","affiliation":[{"name":"UCLA Department of Mathematics, UCLA, Los Angeles, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5561-9949","authenticated-orcid":false,"given":"Jared","family":"Tanner","sequence":"additional","affiliation":[{"name":"Mathematical Institute, University of Oxford, Oxford, U.K."}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755149"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313110"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394834"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797556"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927802"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.849172"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881263"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.03.001"},{"key":"ref28","first-page":"64","article-title":"On the complexity of an optimal non-blocking commutation scheme without reorganization","volume":"9","author":"bassalygo","year":"1973","journal-title":"Problems Inf Transmiss"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914730"},{"key":"ref29","first-page":"659","article-title":"Randomness conductors and constant-degree lossless expanders","author":"capalbo","year":"2002","journal-title":"Proc 17th IEEE Annu Conf Comput Complex"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00610-3"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/090748160"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1186\/s42490-019-0006-z"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290112"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632149"},{"key":"ref51","first-page":"584","article-title":"Provable bounds for learning some deep representations","volume":"32","author":"arora","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref53","first-page":"1","author":"doerr","year":"2020","journal-title":"Probabilistic Tools for the Analysis of Randomized Optimization Heuristics"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2806359"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref11","first-page":"1","article-title":"Efficient sparse coding algorithms","author":"lee","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-011-9598-6"},{"key":"ref12","first-page":"1033","article-title":"Supervised dictionary learning","author":"mairal","year":"2008","journal-title":"Proc 21st Int Conf Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025528"},{"key":"ref16","article-title":"On the coupon-collector’s problem with several parallel collections","author":"ferrante","year":"2016","journal-title":"arXiv 1609 04174"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1051\/ps\/2016016","article-title":"The coupon collector’s problem revisited: Generalizing the double dixie cup problem of Newman and Shepp","volume":"20","author":"doumas","year":"2016","journal-title":"ESAIM Probability and Statistics"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.2307\/1427566","article-title":"The collector’s problem with group drawings","volume":"22","author":"stadje","year":"1990","journal-title":"Advances in Applied Probability"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2018.00039"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-004-0162-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7"},{"journal-title":"Sparse and Redundant Representations From Theory to Applications in Signal and Image Processing","year":"2010","author":"elad","key":"ref7"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165821"},{"key":"ref46","first-page":"779","article-title":"New algorithms for learning incoherent and overcomplete dictionaries","volume":"35","author":"arora","year":"2014","journal-title":"Proc 27th Conf Learn Theory"},{"key":"ref45","article-title":"More algorithms for provable dictionary learning","author":"arora","year":"2014","journal-title":"arXiv 1401 0579"},{"key":"ref48","first-page":"1","article-title":"Exact recovery of sparsely-used dictionaries","volume":"23","author":"spielman","year":"2012","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746605"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206547"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614684"},{"journal-title":"A Tutorial on Subspace Clustering","year":"2010","author":"vidal","key":"ref43"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9961124\/09826825.pdf?arnumber=9826825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:12:20Z","timestamp":1670872340000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9826825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":53,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3189278","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}