{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T06:04:43Z","timestamp":1779516283537,"version":"3.53.1"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Shanghai Institute for Mathematics and Interdisciplinary Sciences","award":["SIMIS-ID-2024-CN"],"award-info":[{"award-number":["SIMIS-ID-2024-CN"]}]},{"name":"Shanghai Institute for Mathematics and Interdisciplinary Sciences","award":["SIMISID-2024-WE"],"award-info":[{"award-number":["SIMISID-2024-WE"]}]},{"name":"Shanghai Sailing (Yangfan) Program","award":["24YF2702500"],"award-info":[{"award-number":["24YF2702500"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1109\/tit.2025.3559092","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:53:56Z","timestamp":1744206836000},"page":"4166-4186","source":"Crossref","is-referenced-by-count":0,"title":["Batched Stochastic Bandit for Nondegenerate Functions"],"prefix":"10.1109","volume":"72","author":[{"given":"Yu","family":"Liu","sequence":"first","affiliation":[{"name":"Center for Applied Mathematics, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunlu","family":"Shu","sequence":"additional","affiliation":[{"name":"Center for Applied Mathematics, 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":"Center for Applied Mathematics, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1979.tb01068.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1381"},{"key":"ref8","first-page":"503","article-title":"Batched multi-armed bandits problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Gao"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-3711-7"},{"key":"ref10","first-page":"19","article-title":"Stochastic simultaneous optimistic optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Valko"},{"key":"ref11","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","volume":"30","author":"Zhang"},{"key":"ref12","article-title":"Approximating Nash equilibria in normal-form games via stochastic optimization","volume-title":"Proc. 12th Int. Conf. Learn. Represent.","author":"Gemp"},{"key":"ref13","first-page":"1","article-title":"Low-rank bandit methods for high-dimensional dynamic pricing","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Mueller"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2280"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.0445"},{"key":"ref16","volume-title":"Principles of Microeconomics","volume":"1","author":"Mankiw","year":"1998"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01351342"},{"key":"ref18","volume-title":"Riemannian Geometry","volume":"171","author":"Petersen","year":"2006"},{"key":"ref19","first-page":"3","article-title":"On the complexity of bandit and derivative-free stochastic convex optimization","volume-title":"Proc. Conf. Learn. Theory","author":"Shamir"},{"key":"ref20","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":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"ref22","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":"ref23","first-page":"1655","article-title":"X-armed bandits","volume":"12","author":"Bubeck","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref24","first-page":"1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","volume-title":"Proc. 25th Conf. Learn. Theory","author":"Agrawal"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref29","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","volume":"3","author":"Auer","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref30","first-page":"345","article-title":"The price of bandit information for online optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"20","author":"Dani"},{"key":"ref31","first-page":"208","article-title":"Contextual bandits with linear payoff functions","volume-title":"Proc. 14th Int. Conf. Artif. Intell. Statist.","author":"Chu"},{"key":"ref32","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"24","author":"Abbasi-Yadkori"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182033"},{"key":"ref34","first-page":"253","article-title":"Gaussian process optimization with mutual information","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Contal"},{"key":"ref35","first-page":"3788","article-title":"Adaptive discretization for adversarial Lipschitz bandits","volume-title":"Proc. 34th Conf. Learn. Theory","volume":"134","author":"Podimata"},{"key":"ref36","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":"ref37","first-page":"6609","article-title":"Efficient pure exploration in adaptive round model","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Jin"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659957"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012992237273"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_33"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2019797"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_14"},{"key":"ref43","first-page":"975","article-title":"Lipschitz bandits: Regret lower bound and optimal algorithms","volume-title":"Proc. Conf. Learn. Theory","author":"Magureanu"},{"key":"ref44","first-page":"4154","article-title":"Optimal algorithms for Lipschitz bandits with heavy-tailed rewards","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lu"},{"issue":"1","key":"ref45","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":"ref46","first-page":"349","article-title":"Efficient contextual bandits with continuous actions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Majzoubi"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3312308"},{"key":"ref48","first-page":"2533","article-title":"Contextual bandits with similarity information","volume":"15","author":"Slivkins","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref49","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":"ref50","first-page":"139","article-title":"Top arm identification in multi-armed bandits with batch arm pulls","volume-title":"Proc. Artif. Intell. Statist.","author":"Jun"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00017"},{"key":"ref52","article-title":"Sequential batch learning in finite-action linear contextual bandits","author":"Han","year":"2020","journal-title":"arXiv:2004.06321"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00024"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16901"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451004"},{"key":"ref56","first-page":"92","article-title":"Gaussian process bandit optimization with few batches","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Li"},{"key":"ref57","article-title":"Batched dueling bandits","author":"Agarwal","year":"2022","journal-title":"arXiv:2202.10660"},{"key":"ref58","first-page":"5065","article-title":"Almost optimal anytime algorithm for batched multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jin"},{"key":"ref59","first-page":"2584","article-title":"Double explore-then-commit: Asymptotic optimality and beyond","volume-title":"Proc. Conf. Learn. Theory","author":"Jin"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.1302"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/23m1605405"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/140955483"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/16M1098759"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1137\/17M1116787"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/18M122457X"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/20M1348522"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/20M1312952"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2019.2921985"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0064610"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11534061\/10960481.pdf?arnumber=10960481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T05:09:48Z","timestamp":1779512988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10960481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":72,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3559092","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]}}}