{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:04:16Z","timestamp":1775815456071,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709434","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:44:43Z","timestamp":1743792283000},"page":"2247-2258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Task Combinatorial Bandits for Budget Allocation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3948-9535","authenticated-orcid":false,"given":"Lin","family":"Ge","sequence":"first","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6473-8529","authenticated-orcid":false,"given":"Yang","family":"Xu","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9128-8043","authenticated-orcid":false,"given":"Jianing","family":"Chu","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4096-9533","authenticated-orcid":false,"given":"David","family":"Cramer","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4528-9325","authenticated-orcid":false,"given":"Fuhong","family":"Li","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9736-6614","authenticated-orcid":false,"given":"Kelly","family":"Paulson","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1875-2115","authenticated-orcid":false,"given":"Rui","family":"Song","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Advances in Neural Information Processing Systems","volume":"29","author":"Agrawal Shipra","year":"2016","unstructured":"Shipra Agrawal and Nikhil Devanur. 2016. Linear contextual bandits with knapsacks. Advances in Neural Information Processing Systems, Vol. 29 (2016)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602844"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3174"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11749-016-0481-7"},{"key":"e_1_3_2_2_6_1","first-page":"2122","article-title":"Differentiable meta-learning of bandit policies","volume":"33","author":"Boutilier Craig","year":"2020","unstructured":"Craig Boutilier, Chih-Wei Hsu, Branislav Kveton, Martin Mladenov, Csaba Szepesvari, and Manzil Zaheer. 2020. Differentiable meta-learning of bandit policies. Advances in Neural Information Processing Systems, Vol. 33 (2020), 2122--2134.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1111\/poms.12886"},{"key":"e_1_3_2_2_8_1","first-page":"23331","article-title":"Sample-then-optimize batch neural thompson sampling","volume":"35","author":"Dai Zhongxiang","year":"2022","unstructured":"Zhongxiang Dai, Yao Shu, Bryan Kian Hsiang Low, and Patrick Jaillet. 2022. Sample-then-optimize batch neural thompson sampling. Advances in Neural Information Processing Systems, Vol. 35 (2022), 23331--23344.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1177\/0272989X20944875"},{"key":"e_1_3_2_2_10_1","volume-title":"Automated bidding and budget optimization for performance advertising campaigns. Available at SSRN 3913039","author":"Geng Tong","year":"2021","unstructured":"Tong Geng, Fangzhou Sun, Di Wu, Wei Zhou, Harikesh Nair, and Zhangang Lin. 2021. Automated bidding and budget optimization for performance advertising campaigns. Available at SSRN 3913039 (2021)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492866.3549727"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467124"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the ADKDD","volume":"17","author":"Han Benjamin","year":"2020","unstructured":"Benjamin Han and Jared Gabor. 2020. Contextual Bandits for Advertising Budget Allocation. Proceedings of the ADKDD, Vol. 17 (2020)."},{"key":"e_1_3_2_2_14_1","volume-title":"Neural tangent kernel: Convergence and generalization in neural networks. Advances in neural information processing systems","author":"Jacot Arthur","year":"2018","unstructured":"Arthur Jacot, Franck Gabriel, and Cl\u00e9ment Hongler. 2018. Neural tangent kernel: Convergence and generalization in neural networks. Advances in neural information processing systems, Vol. 31 (2018)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2020.3005013"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_2_17_1","volume-title":"International Conference on Machine Learning. PMLR, 5884--5893","author":"Kveton Branislav","year":"2021","unstructured":"Branislav Kveton, Mikhail Konobeev, Manzil Zaheer, Chih-wei Hsu, Martin Mladenov, Craig Boutilier, and Csaba Szepesvari. 2021. Meta-thompson sampling. In International Conference on Machine Learning. PMLR, 5884--5893."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.08.019"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11888"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103663"},{"key":"e_1_3_2_2_21_1","volume-title":"A Survey on Bid Optimization in Real-Time Bidding Display Advertising. ACM Transactions on Knowledge Discovery from Data","author":"Ou Weitong","year":"2023","unstructured":"Weitong Ou, Bo Chen, Xinyi Dai, Weinan Zhang, Weiwen Liu, Ruiming Tang, and Yong Yu. 2023. A Survey on Bid Optimization in Real-Time Bidding Display Advertising. ACM Transactions on Knowledge Discovery from Data, Vol. 18, 3 (2023), 1--31."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1070.0219"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/19466315.2013.783504"},{"key":"e_1_3_2_2_24_1","volume-title":"Anna Veronika Dorogush, and Andrey Gulin","author":"Prokhorenkova Liudmila","year":"2018","unstructured":"Liudmila Prokhorenkova, Gleb Gusev, Aleksandr Vorobev, Anna Veronika Dorogush, and Andrey Gulin. 2018. CatBoost: unbiased boosting with categorical features. Advances in neural information processing systems, Vol. 31 (2018)."},{"key":"e_1_3_2_2_25_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 1760--1770","author":"Sankararaman Karthik Abinav","year":"2018","unstructured":"Karthik Abinav Sankararaman and Aleksandrs Slivkins. 2018. Combinatorial semi-bandits with knapsacks. In International Conference on Artificial Intelligence and Statistics. PMLR, 1760--1770."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmp.2018.03.001"},{"key":"e_1_3_2_2_27_1","volume-title":"Cross-channel Budget Coordination for Online Advertising System. arXiv preprint arXiv:2305.06883","author":"Shen Guangyuan","year":"2023","unstructured":"Guangyuan Shen, Shenjie Sun, Dehong Gao, Shaolei Li, Libin Yang, Yongping Shi, and Wei Ning. 2023. Cross-channel Budget Coordination for Online Advertising System. arXiv preprint arXiv:2305.06883 (2023)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.05.050"},{"key":"e_1_3_2_2_29_1","first-page":"29655","article-title":"Metadata-based multi-task bandits with bayesian hierarchical models","volume":"34","author":"Wan Runzhe","year":"2021","unstructured":"Runzhe Wan, Lin Ge, and Rui Song. 2021. Metadata-based multi-task bandits with bayesian hierarchical models. Advances in Neural Information Processing Systems, Vol. 34 (2021), 29655--29668.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_30_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 1144--1173","author":"Wan Runzhe","year":"2023","unstructured":"Runzhe Wan, Lin Ge, and Rui Song. 2023. Towards scalable and robust structured bandits: A meta-learning framework. In International Conference on Artificial Intelligence and Statistics. PMLR, 1144--1173."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737511"},{"key":"e_1_3_2_2_32_1","volume-title":"Wing Cheong Lau, and Rui Li","author":"Xu Huanle","year":"2020","unstructured":"Huanle Xu, Yang Liu, Wing Cheong Lau, and Rui Li. 2020. Combinatorial Multi-Armed Bandits with Concave Rewards and Fairness Constraints.. In IJCAI. 2554--2560."},{"key":"e_1_3_2_2_33_1","volume-title":"Optimal budget allocation across search advertising markets. informs Journal on Computing","author":"Yang Yanwu","year":"2015","unstructured":"Yanwu Yang, Daniel Zeng, Yinghui Yang, and Jie Zhang. 2015. Optimal budget allocation across search advertising markets. informs Journal on Computing, Vol. 27, 2 (2015), 285--300."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339716"},{"key":"e_1_3_2_2_35_1","volume-title":"Neural thompson sampling. arXiv preprint arXiv:2010.00827","author":"Zhang Weitong","year":"2020","unstructured":"Weitong Zhang, Dongruo Zhou, Lihong Li, and Quanquan Gu. 2020. Neural thompson sampling. arXiv preprint arXiv:2010.00827 (2020)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098134"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS50987.2021.9400228"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709434","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:44:41Z","timestamp":1755359081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":37,"alternative-id":["10.1145\/3690624.3709434","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709434","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}