{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T23:07:52Z","timestamp":1754262472012,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777518"},{"type":"electronic","value":"9789819777525"}],"license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-97-7752-5_1","type":"book-chapter","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:04:59Z","timestamp":1735380299000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Problem of\u00a0Best Arm Retention"],"prefix":"10.1007","author":[{"given":"Houshuang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchen","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chihao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,29]]},"reference":[{"key":"1_CR1","unstructured":"Assadi, S., Wang, C.: Single-pass streaming lower bounds for multi-armed bandits exploration with instance-sensitive sample complexity. In: Proceedings of the 35th Annual Conference on Neural Information Processing Systems (NeurIPS) (2022)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Audibert, J., Bubeck, S., Munos, R.: Best arm identification in multi-armed bandits. In: Proceedings of the 23th Conference on Learning Theory (COLT) (2010)","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bubeck, S., Munos, R., Stoltz, G.: Pure exploration in multi-armed bandits problems. In: Proceedings of the 20th International Conference on Algorithmic Learning Theory (ALT) (2009)","DOI":"10.1007\/978-3-642-04414-4_7"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1287\/IJOC.1080.0268","volume":"20","author":"CH Chen","year":"2008","unstructured":"Chen, C.H., He, D., Fu, M., Lee, L.H.: Efficient simulation budget allocation for selecting an optimal subset. INFORMS J. Comput. 20(4), 579\u2013595 (2008). https:\/\/doi.org\/10.1287\/IJOC.1080.0268","journal-title":"INFORMS J. Comput."},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Chen, H., He, Y., Zhang, C.: On interpolating experts and multi-armed bandits. arXiv preprint arXiv:2307.07264 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2307.07264","DOI":"10.48550\/ARXIV.2307.07264"},{"key":"1_CR6","unstructured":"Chen, L., Li, J., Qiao, M.: Towards instance optimal bounds for best arm identification. In: Proceedings of the 30th Conference on Learning Theory (COLT) (2017)"},{"key":"1_CR7","unstructured":"Chen, S., Lin, T., King, I., Lyu, M.R., Chen, W.: Combinatorial pure exploration of multi-armed bandits. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems (NeurIPS) (2014)"},{"key":"1_CR8","unstructured":"Degenne, R., M\u00e9nard, P., Shang, X., Valko, M.: Gamification of pure exploration for linear bandits. In: Proceedings of the 37th International Conference on Machine Learning (ICML) (2020)"},{"key":"1_CR9","first-page":"1079","volume":"7","author":"E Even-Dar","year":"2006","unstructured":"Even-Dar, E., Mannor, S., Mansour, Y.: Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. J. Mach. Learn. Res. 7, 1079\u20131105 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR10","unstructured":"Fiez, T., Jain, L., Jamieson, K.G., Ratliff, L.: Sequential experimental design for transductive linear bandits. In: Proceedings of the 32th Annual Conference on Neural Information Processing Systems (NeurIPS) (2019)"},{"key":"1_CR11","unstructured":"Garivier, A., Kaufmann, E.: Optimal best arm identification with fixed confidence. In: Proceedings of the 29th Conference on Learning Theory (COLT) (2016)"},{"key":"1_CR12","unstructured":"He, Y., Ye, Z., Zhang, C.: Understanding memory-regret trade-off for streaming stochastic multi-armed bandits. arXiv preprint arXiv:2405.19752 (2024)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.3150\/21-BEJ1388","volume":"28","author":"SR Howard","year":"2022","unstructured":"Howard, S.R., Ramdas, A.: Sequential estimation of quantiles with applications to A\/B testing and best-arm identification. Bernoulli 28(3), 1704\u20131728 (2022)","journal-title":"Bernoulli"},{"key":"1_CR14","unstructured":"Jamieson, K., Malloy, M., Nowak, R., Bubeck, S.: lil\u2019UCB: an optimal exploration algorithm for multi-armed bandits. In: Proceedings of the 27th Conference on Learning Theory (COLT) (2014)"},{"key":"1_CR15","unstructured":"Jourdan, M., Degenne, R., Kaufmann, E.: An $$\\varepsilon $$-best-arm identification algorithm for fixed-confidence and beyond. In: Proceedings of the 36th Annual Conference on Neural Information Processing Systems (NeurIPS) (2023)"},{"key":"1_CR16","unstructured":"Kalyanakrishnan, S., Stone, P.: Efficient selection of multiple bandit arms: theory and practice. In: Proceedings of the 27th International Conference on Machine Learning (ICML) (2010)"},{"key":"1_CR17","unstructured":"Kalyanakrishnan, S., Tewari, A., Auer, P., Stone, P.: Pac subset selection in stochastic multi-armed bandits. In: Proceedings of the 29th International Conference on Machine Learning (ICML) (2012)"},{"key":"1_CR18","unstructured":"Karnin, Z., Koren, T., Somekh, O.: Almost optimal exploration in multi-armed bandits. In: Proceedings of the 30th International Conference on Machine Learning (ICML) (2013)"},{"key":"1_CR19","first-page":"1","volume":"17","author":"E Kaufmann","year":"2016","unstructured":"Kaufmann, E., Capp\u00e9, O., Garivier, A.: On the complexity of best arm identification in multi-armed bandit models. J. Mach. Learn. Res. 17, 1\u201342 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Kone, C., Kaufmann, E., Richert, L.: Bandit pareto set identification: the fixed budget setting. arXiv preprint arXiv:2311.03992 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2311.03992","DOI":"10.48550\/ARXIV.2311.03992"},{"key":"1_CR21","unstructured":"Lattimore, T., Gyorgy, A.: Mirror descent and the information ratio. In: Proceedings of the 34th Conference on Learning Theory (COLT) (2021)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press, Cambridge (2020)","DOI":"10.1017\/9781108571401"},{"key":"1_CR23","unstructured":"Locatelli, A., Gutzeit, M., Carpentier, A.: An optimal algorithm for the thresholding bandit problem. In: Proceedings of the 33th International Conference on Machine Learning (ICML) (2016)"},{"key":"1_CR24","first-page":"623","volume":"5","author":"S Mannor","year":"2004","unstructured":"Mannor, S., Tsitsiklis, J.N.: The sample complexity of exploration in the multi-armed bandit problem. J. Mach. Learn. Res. 5, 623\u2013648 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR25","unstructured":"Mason, B., Jain, L., Tripathy, A., Nowak, R.: Finding all $$\\epsilon $$-good arms in stochastic bandits. In: Proceedings of the 33th Annual Conference on Neural Information Processing Systems (NeurIPS) (2020)"},{"issue":"5","key":"1_CR26","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"58","author":"H Robbins","year":"1952","unstructured":"Robbins, H.: Some aspects of the sequential design of experiments. Bull. Am. Math. Soc. 58(5), 527\u2013535 (1952)","journal-title":"Bull. Am. Math. Soc."},{"key":"1_CR27","unstructured":"Russo, D.: Simple Bayesian algorithms for best arm identification. In: Proceedings of the 29th Conference on Learning Theory (COLT) (2016)"},{"key":"1_CR28","volume-title":"Sequential Analysis: Tests and Confidence Intervals","author":"D Siegmund","year":"2013","unstructured":"Siegmund, D.: Sequential Analysis: Tests and Confidence Intervals. Springer, Heidelberg (2013)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Simchi-Levi, D., Wang, C., Xu, J.: On experimentation with heterogeneous subgroups: An asymptotic optimal $$\\delta $$-weighted-PAC design. Available at SSRN 4721755 (2024)","DOI":"10.2139\/ssrn.4721755"},{"key":"1_CR30","unstructured":"Simchowitz, M., Jamieson, K., Recht, B.: The simulator: understanding adaptive sampling in the moderate-confidence regime. In: Proceedings of the 30th Conference on Learning Theory (COLT) (2017)"},{"key":"1_CR31","first-page":"137","volume":"4","author":"F Tops\u00f8e","year":"2007","unstructured":"Tops\u00f8e, F.: Some bounds for the logarithmic function. Inequality Theory Appl. 4, 137 (2007)","journal-title":"Inequality Theory Appl."},{"key":"1_CR32","unstructured":"Wang, P.A., Tzeng, R.C., Proutiere, A.: Fast pure exploration via frank-wolfe. In: Proceedings of the 34th Annual Conference on Neural Information Processing Systems (NeurIPS) (2021)"},{"key":"1_CR33","unstructured":"You, W., Qin, C., Wang, Z., Yang, S.: Information-directed selection for top-two algorithms. In: Proceedings of the 36th Conference on Learning Theory (COLT) (2023)"},{"key":"1_CR34","unstructured":"Zhao, Y., Stephens, C., Szepesv\u00e1ri, C., Jun, K.S.: Revisiting simple regret: fast rates for returning a good arm. In: Proceedings of the 40th International Conference on Machine Learning (ICML) (2023)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7752-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T11:02:56Z","timestamp":1735383776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7752-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"ISBN":["9789819777518","9789819777525"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7752-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,29]]},"assertion":[{"value":"29 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}