{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:02:21Z","timestamp":1764687741604,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"16","license":[{"start":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T00:00:00Z","timestamp":1502755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"publisher","award":["N66001-15-C-4028","W911NF-14-1-0508"],"award-info":[{"award-number":["N66001-15-C-4028","W911NF-14-1-0508"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2017,8,15]]},"DOI":"10.1109\/tsp.2017.2706192","type":"journal-article","created":{"date-parts":[[2017,5,18]],"date-time":"2017-05-18T18:26:56Z","timestamp":1495132016000},"page":"4281-4292","source":"Crossref","is-referenced-by-count":23,"title":["On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits"],"prefix":"10.1109","volume":"65","author":[{"given":"Shahin","family":"Shahrampour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Noshad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahid","family":"Tarokh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14923-3_1"},{"key":"ref32","first-page":"217","article-title":"Optimal PAC\n multiple arm identification with applications to crowdsourcing","author":"zhou","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref31","first-page":"258","article-title":"Multiple identifications in multi-armed bandits","author":"bubeck","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref30","first-page":"655","article-title":"PAC subset selection in stochastic\n multi-armed bandits","author":"kalyanakrishnan","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2015.7317923"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2389620"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2550454"},{"key":"ref12","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"Proc 23rd Annu Conf Learn Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_18"},{"key":"ref14","first-page":"623","article-title":"The sample complexity of exploration in the multi-armed bandit problem","volume":"5","author":"mannor","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref15","first-page":"1079","article-title":"Action\n elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","volume":"7","author":"even-dar","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.059"},{"key":"ref18","first-page":"1238","article-title":"Almost\n optimal exploration in multi-armed bandits","author":"karnin","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref19","first-page":"3212","article-title":"Best arm identification: A unified approach to fixed budget and fixed confidence","author":"gabillon","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","article-title":"Simple Bayesian algorithms for best arm identification","author":"russo","year":"2016","journal-title":"Proc 29th Annu Conf Learn Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref27","first-page":"1","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"kaufmann","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"ref29","first-page":"511","article-title":"Efficient selection of multiple bandit arms: Theory and practice","author":"kalyanakrishnan","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49819-5_6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2263494"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2170684"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2302471"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref20","first-page":"590","article-title":"Tight (lower) bounds for the fixed budget best arm identification bandit problem","author":"carpentier","year":"2016","journal-title":"Proc 29th Annu Conf Learn Theory"},{"key":"ref22","first-page":"142","article-title":"Leveraging side observations in\n stochastic bandits","author":"caron","year":"2012","journal-title":"Proc 28th Conf Uncertainty Artif Intell"},{"key":"ref21","first-page":"684","article-title":"From bandits to experts: On the value of side-observations","author":"mannor","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"423","article-title":"lil’UCB: An optimal exploration\n algorithm for multi-armed bandits","author":"jamieson","year":"2014","journal-title":"Proceedings of The 27th Conference on Learning Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591989"},{"key":"ref26","first-page":"228","article-title":"Information complexity in bandit subset selection","author":"kaufmann","year":"2013","journal-title":"Proc Conf Learn Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7942328\/07931644.pdf?arnumber=7931644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:09Z","timestamp":1642004109000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7931644\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,15]]},"references-count":34,"journal-issue":{"issue":"16"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2017.2706192","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2017,8,15]]}}}