Research map / Bandits and online learning / Multi-armed bandits
Near-Optimal Collaborative Learning in 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use W-CPE-BAI instead of PF-UCB-BAI when personalization level alpha is below 0.5 | W-CPE-BAI · Synthetic instance | exploration cost | Helped |
| Compare W-CPE-BAI with PF-UCB-BAI at larger alpha | W-CPE-BAI · Synthetic instance | exploration cost | No clear effect |
| Use W-CPE-BAI instead of PF-UCB-BAI | W-CPE-BAI · Synthetic instance | communication rounds | Helped |
Closest papers by meaning
- Federated Multi-armed Bandits with Efficient Bit-Level Communications (NeurIPS 2025 · similarity 0.90)
- Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits (AAAI 2024 · similarity 0.88)
- Federated Combinatorial Multi-Agent Multi-Armed Bandits (ICML 2024 · similarity 0.88)
- On Interpolating Experts and Multi-Armed Bandits (ICML 2024 · similarity 0.87)
- Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs (AAAI 2024 · similarity 0.87)
- Instance-Optimal Pure Exploration for Linear Bandits on Continuous Arms (ICML 2025 · similarity 0.86)
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.