{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:37:42Z","timestamp":1770817062449,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-09-1-0140"],"award-info":[{"award-number":["FA9550-09-1-0140"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["CCF-1218189"],"award-info":[{"award-number":["CCF-1218189"]}]},{"name":"DARPA KECoM program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/tit.2014.2321552","type":"journal-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:08:04Z","timestamp":1399039684000},"page":"4001-4012","source":"Crossref","is-referenced-by-count":78,"title":["Near-Optimal Adaptive Compressed Sensing"],"prefix":"10.1109","volume":"60","author":[{"given":"Matthew L.","family":"Malloy","sequence":"first","affiliation":[]},{"given":"Robert D.","family":"Nowak","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","author":"frank","year":"2010","journal-title":"UCI Machine Learning Repository"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016892"},{"key":"ref32","author":"malloy","year":"2012","journal-title":"Near-optimal Compressive Binary Search"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/12-EJS686"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1972.10481257"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2012.6467011"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"key":"ref35","year":"2012","journal-title":"Microsoft Research Cambridge object recognition image database"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2011.6115845"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059891"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016018"},{"key":"ref12","article-title":"Adaptive sensing performance lower bounds for sparse signal estimation and testing","author":"castro","year":"2012","journal-title":"arXiv preprint arXiv 1206 0648"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190215"},{"key":"ref14","article-title":"Sequential testing for sparse recovery","author":"malloy","year":"2012","journal-title":"arXiv preprint arXiv 1212 1801"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2012.6319646"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495941"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162269"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034054"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2258071"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074574"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190214"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2009.5470144"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914730"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1142\/1936","author":"du","year":"1993","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2012.6319715"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2215837"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1119511109"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/DSP.2009.4786013"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2012.6489376"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.47"},{"key":"ref22","article-title":"lil'UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"2013","journal-title":"arXiv preprint arXiv 1312 7308"},{"key":"ref21","article-title":"On finding the largest mean among many","author":"jamieson","year":"0","journal-title":"Proc Conf Rec 47th Asilomar Conf Signals Syst and Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283595"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914345"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2009.5470138"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2187201"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6832684\/06809991.pdf?arnumber=6809991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:57:12Z","timestamp":1641988632000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6809991\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":38,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2321552","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}