{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:17Z","timestamp":1740108257349,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00186-022-00769-x","type":"journal-article","created":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T07:02:58Z","timestamp":1655276578000},"page":"161-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A PAC algorithm in relative precision for bandit problem with costly sampling"],"prefix":"10.1007","volume":"96","author":[{"given":"Marie Billaud","family":"Friess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4790-5953","authenticated-orcid":false,"given":"Arthur","family":"Macherey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Nouy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e9mentine","family":"Prieur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"769_CR1","unstructured":"Audibert JY, Bubeck S, Munos R (2010) Best arm identification in multi-armed bandits. In: Annual conference on learning theory (COLT)"},{"key":"769_CR2","doi-asserted-by":"crossref","unstructured":"Audibert JY, Bubeck S, Munos R (2011) Bandit view on noisy optimization. Optim Mach Learn 431","DOI":"10.7551\/mitpress\/8996.003.0018"},{"issue":"19","key":"769_CR3","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1016\/j.tcs.2009.01.016","volume":"410","author":"JY Audibert","year":"2009","unstructured":"Audibert JY, Munos R, Szepesv\u00e1ri C (2009) Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theoret Comput Sci 410(19):1876\u20131902","journal-title":"Theoret Comput Sci"},{"issue":"33\u201334","key":"769_CR4","doi-asserted-by":"publisher","first-page":"3190","DOI":"10.1016\/j.cma.2007.03.003","volume":"196","author":"HG Beyer","year":"2007","unstructured":"Beyer HG, Sendhoff B (2007) Robust optimization\u2014a comprehensive survey. Comput Methods Appl Mech Eng 196(33\u201334):3190\u20133218","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"19","key":"769_CR5","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.tcs.2010.12.059","volume":"412","author":"S Bubeck","year":"2011","unstructured":"Bubeck S, Munos R, Stoltz G (2011) Pure exploration in finitely-armed and continuous-armed bandits. Theoret Comput Sci 412(19):1832\u20131852","journal-title":"Theoret Comput Sci"},{"issue":"1","key":"769_CR6","first-page":"1","volume":"1","author":"V Dupa","year":"1982","unstructured":"Dupa V, Herkenrath U (1982) Stochastic approximation on a discrete set and the multi-armed. Seq Anal 1(1):1\u201325","journal-title":"Seq Anal"},{"key":"769_CR7","doi-asserted-by":"crossref","unstructured":"Even-Dar E, Mannor S, Mansour Y (2002) Pac bounds for multi-armed bandit and Markov decision processes. In: International conference on computational learning theory. Springer, pp 255\u2013270 (2002)","DOI":"10.1007\/3-540-45435-7_18"},{"key":"769_CR8","unstructured":"Garivier A, Capp\u00e9 O (2011) The KL-UCB algorithm for bounded stochastic bandits and beyond. In: Proceedings of the 24th annual conference on learning theory, pp 359\u2013376"},{"issue":"2","key":"769_CR9","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/S1052623495290684","volume":"1","author":"WB Gong","year":"2000","unstructured":"Gong WB, Ho YC, Zhai W (2000) Stochastic comparison algorithm for discrete optimization with estimation. SIAM J Optim 1(2):384\u2013404","journal-title":"SIAM J Optim"},{"key":"769_CR10","unstructured":"Kalyanakrishnan S, Tewari A, Auer P, Stone P (2012) Pac subset selection in stochastic multi-armed bandits. In: ICML, vol\u00a012, pp 655\u2013662"},{"issue":"5","key":"769_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10994-019-05784-4","volume":"108","author":"H Kano","year":"2019","unstructured":"Kano H, Honda J, Sakamaki K, Matsuura K, Nakamura A, Sugiyama M (2019) Good arm identification via bandit feedback. Mach Learn 108(5):721\u2013745","journal-title":"Mach Learn"},{"issue":"1","key":"769_CR12","first-page":"1","volume":"17","author":"E Kaufmann","year":"2016","unstructured":"Kaufmann E, Capp\u00e9 O, Garivier A (2016) On the complexity of best-arm identification in multi-armed bandit models. J Mach Learn Res 17(1):1\u201342","journal-title":"J Mach Learn Res"},{"key":"769_CR13","unstructured":"Kaufmann E, Kalyanakrishnan S (2013) Information complexity in bandit subset selection. In: Conference on learning theory. PMLR, pp 228\u2013251"},{"key":"769_CR14","unstructured":"Kuleshov V, Precup D (2014) Algorithms for multi-armed bandit problems. arXiv preprint arXiv:1402.6028"},{"key":"769_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401","volume-title":"Bandit algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore T, Szepesv\u00e1ri C (2020) Bandit algorithms. Cambridge University Press, Cambridge"},{"key":"769_CR16","unstructured":"Locatelli A, Gutzeit M, Carpentier A (2016) An optimal algorithm for the thresholding bandit problem. International Conference on Machine Learning, 1690\u20131698"},{"key":"769_CR17","unstructured":"Mnih V (2008) Efficient stopping rules. Ph.D. thesis, University of Alberta"},{"key":"769_CR18","doi-asserted-by":"crossref","unstructured":"Mnih V, Szepesv\u00e1ri C, Audibert JY (2008) Empirical Bernstein stopping. In: Proceedings of the 25th international conference on Machine learning, pp 672\u2013679","DOI":"10.1145\/1390156.1390241"},{"key":"769_CR19","doi-asserted-by":"crossref","unstructured":"Mukherjee S, Naveen KP, Sudarsanam N, Ravindran B (2017) Thresholding bandits with augmented UCB. International Joint Conference on Artificial Intelligence.","DOI":"10.24963\/ijcai.2017\/350"},{"issue":"4","key":"769_CR20","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J Optim 19(4):1574\u20131609","journal-title":"SIAM J Optim"},{"key":"769_CR21","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction. MIT Press, Cambridge"},{"key":"769_CR22","unstructured":"Tao C, Blanco S, Peng J, Zhou Y (2019)Thresholding bandit with optimal aggregate regret. In: Advances in neural information processing systems, pp 11664\u201311673"},{"issue":"3","key":"769_CR23","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0330034","volume":"30","author":"D Yan","year":"1992","unstructured":"Yan D, Mukai H (1992) Stochastic discrete optimization. SIAM J Control Optim 30(3):594\u2013612","journal-title":"SIAM J Control Optim"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00769-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-022-00769-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00769-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T05:19:02Z","timestamp":1700716742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-022-00769-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["769"],"URL":"https:\/\/doi.org\/10.1007\/s00186-022-00769-x","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2022,6,15]]},"assertion":[{"value":"21 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}