{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:47:36Z","timestamp":1740181656443,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-193310"],"award-info":[{"award-number":["ECCS-193310"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Rensselaer-IBM Artificial Intelligence Research Collaboration Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/jsait.2023.3288988","type":"journal-article","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T17:34:36Z","timestamp":1687541676000},"page":"128-143","source":"Crossref","is-referenced-by-count":4,"title":["SPRT-Based Efficient Best Arm Identification in Stochastic Bandits"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5762-3247","authenticated-orcid":false,"given":"Arpan","family":"Mukherjee","sequence":"first","affiliation":[{"name":"Electrical, Computer, and Systems Engineering Department, Rensselaer Polytechnic Institute, Troy, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3513-4135","authenticated-orcid":false,"given":"Ali","family":"Tajer","sequence":"additional","affiliation":[{"name":"Electrical, Computer, and Systems Engineering Department, Rensselaer Polytechnic Institute, Troy, NY, USA"}]}],"member":"263","reference":[{"key":"ref13","first-page":"5810","article-title":"Fast pure exploration via frank-wolfe","author":"wang","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","first-page":"2432","article-title":"Gamification of pure exploration for linear bandits","author":"degenne","year":"2020","journal-title":"Proc 37th Int Conf Mach Learn"},{"key":"ref15","first-page":"1079","article-title":"Action 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":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref31","article-title":"SPRT-based efficient best arm identification in stochastic bandits","author":"mukherjee","year":"2022","journal-title":"arXiv 2207 11158"},{"key":"ref30","first-page":"1","article-title":"Mixture martingales revisited with applications to sequential tests and confidence intervals","volume":"22","author":"kaufmann","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref11","first-page":"14465","article-title":"Non-asymptotic pure exploration by solving games","author":"degenne","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","article-title":"Non-asymptotic analysis of a UCB-based top two algorithm","author":"jourdan","year":"2022","journal-title":"arXiv 2210 05431"},{"key":"ref10","first-page":"10007","article-title":"Optimal best-arm identification in linear bandits","author":"jedra","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0044-x"},{"key":"ref2","first-page":"365","article-title":"On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning","author":"hoffman","year":"2014","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref17","first-page":"828","article-title":"Best-arm identification in linear bandits","author":"soare","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref16","first-page":"10666","article-title":"Sequential experimental design for transductive linear bandits","author":"fiez","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","first-page":"61","article-title":"Optimal ?-correct best-arm selection for heavy-tailed distributions","author":"agrawal","year":"2020","journal-title":"Proc Int Conf Algorithmic Learn Theory"},{"key":"ref18","first-page":"4877","article-title":"Best arm identification in linear bandits with linear dimension dependency","author":"tao","year":"2018","journal-title":"Proc Int Conf Machine Learning"},{"key":"ref24","first-page":"5381","article-title":"Improving the expected improvement algorithm","author":"qin","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","first-page":"39","article-title":"Analysis of thompson sampling for the multi-armed bandit problem","author":"agarwal","year":"2012","journal-title":"Proc Annu Conf Learn Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731118"},{"key":"ref25","first-page":"1823","article-title":"Fixed-confidence guarantees for Bayesian best-arm identification","author":"shang","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1911"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2514700"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1029060"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834534"},{"key":"ref29","first-page":"26791","article-title":"Top two algorithms revisited","author":"jourdan","year":"2022","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","first-page":"423","article-title":"lil’ UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref7","first-page":"843","article-title":"A fully adaptive algorithm for pure exploration in linear bandits","author":"xu","year":"2018","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref9","first-page":"1238","article-title":"Almost optimal exploration in multi-armed bandits","author":"karnin","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","first-page":"3221","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":"ref3","first-page":"10371","article-title":"An empirical process approach to the union bound: Practical algorithms for combinatorial and linear bandits","author":"katz-samuels","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","first-page":"998","article-title":"Optimal best arm identification with fixed confidence","author":"garivier","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref5","first-page":"655","article-title":"PAC subset selection in stochastic multi-armed bandits","author":"kalyanakrishnan","year":"2012","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10153947\/10160206-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10153947\/10160206.pdf?arnumber=10160206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T00:14:53Z","timestamp":1707869693000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10160206\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/jsait.2023.3288988","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2023]]}}}