{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:45Z","timestamp":1740131685949,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["NeTS 1817205"],"award-info":[{"award-number":["NeTS 1817205"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1109\/tit.2023.3274678","type":"journal-article","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T11:28:50Z","timestamp":1683718130000},"page":"5956-5970","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotic Performance of Thompson Sampling for Batched Multi-Armed Bandits"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6110-5058","authenticated-orcid":false,"given":"Cem","family":"Kalkanl\u0131","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4455-4692","authenticated-orcid":false,"given":"Ayfer","family":"\u00d6zg\u00fcr","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/17-EJS1341SI"},{"key":"ref35","first-page":"1417","article-title":"Simple Bayesian algorithms for best arm identification","author":"russo","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref12","first-page":"1448","article-title":"Thompson sampling for 1-dimensional exponential family bandits","author":"korda","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref15","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","author":"agrawal","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3088510"},{"key":"ref31","first-page":"1","article-title":"Batched Thompson sampling","volume":"34","author":"kalkanli","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","first-page":"10535","article-title":"Parallelizing Thompson sampling","volume":"34","author":"karbasi","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"ref33","volume":"47","author":"vershynin","year":"2018","journal-title":"High-Dimensional Probability An Introduction with Applications in Data Science"},{"key":"ref10","first-page":"2249","article-title":"An empirical evaluation of Thompson sampling","author":"chapelle","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"The Stolz-Cesaro Theorem","year":"2022","author":"nagy","key":"ref32"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517843"},{"key":"ref17","first-page":"844","article-title":"On kernelized multi-armed bandits","author":"chowdhury","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref16","first-page":"1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"2012","journal-title":"Proc Conf Learn Theory Workshop Conf"},{"key":"ref19","first-page":"2442","article-title":"An information-theoretic analysis of Thompson sampling","volume":"17","author":"russo","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref24","article-title":"Linear bandits with limited adaptivity and learning distributional optimal design","author":"ruan","year":"2020","journal-title":"arXiv 2007 01980"},{"key":"ref23","article-title":"Sequential batch learning in finite-action linear contextual bandits","author":"han","year":"2020","journal-title":"arXiv 2004 06321"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3047601"},{"key":"ref25","article-title":"Dynamic batch learning in high-dimensional sparse linear contextual bandits","author":"ren","year":"2020","journal-title":"arXiv 2008 11918"},{"key":"ref20","first-page":"1","article-title":"An information-theoretic analysis for Thompson sampling with many actions","volume":"31","author":"dong","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1193"},{"key":"ref21","first-page":"5065","article-title":"Almost optimal anytime algorithm for batched multi-armed bandits","author":"jin","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref27","first-page":"1160","article-title":"Online learning with switching costs and other adaptive adversaries","author":"cesa-bianchi","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","first-page":"133","article-title":"Parallelised Bayesian optimisation via Thompson sampling","author":"kandasamy","year":"2018","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref8","article-title":"Regret bounds for batched bandits","author":"esfandiari","year":"2019","journal-title":"arXiv 1910 04959"},{"key":"ref7","first-page":"503","article-title":"Batched multi-armed bandits problem","author":"gao","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","article-title":"Double explore-then-commit: Asymptotic optimality and beyond","author":"jin","year":"2020","journal-title":"arXiv 2002 09174"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.2016.1023"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1381"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10225323\/10122158-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10225323\/10122158.pdf?arnumber=10122158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T18:02:18Z","timestamp":1694455338000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10122158\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":35,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3274678","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,9]]}}}