Research map / Bandits and online learning / Multi-armed bandits
Federated Multi-armed Bandits with Efficient Bit-Level Communications
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Studies federated multi-armed bandits where distributed agents on a communication graph minimize cumulative regret while communicating under bandwidth limits, using bit-level communication.
Problem
Federated multi-armed bandits in which agents connected by a communication graph must minimize cumulative regret while sharing data is limited by bandwidth and privacy constraints.
Approach
Communication-efficient federated bandit algorithm that exchanges information at the bit level rather than full data or parameters, as stated in the title; specific mechanism not stated in the abstract provided.
Experimental setup
Metrics: cumulative regret
Closest papers by meaning
- Federated Combinatorial Multi-Agent Multi-Armed Bandits (ICML 2024 · similarity 0.91)
- Communication-Efficient Federated Non-Linear Bandit Optimization (ICLR 2024 · similarity 0.91)
- Federated X-armed Bandit (AAAI 2024 · similarity 0.91)
- Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users (AAAI 2024 · similarity 0.91)
- Individual Regret in Cooperative Stochastic Multi-Armed Bandits (NeurIPS 2025 · similarity 0.91)
- Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits (AAAI 2024 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.