Communication-Efficient Collaborative Best Arm Identification
Not on the map. Why?
Abstract (arXiv)
We investigate top-m arm identification, a basic problem in bandit theory, in a multi-agent learning model in which agents collaborate to learn an objective function. We are interested in designing collaborative learning algorithms that achieve maximum speedup (compared to single-agent learning algorithms) using minimum communication cost, as communication is frequently the bottleneck in multi-agent learning. We give both algorithmic and impossibility results, and conduct a set of experiments to demonstrate the effectiveness of our algorithms.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 11 of its 20 references that are in the map. First posted on arXiv 18 Aug 2022.
Builds on
11 of 20 references.
References · 11
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2021Federated Multi-armed Bandits with Personalizationcited by 62
- 2021Federated Multi-Armed Banditscited by 59
- 2013Distributed Exploration in Multi-Armed Banditscited by 46
- 2019Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed Banditscited by 40
- 2016Towards Instance Optimal Bounds for Best Arm Identificationcited by 30
- 2017Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selectioncited by 28
- 2020Collaborative Top Distribution Identifications with Limited Interactioncited by 21
- 2021Exploiting Heterogeneity in Robust Federated Best-Arm Identificationcited by 20
- 2021When to Call Your Neighbor? Strategic Communication in Cooperative Stochastic Banditscited by 8
- 2013Tight Bounds for Set Disjointness in the Message Passing Modelcited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 2; 2026: 1.
5 papers.
- 2023The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Banditscited by 5
- 2023Communication-Efficient Collaborative Regret Minimization in Multi-Armed Banditscited by 3
- 2025Breaking the log(1/Delta2) Barrier: Better Batched Best Arm Identification with Adaptive Gridscited by 0
- 2025Near Optimal Best Arm Identification for Clustered Banditscited by 0
- 2026The Price of Decentralization in Top-K Arm Identificationcited by 0
- 2026The Price of Decentralization in Top-K Arm Identification22 Aug 2026
- 2025Near Optimal Best Arm Identification for Clustered Bandits15 May 2025
- 2025Breaking the log(1/Delta2) Barrier: Better Batched Best Arm Identification with Adaptive Grids29 Jan 2025
- 2023The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits6 Sep 2023
- 2023Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits26 Jan 2023