Research map / Bandits and online learning / Multi-armed bandits
A Near-Optimal Best-of-Both-Worlds Algorithm for Federated Bandits
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Federated X-armed Bandit (AAAI 2024 · similarity 0.91)
- Federated Combinatorial Multi-Agent Multi-Armed Bandits (ICML 2024 · similarity 0.91)
- Communication-Efficient Federated Non-Linear Bandit Optimization (ICLR 2024 · similarity 0.90)
- Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users (AAAI 2024 · similarity 0.89)
- Incentivized Truthful Communication for Federated Bandits (ICLR 2024 · similarity 0.89)
- Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints (NeurIPS 2024 · similarity 0.89)
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.