April 19, 2024, 4:42 a.m. | Nikolai Karpov, Qin Zhang

cs.LG updates on arXiv.org arxiv.org

arXiv:2207.08015v3 Announce Type: replace
Abstract: In this paper, we study the tradeoffs between the time and the number of communication rounds of the best arm identification problem in the heterogeneous collaborative learning model, where multiple agents interact with possibly different environments and they want to learn in parallel an objective function in the aggregated environment. By proving almost tight upper and lower bounds, we show that collaborative learning in the heterogeneous setting is inherently more difficult than that in the …

abstract agents arm arxiv collaborative communication cs.ds cs.lg environments function identification learn multiple paper study type

More from arxiv.org / cs.LG updates on arXiv.org

Data Engineer

@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania

Artificial Intelligence – Bioinformatic Expert

@ University of Texas Medical Branch | Galveston, TX

Lead Developer (AI)

@ Cere Network | San Francisco, US

Research Engineer

@ Allora Labs | Remote

Ecosystem Manager

@ Allora Labs | Remote

Founding AI Engineer, Agents

@ Occam AI | New York