{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:19:27Z","timestamp":1743038367958,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637346"},{"type":"electronic","value":"9783031637353"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63735-3_1","type":"book-chapter","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:02:07Z","timestamp":1721682127000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Model for\u00a0Optimizing Recalculation Schedules to\u00a0Minimize Regret"],"prefix":"10.1007","author":[{"given":"Bethany","family":"Austhof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lev","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"1_CR1","unstructured":"Abbasi-Yadkori, Y., P\u00e1l, D., Szepesv\u00e1ri, C.: Improved algorithms for linear stochastic bandits. In: Shawe-Taylor, J., Zemel, R.S., Bartlett, P.L., Pereira, F.C.N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held Granada, Spain, 12\u201314 December 2011, pp. 2312\u20132320 (2011)"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48\u201377 (2002)","journal-title":"SIAM J. Comput."},{"key":"1_CR3","unstructured":"Bhattacharjee, R., Imola, J., Moshkovitz, M., Dasgupta, S.: Online k-means clustering on arbitrary data streams. In: Agrawal, S., Orabona, F. (eds.) International Conference on Algorithmic Learning Theory, Singapore, 20\u201323 February 2023. Proceedings of Machine Learning Research, vol.\u00a0201, pp. 204\u2013236. PMLR (2023)"},{"key":"1_CR4","unstructured":"Bhattacharjee, R., Moshkovitz, M.: No-substitution k-means clustering with adversarial order. In: Feldman, V., Ligett, K., Sabato, S. (eds.) Algorithmic Learning Theory, Virtual Conference, Worldwide. Proceedings of Machine Learning Research, 16\u201319 March 2021, vol.\u00a0132, pp. 345\u2013366. PMLR (2021)"},{"key":"1_CR5","unstructured":"DeGroot, M.H.: Probability and Statistics (1986)"},{"key":"1_CR6","unstructured":"Dekel, O., Ding, J., Koren, T., Peres, Y.: Bandits with switching costs: T$${}^{\\text{2\/3}}$$ regret. In: Shmoys, D.B. (ed.) Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May\u201303 June 2014, pp. 459\u2013467. ACM (2014)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-9049-y","volume":"50","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D.: On the competitive ratio for online facility location. Algorithmica 50(1), 1\u201357 (2008)","journal-title":"Algorithmica"},{"key":"1_CR8","unstructured":"Hess, T., Moshkovitz, M., Sabato, S.: A constant approximation algorithm for sequential random-order no-substitution k-median clustering. In: Ranzato, M., Beygelzimer, A., Dauphin, Y.N., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, 6\u201314 December 2021, Virtual, pp. 3298\u20133308 (2021)"},{"key":"1_CR9","first-page":"1563","volume":"11","author":"T Jaksch","year":"2010","unstructured":"Jaksch, T., Ortner, R., Auer, P.: Near-optimal regret bounds for reinforcement learning. J. Mach. Learn. Res. 11, 1563\u20131600 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR10","unstructured":"Kash, I.A., Reyzin, L., Yu, Z.: Slowly changing adversarial bandit algorithms are provably efficient for discounted mdps. CoRR arxiv:2205.09056 (2022)"},{"issue":"1","key":"1_CR11","first-page":"96","volume":"20","author":"J Langford","year":"2007","unstructured":"Langford, J., Zhang, T.: The epoch-greedy algorithm for contextual multi-armed bandits. Adv. Neural. Inf. Process. Syst. 20(1), 96\u20131 (2007)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Machado, M.C., Bellemare, M.G., Talvitie, E., Veness, J., Hausknecht, M.J., Bowling, M.: Revisiting the arcade learning environment: evaluation protocols and open problems for general agents (extended abstract). In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018, pp. 5573\u20135577. ijcai.org (2018)","DOI":"10.24963\/ijcai.2018\/787"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, Las Vegas, Nevada, USA, 14\u201317 October 2001, pp. 426\u2013431. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959917"},{"key":"1_CR14","unstructured":"Moshkovitz, M.: Unexpected effects of online no-substitution k-means clustering. In: Feldman, V., Ligett, K., Sabato, S. (eds.) Algorithmic Learning Theory, Virtual Conference, Worldwide. Proceedings of Machine Learning Research, 16\u201319 March 2021, vol.\u00a0132, pp. 892\u2013930. PMLR (2021)"},{"key":"1_CR15","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT press, Cambridge (2018)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Tran-Thanh, L., Chapman, A., De\u00a0Cote, E.M., Rogers, A., Jennings, N.R.: Epsilon\u2013first policies for budget\u2013limited multi-armed bandits. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a024, pp. 1211\u20131216 (2010)","DOI":"10.1609\/aaai.v24i1.7758"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63735-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T16:07:16Z","timestamp":1732464436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63735-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637346","9783031637353"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63735-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Artificial Intelligence and Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 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":"isaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isaim2024.cs.ou.edu\/iwcia.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}