Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits

Nikolai Karpov, Qin Zhang
1/26/2023
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In this paper, we study the collaborative learning model, which concerns the tradeoff between parallelism and communication overhead in multi-agent multi-armed bandits. For regret minimization in multi-armed bandits, we present the first set of tradeoffs between the number of rounds of communication among the agents and the regret of the collaborative learning process.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits

89% match2026

Learning with Limited Shared Information in Multi-agent Multi-armed Bandit

85% match2025

Individual Regret in Cooperative Stochastic Multi-Armed Bandits

85% match2024

Fair Multi-Agent Bandits

84% match2023

Federated Learning for Heterogeneous Bandits with Unobserved Contexts

83% match2023

Distributed No-Regret Learning for Multi-Stage Systems with End-to-End Bandit Feedback

83% match2024

Cite this paper

@article{karpov2023communicationefficient,
  title  = {Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits},
  author = {Nikolai Karpov and Qin Zhang},
  year   = {2023},
  eprint = {2301.11442},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.11442v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.11442.svg)](https://codeofpaper.com/paper/2301.11442)

Discussion