{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:42:54Z","timestamp":1777873374353,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3737097","type":"proceedings-article","created":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T13:30:13Z","timestamp":1754055013000},"page":"567-578","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Quick Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3593-5255","authenticated-orcid":false,"given":"Derek","family":"Everett","sequence":"first","affiliation":[{"name":"Booz Allen Hamilton, McLean, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1026-5734","authenticated-orcid":false,"given":"Fred","family":"Lu","sequence":"additional","affiliation":[{"name":"Booz Allen Hamilton, McLean, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9900-1972","authenticated-orcid":false,"given":"Edward","family":"Raff","sequence":"additional","affiliation":[{"name":"Booz Allen Hamilton, McLean, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3181-4076","authenticated-orcid":false,"given":"Fernando","family":"Camacho","sequence":"additional","affiliation":[{"name":"Laboratory for Physical Sciences, Baltimore, Maryland, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6368-8696","authenticated-orcid":false,"given":"James","family":"Holt","sequence":"additional","affiliation":[{"name":"Laboratory for Physical Sciences, Baltimore, Maryland, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Sample mean based index policies with o(log n) regret for the multiarmed bandit problem. Advances in applied probability 27, 4","author":"Agrawal R.","year":"1995","unstructured":"Agrawal, R. Sample mean based index policies with o(log n) regret for the multiarmed bandit problem. Advances in applied probability 27, 4 (1995), 1054-1078."},{"key":"e_1_3_2_2_2_1","volume-title":"Fast direct methods for gaussian processes","author":"Ambikasaran S.","year":"2015","unstructured":"Ambikasaran, S., Foreman-Mackey, D., Greengard, L., Hogg, D. W., and O'Neil, M. Fast direct methods for gaussian processes. IEEE transactions on pattern analysis and machine intelligence 38, 2 (2015), 252-265."},{"key":"e_1_3_2_2_3_1","volume-title":"Finite-time analysis of the multiarmed bandit problem. Machine learning 47","author":"Auer P.","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine learning 47 (2002), 235-256."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_33"},{"key":"e_1_3_2_2_5_1","volume-title":"Misspecified gaussian process bandit optimization. Advances in neural information processing systems 34","author":"Bogunovic I.","year":"2021","unstructured":"Bogunovic, I., and Krause, A. Misspecified gaussian process bandit optimization. Advances in neural information processing systems 34 (2021), 3004-3015."},{"key":"e_1_3_2_2_6_1","first-page":"4","article-title":"Products and convolutions of gaussian probability density functions","volume":"3","author":"Bromiley P","year":"2003","unstructured":"Bromiley, P. Products and convolutions of gaussian probability density functions. Tina-Vision Memo 3, 4 (2003), 1.","journal-title":"Tina-Vision Memo"},{"key":"e_1_3_2_2_7_1","first-page":"21","article-title":"Online optimization in x-armed bandits","author":"Bubeck S.","year":"2008","unstructured":"Bubeck, S., Stoltz, G., Szepesv\u00e1ri, C., and Munos, R. Online optimization in x-armed bandits. Advances in Neural Information Processing Systems 21 (2008).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_14"},{"key":"e_1_3_2_2_9_1","first-page":"6909","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Deng Y.","year":"2022","unstructured":"Deng, Y., Zhou, X., Kim, B., Tewari, A., Gupta, A., and Shroff, N. Weighted gaussian process bandits for non-stationary environments. In International Conference on Artificial Intelligence and Statistics (2022), PMLR, pp. 6909-6932."},{"key":"e_1_3_2_2_10_1","volume-title":"High-dimensional gaussian process bandits. Advances in neural information processing systems 26","author":"Djolonga J.","year":"2013","unstructured":"Djolonga, J., Krause, A., and Cevher, V. High-dimensional gaussian process bandits. Advances in neural information processing systems 26 (2013)."},{"key":"e_1_3_2_2_11_1","volume-title":"On tail probabilities for martingales. the Annals of Probability","author":"Freedman D. A.","year":"1975","unstructured":"Freedman, D. A. On tail probabilities for martingales. the Annals of Probability (1975), 100-118."},{"key":"e_1_3_2_2_12_1","volume-title":"On upper-confidence bound policies for nonstationary bandit problems. arXiv preprint arXiv:0805.3415","author":"Garivier A.","year":"2008","unstructured":"Garivier, A., and Moulines, E. On upper-confidence bound policies for nonstationary bandit problems. arXiv preprint arXiv:0805.3415 (2008)."},{"key":"e_1_3_2_2_13_1","volume-title":"A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association 47, 260","author":"Horvitz D. G.","year":"1952","unstructured":"Horvitz, D. G., and Thompson, D. J. A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association 47, 260 (1952), 663-685."},{"key":"e_1_3_2_2_14_1","first-page":"14930","volume-title":"International Conference on Machine Learning","author":"Jia S.","year":"2023","unstructured":"Jia, S., Xie, Q., Kallus, N., and Frazier, P. I. Smooth non-stationary bandits. In International Conference on Machine Learning (2023), PMLR, pp. 14930-14944."},{"key":"e_1_3_2_2_15_1","first-page":"17","article-title":"Nearly tight bounds for the continuum-armed bandit problem","author":"Kleinberg R","year":"2004","unstructured":"Kleinberg, R. Nearly tight bounds for the continuum-armed bandit problem. Advances in Neural Information Processing Systems 17 (2004).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"e_1_3_2_2_17_1","volume-title":"Bandits and experts in metric spaces. Journal of the ACM (JACM) 66, 4","author":"Kleinberg R.","year":"2019","unstructured":"Kleinberg, R., Slivkins, A., and Upfal, E. Bandits and experts in metric spaces. Journal of the ACM (JACM) 66, 4 (2019), 1-77."},{"key":"e_1_3_2_2_18_1","first-page":"51","volume-title":"2nd PASCAL Challenges Workshop","volume":"2","author":"Kocsis L.","year":"2006","unstructured":"Kocsis, L., and Szepesv\u00e1ri, C. Discounted ucb. In 2nd PASCAL Challenges Workshop (2006), vol. 2, pp. 51-134."},{"key":"e_1_3_2_2_19_1","volume-title":"Algorithms for multi-armed bandit problems. arXiv preprint arXiv:1402.6028","author":"Kuleshov V.","year":"2014","unstructured":"Kuleshov, V., and Precup, D. Algorithms for multi-armed bandit problems. arXiv preprint arXiv:1402.6028 (2014)."},{"key":"e_1_3_2_2_20_1","volume-title":"Asymptotically efficient adaptive allocation rules. Advances in applied mathematics 6, 1","author":"Lai T. L.","year":"1985","unstructured":"Lai, T. L., and Robbins, H. Asymptotically efficient adaptive allocation rules. Advances in applied mathematics 6, 1 (1985), 4-22."},{"key":"e_1_3_2_2_21_1","volume-title":"Gstools v1. 3: a toolbox for geostatistical modelling in python. Geoscientific Model Development 15, 7","author":"M\u00fcller S.","year":"2022","unstructured":"M\u00fcller, S., Sch\u00fcler, L., Zech, A., and Hesse, F. Gstools v1. 3: a toolbox for geostatistical modelling in python. Geoscientific Model Development 15, 7 (2022), 3161-3182."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1109020"},{"key":"e_1_3_2_2_23_1","volume-title":"Scikit-learn: Machine learning in python. the Journal of machine Learning research 12","author":"Pedregosa F.","year":"2011","unstructured":"Pedregosa, F., Varoqaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al. Scikit-learn: Machine learning in python. the Journal of machine Learning research 12 (2011), 2825-2830."},{"key":"e_1_3_2_2_24_1","first-page":"32","article-title":"Weighted linear bandits for nonstationary environments","author":"Russac Y.","year":"2019","unstructured":"Russac, Y., Vernade, C., and Capp\u00e9, O. Weighted linear bandits for nonstationary environments. Advances in Neural Information Processing Systems 32 (2019).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_25_1","volume-title":"Large-scale open dataset, pipeline, and benchmark for bandit algorithms. arXiv preprint arXiv:2008.07146","author":"Saito Y.","year":"2020","unstructured":"Saito, Y., Aihara, S., Matsutani, M., and Narita, Y. Large-scale open dataset, pipeline, and benchmark for bandit algorithms. arXiv preprint arXiv:2008.07146 (2020)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"e_1_3_2_2_27_1","first-page":"343","volume-title":"COLT","author":"Slivkins A.","year":"2008","unstructured":"Slivkins, A., and Upfal, E. Adapting to a changing environment: the brownian restless bandits. In COLT (2008), pp. 343-354."},{"key":"e_1_3_2_2_28_1","volume-title":"Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995","author":"Srinivas N.","year":"2009","unstructured":"Srinivas, N., Krause, A., Kakade, S. M., and Seeger, M. Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995 (2009)."},{"key":"e_1_3_2_2_29_1","first-page":"2","article-title":"Reinforcement learning: An introduction","volume":"17","author":"Sutton R. S.","year":"1999","unstructured":"Sutton, R. S., and Barto, A. G. Reinforcement learning: An introduction. Robotica 17, 2 (1999), 229-235.","journal-title":"Robotica"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371219"},{"key":"e_1_3_2_2_32_1","first-page":"21202","article-title":"-s. Optimal order simple regret for gaussian process bandits","volume":"34","author":"Vakili S.","year":"2021","unstructured":"Vakili, S., Bouziani, N., Jalali, S., Bernacchia, A., and Shiu, D.-s. Optimal order simple regret for gaussian process bandits. Advances in Neural Information Processing Systems 34 (2021), 21202-21215.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_33_1","first-page":"125","article-title":"-H. Bandit convex optimization in non-stationary environments","volume":"22","author":"Zhao P.","year":"2021","unstructured":"Zhao, P., Wang, G., Zhang, L., and Zhou, Z.-H. Bandit convex optimization in non-stationary environments. Journal of Machine Learning Research 22, 125 (2021), 1-45.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_34_1","first-page":"746","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Zhao P.","year":"2020","unstructured":"Zhao, P., Zhang, L., Jiang, Y., and Zhou, Z.-H. A simple approach for nonstationary linear bandits. In International Conference on Artificial Intelligence and Statistics (2020), PMLR, pp. 746-755."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS50987.2021.9400292"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3737097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:55:12Z","timestamp":1777571712000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3737097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":35,"alternative-id":["10.1145\/3711896.3737097","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3737097","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}