{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:30:37Z","timestamp":1757622637066,"version":"3.44.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864859"},{"type":"electronic","value":"9783030864866"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86486-6_1","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T15:25:48Z","timestamp":1631201148000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Routine Bandits: Minimizing Regret on\u00a0Recurring Problems"],"prefix":"10.1007","author":[{"given":"Hassan","family":"Saber","sequence":"first","affiliation":[]},{"given":"L\u00e9o","family":"Saci","sequence":"additional","affiliation":[]},{"given":"Odalric-Ambrym","family":"Maillard","sequence":"additional","affiliation":[]},{"given":"Audrey","family":"Durand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"key":"1_CR1","unstructured":"Abbasi-Yadkori, Y., P\u00e1l, D., Szepesv\u00e1ri, C.: Improved algorithms for linear stochastic bandits. In: Advances in Neural Information Processing Systems, pp. 2312\u20132320 (2011)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Teneketzis, D., Anantharam, V.: Asymptotically efficient adaptive allocation schemes for controlled IID processes: finite parameter space. IEEE Trans. Autom. Control 34(3) (1989)","DOI":"10.1109\/9.16415"},{"key":"1_CR3","unstructured":"Anandkumar, A., Ge, R., Hsu, D., Kakade, S.: A tensor spectral approach to learning mixed membership community models. In: Conference on Learning Theory, pp. 867\u2013881. PMLR (2013)"},{"issue":"1","key":"1_CR4","first-page":"2773","volume":"15","author":"A Anandkumar","year":"2014","unstructured":"Anandkumar, A., Ge, R., Hsu, D.J., Kakade, S.M., Telgarsky, M.: Tensor decompositions for learning latent variable models. J. Mach. Learn. Res. 15(1), 2773\u20132832 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends in Machine Learning abs\/1204.5721 (2012). http:\/\/arxiv.org\/abs\/1204.5721","DOI":"10.1561\/9781601986276"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Saber, H., Saci, L., Maillard, O.A., Durand, A.: Routine bandits: minimizing regret on recurring problems. hal-03286539 (2021). https:\/\/hal.archives-ouvertes.fr\/hal-03286539","DOI":"10.1007\/978-3-030-86486-6_1"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1214\/13-AOS1119","volume":"41","author":"O Capp\u00e9","year":"2013","unstructured":"Capp\u00e9, O., Garivier, A., Maillard, O.A., Munos, R., Stoltz, G.: Kullback- Leibler upper confidence bounds for optimal sequential allocation. Ann. Stat. 41(3), 1516\u20131541 (2013)","journal-title":"Ann. Stat."},{"key":"1_CR8","unstructured":"Combes, R., Proutiere, A.: Unimodal bandits: regret lower bounds and optimal algorithms. In: Proceedings of the 31st International Conference on Machine Learning (ICML), pp. 521\u2013529 (2014)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Garivier, A.: Informational confidence bounds for self-normalized averages and applications. In: 2013 IEEE Information Theory Workshop (ITW), pp. 1\u20135. IEEE (2013)","DOI":"10.1109\/ITW.2013.6691311"},{"key":"1_CR10","unstructured":"Garivier, A., Capp\u00e9, O.: The KL-UCB algorithm for bounded stochastic bandits and beyond. In: Proceedings of the 24th Annual Conference on Learning Theory (COLT), pp. 359\u2013376 (2011)"},{"key":"1_CR11","unstructured":"Gentile, C., Li, S., Zappella, G.: Online clustering of bandits. In: Proceedings of the ICML, pp. 757\u2013765 (2014)"},{"key":"1_CR12","unstructured":"Gheshlaghi Azar, M., Lazaric, A., Brunskill, E.: Sequential transfer in multi-armed bandit with finite set of models. In: Proceedings of the NIPS, pp. 2220\u20132228. Curran Associates, Inc. (2013)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1137\/S0363012994275440","volume":"35","author":"TL Graves","year":"1997","unstructured":"Graves, T.L., Lai, T.L.: Asymptotically efficient adaptive choice of control laws in controlled Markov chains. SIAM J. Control. Optim. 35(3), 715\u2013743 (1997)","journal-title":"SIAM J. Control. Optim."},{"key":"1_CR14","unstructured":"Honda, J., Takemura, A.: An asymptotically optimal bandit algorithm for bounded support models. In: Proceedings of the 23rd Annual Conference on Learning Theory, Haifa, Israel (2010)"},{"key":"1_CR15","unstructured":"Korda, N., Kaufmann, E., Munos, R.: Thompson sampling for 1-dimensional exponential family bandits. In: Advances in Neural Information Processing Systems (NIPS), pp. 1448\u20131456 (2013)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Lai, T.L.: Adaptive treatment allocation and the multi-armed bandit problem. Ann. Stat. 1091\u20131114 (1987)","DOI":"10.1214\/aos\/1176350495"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"TL Lai","year":"1985","unstructured":"Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4\u201322 (1985)","journal-title":"Adv. Appl. Math."},{"key":"1_CR18","unstructured":"Langford, J., Zhang, T.: The Epoch-Greedy algorithm for multi-armed bandits with side information. In: Platt, J.C., et al. (eds.) NIPS. MIT Press (2007)"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401","volume-title":"Bandit Algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press, Cambridge (2020)"},{"key":"1_CR20","unstructured":"Lu, T., P\u00e1l, D., P\u00e1l, M.: Contextual multi-armed bandits. In: Teh, Y.W., Titterington, M. (eds.) Proceedings of the 13th International Conference on Artificial Intelligence and Statistics, vol. 9, pp. 485\u2013492 (2010)"},{"key":"1_CR21","unstructured":"Maillard, O.A., Mannor, S.: Latent bandits. In: International Conference on Machine Learning (ICML) (2014)"},{"key":"1_CR22","volume-title":"Self-normalized Processes: Limit Theory and Statistical Applications","author":"VH Pe\u00f1a","year":"2008","unstructured":"Pe\u00f1a, V.H., Lai, T.L., Shao, Q.M.: Self-normalized Processes: Limit Theory and Statistical Applications. Springer, Heidelberg (2008)"},{"issue":"5","key":"1_CR23","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_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"W Thompson","year":"1933","unstructured":"Thompson, W.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25, 285\u2013294 (1933)","journal-title":"Biometrika"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86486-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T22:05:28Z","timestamp":1757369128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86486-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864859","9783030864866"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86486-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"869","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"210","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}