{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:11:53Z","timestamp":1780053113013,"version":"3.54.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020AAA0107600"],"award-info":[{"award-number":["2020AAA0107600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276066"],"award-info":[{"award-number":["62276066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U2241212"],"award-info":[{"award-number":["U2241212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tit.2023.3312308","type":"journal-article","created":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T17:43:15Z","timestamp":1693935795000},"page":"2154-2176","source":"Crossref","is-referenced-by-count":2,"title":["Lipschitz Bandits With Batched Feedback"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-8274-3560","authenticated-orcid":false,"given":"Yasong","family":"Feng","sequence":"first","affiliation":[{"name":"Shanghai Center for Mathematical Sciences, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2671-7483","authenticated-orcid":false,"given":"Zengfeng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Data Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6206-8359","authenticated-orcid":false,"given":"Tianyu","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Center for Mathematical Sciences, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"39","article-title":"Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons","volume-title":"Proc. Conf. Learn. Theory","author":"Agarwal"},{"key":"ref2","first-page":"89","article-title":"Batched dueling bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Agarwal"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012992237273"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2307\/1427934"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.1997"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_33"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0427"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700058"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0064610"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref14","first-page":"201","article-title":"Online optimization in X-armed bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"22","author":"Bubeck"},{"issue":"5","key":"ref15","first-page":"1655","article-title":"X-armed bandits","volume":"12","author":"Bubeck","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_14"},{"key":"ref17","first-page":"1160","article-title":"Online learning with switching costs and other adaptive adversaries","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Cesa-Bianchi"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2019797"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16901"},{"key":"ref20","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":"ref21","article-title":"A Lipschitz bandits approach for continuous hyperparameter optimization","author":"Feng","year":"2023","journal-title":"arXiv:2302.01539"},{"key":"ref22","first-page":"503","article-title":"Batched multi-armed bandits problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Gao"},{"key":"ref23","article-title":"From random search to bandit learning in metric measure spaces","author":"Han","year":"2023","journal-title":"arXiv:2305.11509"},{"key":"ref24","article-title":"Sequential batch learning in finite-action linear contextual bandits","author":"Han","year":"2020","journal-title":"arXiv:2004.06321"},{"key":"ref25","first-page":"139","article-title":"Top arm identification in multi-armed bandits with batch arm pulls","volume-title":"Artificial Intelligence and Statistics","author":"Jun"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00024"},{"key":"ref27","first-page":"697","article-title":"Nearly tight bounds for the continuum-armed bandit problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"18","author":"Kleinberg"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"issue":"1","key":"ref29","first-page":"5402","article-title":"Contextual bandits with continuous actions: Smoothing, zooming, and adapting","volume":"21","author":"Krishnamurthy","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref31","first-page":"92","article-title":"Gaussian process bandit optimization with few batches","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Li"},{"key":"ref32","first-page":"4154","article-title":"Optimal algorithms for Lipschitz bandits with heavy-tailed rewards","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lu"},{"key":"ref33","first-page":"975","article-title":"Lipschitz bandits: Regret lower bound and optimal algorithms","volume-title":"Proc. Conf. Learn. Theory","author":"Magureanu"},{"key":"ref34","first-page":"349","article-title":"Efficient contextual bandits with continuous actions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Majzoubi"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1101"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1381"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/64.2.191"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451004"},{"key":"ref39","first-page":"28836","article-title":"A domain-shrinking based Bayesian optimization algorithm with order-optimal regret performance","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Salgia"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.13140\/RG.2.2.18893.74727"},{"key":"ref41","first-page":"3858","article-title":"Adaptive discretization for model-based reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Sinclair"},{"key":"ref42","first-page":"2533","article-title":"Contextual bandits with similarity information","volume":"15","author":"Slivkins","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref43","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00017"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref46","first-page":"9996","article-title":"Bandits for BMO functions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3412815.3416885"},{"key":"ref48","first-page":"14684","article-title":"Nonparametric contextual bandits in an unknown metric space","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Wanigasekara"},{"key":"ref49","first-page":"9818","article-title":"Inference for batched bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhang"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10438985\/10239433.pdf?arnumber=10239433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T04:35:41Z","timestamp":1725165341000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10239433\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":49,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3312308","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}