Communication-Efficient Collaborative Best Arm Identification
Nikolai Karpov, Qin Zhang
2023年份
6被引次数
2顶会引用
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Breaking the log(1/Δ2) Barrier: Better Batched Best Arm Identification with Adaptive GridsTianyuan Jin, Qin Zhang, Dongruo ZhouICLR 2025
- Near Optimal Best Arm Identification for Clustered BanditsYash, Avishek Ghosh, Nikhil KaramchandaniICML 2025
它引用的顶会 Paper3
- Distributed Bandit Learning: Near-Optimal Regret with Efficient CommunicationYuanhao Wang, Jiachen Hu, Xiaoyu Chen, Liwei WangICLR 2020 · 被引用 115 次
- Federated Multi-Armed BanditsChengshuai Shi, Cong ShenAAAI 2021 · 被引用 114 次
- Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract)Nikolai Karpov, Qin Zhang, Yuan ZhouFOCS 2020 · 被引用 10 次
相关 Paper
- Communication-Efficient Collaborative Regret Minimization in Multi-Armed BanditsNikolai Karpov, Qin ZhangAAAI 2024 · 被引用 2 次
- Multi-Agent Best Arm Identification with Private CommunicationsAlexandre Rio, Merwan Barlier, Igor Colin, Marta SoareICML 2023 · 被引用 2 次
- Collaborative Multi-Agent Heterogeneous Multi-Armed BanditsRonshee Chawla, Daniel Vial, Sanjay Shakkottai, R. SrikantICML 2023 · 被引用 7 次
- Near-Optimal Collaborative Learning in BanditsClémence Réda, Sattar Vakili, Emilie KaufmannNeurIPS 2022 · 被引用 23 次
- Distributed Bandits with Heterogeneous AgentsLin Yang, Yu-Zhen Janice Chen, Mohammad Hassan Hajiesmaili, John C. S. Lui 等INFOCOM 2022 · 被引用 12 次
