{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:14:30Z","timestamp":1780053270381,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1844234, CCF-2006591"],"award-info":[{"award-number":["CCF-1844234, CCF-2006591"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659957","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Best Arm Identification in Heterogeneous Environments"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4962-3925","authenticated-orcid":false,"given":"Nikolai","family":"Karpov","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6851-3115","authenticated-orcid":false,"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Distributed contextual linear bandits with minimax optimal communication cost. CoRR, abs\/2205.13170","author":"Amani Sanae","year":"2022","unstructured":"Sanae Amani, Tor Lattimore, Andr\u00e1s Gy\u00f6rgy, and Lin F. Yang. Distributed contextual linear bandits with minimax optimal communication cost. CoRR, abs\/2205.13170, 2022."},{"key":"e_1_3_2_1_2_1","first-page":"41","volume-title":"COLT","author":"Audibert Jean-Yves","year":"2010","unstructured":"Jean-Yves Audibert, S\u00e9bastien Bubeck, and R\u00e9mi Munos. Best arm identification in multi-armed bandits. In COLT, pages 41--53, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2527883"},{"key":"e_1_3_2_1_4_1","first-page":"590","volume-title":"COLT","author":"Carpentier Alexandra","year":"2016","unstructured":"Alexandra Carpentier and Andrea Locatelli. Tight (lower) bounds for the fixed budget best arm identification bandit problem. In COLT, pages 590--604, 2016."},{"key":"e_1_3_2_1_5_1","first-page":"535","volume-title":"COLT","author":"Chen Lijie","year":"2017","unstructured":"Lijie Chen, Jian Li, and Mingda Qiao. Towards instance optimal bounds for best arm identification. In COLT, pages 535--592, 2017."},{"key":"e_1_3_2_1_6_1","first-page":"255","volume-title":"COLT","author":"Even-Dar Eyal","year":"2002","unstructured":"Eyal Even-Dar, Shie Mannor, and Yishay Mansour. PAC bounds for multi-armed bandit and markov decision processes. In COLT, pages 255--270, 2002."},{"key":"e_1_3_2_1_7_1","volume-title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of Machine Learning Research, 7(Jun):1079--1105","author":"Even-Dar Eyal","year":"2006","unstructured":"Eyal Even-Dar, Shie Mannor, and Yishay Mansour. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of Machine Learning Research, 7(Jun):1079--1105, 2006."},{"key":"e_1_3_2_1_8_1","first-page":"854","volume-title":"NIPS","author":"Hillel Eshcar","year":"2013","unstructured":"Eshcar Hillel, Zohar Shay Karnin, Tomer Koren, Ronny Lempel, and Oren Somekh. Distributed exploration in multi-armed bandits. In NIPS, pages 854--862, 2013."},{"key":"e_1_3_2_1_9_1","first-page":"423","volume-title":"COLT","author":"Jamieson Kevin","year":"2014","unstructured":"Kevin Jamieson, Matthew Malloy, Robert Nowak, and S\u00e9bastien Bubeck. lil' UCB : An optimal exploration algorithm for multi-armed bandits. In COLT, pages 423--439, 2014."},{"key":"e_1_3_2_1_10_1","unstructured":"Peter Kairouz H. Brendan McMahan Brendan Avent Aur\u00e9lien Bellet Mehdi Bennis Arjun Nitin Bhagoji Kallista A. Bonawitz Zachary Charles Graham Cormode Rachel Cummings Rafael G. L. D'Oliveira Salim El Rouayheb David Evans Josh Gardner Zachary Garrett Adri\u00e0 Gasc\u00f3n Badih Ghazi Phillip B. Gibbons Marco Gruteser Za\u00efd Harchaoui Chaoyang He Lie He Zhouyuan Huo Ben Hutchinson Justin Hsu Martin Jaggi Tara Javidi Gauri Joshi Mikhail Khodak Jakub Konecn\u00fd Aleksandra Korolova Farinaz Koushanfar Sanmi Koyejo Tancr\u00e8de Lepoint Yang Liu Prateek Mittal Mehryar Mohri Richard Nock Ayfer \u00d6zg\u00fcr Rasmus Pagh Mariana Raykova Hang Qi Daniel Ramage Ramesh Raskar Dawn Song Weikang Song Sebastian U. Stich Ziteng Sun Ananda Theertha Suresh Florian Tram\u00e8r Praneeth Vepakomma JianyuWang Li Xiong Zheng Xu Qiang Yang Felix X. Yu Han Yu and Sen Zhao. Advances and open problems in federated learning. CoRR abs\/1912.04977 2019."},{"key":"e_1_3_2_1_11_1","first-page":"1238","volume-title":"ICML","author":"Karnin Zohar","year":"2013","unstructured":"Zohar Karnin, Tomer Koren, and Oren Somekh. Almost optimal exploration in multi-armed bandits. In ICML, pages 1238--1246, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.25990"},{"key":"e_1_3_2_1_13_1","volume-title":"Collaborative best arm identification with limited communication on non-iid data. CoRR, abs\/2207.08015","author":"Karpov Nikolai","year":"2024","unstructured":"Nikolai Karpov and Qin Zhang. Collaborative best arm identification with limited communication on non-iid data. CoRR, abs\/2207.08015, 2024."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00024"},{"key":"e_1_3_2_1_15_1","volume-title":"Federated optimization: Distributed optimization beyond the datacenter. CoRR, abs\/1511.03575","author":"Konecn\u00fd Jakub","year":"2015","unstructured":"Jakub Konecn\u00fd, Brendan McMahan, and Daniel Ramage. Federated optimization: Distributed optimization beyond the datacenter. CoRR, abs\/1511.03575, 2015."},{"key":"e_1_3_2_1_16_1","volume-title":"Federated optimization: Distributed machine learning for on-device intelligence. CoRR, abs\/1610.02527","author":"Konecn\u00fd Jakub","year":"2016","unstructured":"Jakub Konecn\u00fd, H. Brendan McMahan, Daniel Ramage, and Peter Richt\u00e1rik. Federated optimization: Distributed machine learning for on-device intelligence. CoRR, abs\/1610.02527, 2016."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"e_1_3_2_1_18_1","series-title":"Proceedings of Machine Learning Research","first-page":"1273","volume-title":"Aarti Singh and Xiaojin (Jerry) Zhu","author":"McMahan Brendan","year":"2017","unstructured":"Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Ag\u00fcera y Arcas. Communication-efficient learning of deep networks from decentralized data. In Aarti Singh and Xiaojin (Jerry) Zhu, editors, AISTATS, volume 54 of Proceedings of Machine Learning Research, pages 1273--1282. PMLR, 2017."},{"key":"e_1_3_2_1_19_1","volume-title":"Exploiting heterogeneity in robust federated best-arm identification. CoRR, abs\/2109.05700","author":"Mitra Aritra","year":"2021","unstructured":"Aritra Mitra, Hamed Hassani, and George J. Pappas. Exploiting heterogeneity in robust federated best-arm identification. CoRR, abs\/2109.05700, 2021."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703739"},{"key":"e_1_3_2_1_21_1","volume-title":"Near-optimal collaborative learning in bandits. CoRR, abs\/2206.00121","author":"R\u00e9da Cl\u00e9mence","year":"2022","unstructured":"Cl\u00e9mence R\u00e9da, Sattar Vakili, and Emilie Kaufmann. Near-optimal collaborative learning in bandits. CoRR, abs\/2206.00121, 2022."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17156"},{"key":"e_1_3_2_1_23_1","unstructured":"Chengshuai Shi Cong Shen and Jing Yang. Federated multi-armed bandits with personalization. In Arindam Banerjee and Kenji Fukumizu editors AISTATS volume 130 of Proceedings of Machine Learning Research pages 2917--2925. PMLR 2021."},{"key":"e_1_3_2_1_24_1","first-page":"126","volume-title":"FOCS","author":"Tao Chao","year":"2019","unstructured":"Chao Tao, Qin Zhang, and Yuan Zhou. Collaborative learning with limited interaction: Tight bounds for distributed exploration in multi-armed bandits. In David Zuckerman, editor, FOCS, pages 126--146. IEEE Computer Society, 2019."},{"key":"e_1_3_2_1_25_1","volume-title":"ICLR. OpenReview. net","author":"Wang Yuanhao","year":"2020","unstructured":"Yuanhao Wang, Jiachen Hu, Xiaoyu Chen, and Liwei Wang. Distributed bandit learning: Near-optimal regret with efficient communication. In ICLR. OpenReview. net, 2020."},{"key":"e_1_3_2_1_26_1","first-page":"222","volume-title":"FOCS","author":"Chi-Chih Yao Andrew","year":"1977","unstructured":"Andrew Chi-Chih Yao. Probabilistic computations: Toward a unified measure of complexity (extended abstract). In FOCS, pages 222--227, 1977."}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Nantes France","acronym":"SPAA '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659957","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:07Z","timestamp":1755879787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":26,"alternative-id":["10.1145\/3626183.3659957","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659957","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}