{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:17:58Z","timestamp":1777130278553,"version":"3.51.4"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849327","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2544-2548","source":"Crossref","is-referenced-by-count":10,"title":["Overlapping Multi-Bandit Best Arm Identification"],"prefix":"10.1109","author":[{"given":"Jonathan","family":"Scarlett","sequence":"first","affiliation":[{"name":"National University of Singapore"}]},{"given":"Ilija","family":"Bogunovic","sequence":"additional","affiliation":[{"name":"LIONS, EPFL"}]},{"given":"Volkan","family":"Cevher","sequence":"additional","affiliation":[{"name":"LIONS, EPFL"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"Conf Learning Theory (COLT)"},{"key":"ref11","article-title":"Multiple identifications in multi-armed bandits","author":"bubeck","year":"2013","journal-title":"Proc Int Conf Machine Learn (ICML)"},{"key":"ref12","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref14","article-title":"PAC subset selection in stochastic multi-armed bandits","author":"kalyanakrishnan","year":"2012","journal-title":"Proc Int Conf Machine Learn (ICML)"},{"key":"ref15","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 (JMLR)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref17","article-title":"Nearly instance optimal sample complexity bounds for top-k arm selection","author":"chen","year":"2017"},{"key":"ref18","article-title":"Practical algorithms for best-k identifi-cation in multi-armed bandits","author":"jiang","year":"2017"},{"key":"ref19","article-title":"Overlapping multi-bandit best arm identification (technical report)","author":"scarlett","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref6","first-page":"2222","article-title":"Multi-bandit best arm identification","author":"gabillon","year":"2011","journal-title":"Conf Neur Inf Proc Sys (NIPS)"},{"key":"ref5","first-page":"974","article-title":"Portfolio choices with orthogonal bandit learning","volume":"15","author":"shen","year":"2015","journal-title":"Int Joint Conf Art Intel (IJCAI)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1561\/9781601986276","author":"bubeck","year":"2012","journal-title":"Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems ser Found Trend Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/14-STS504"},{"key":"ref1","author":"lattimore","year":"0","journal-title":"Bandit Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_18"},{"key":"ref20","first-page":"1839","article-title":"Adaptive sampling for coarse ranking","author":"katariya","year":"2018","journal-title":"Int Conf Art Intel Stats (AISTATS)"},{"key":"ref21","article-title":"lil’UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"2014","journal-title":"Conf Learn Theory (COLT)"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849327.pdf?arnumber=8849327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:09Z","timestamp":1773347649000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849327","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}