Research map / Bandits and online learning / Multi-armed bandits
Algorithms for Differentially Private Multi-Armed 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 interval-based private mean releases with lazy updates and noise independent of ε | DP-UCB-Int · 2-arm and 10-arm Bernoulli bandits | regret | Helped |
| use DP-UCB instead of DP-UCB-Bound | private UCB algorithms · 2-arm and 10-arm Bernoulli bandits | regret | Mixed |
| use DP-UCB-Bound, DP-UCB, or DP-UCB-Int instead of Private-UCB | private UCB algorithms · 2-arm and 10-arm Bernoulli bandits | regret | Helped |
Closest papers by meaning
- An Optimal Private Stochastic-MAB Algorithm based on Optimal Private Stopping Rule (ICML 2019 · similarity 0.92)
- Locally Private and Robust Multi-Armed Bandits (NeurIPS 2024 · similarity 0.90)
- Faster Rates for Private Adversarial Bandits (ICML 2025 · similarity 0.89)
- Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret (ICML 2025 · similarity 0.89)
- Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits (NeurIPS 2026 · similarity 0.89)
- Fixed-Budget Differentially Private Best Arm Identification (ICLR 2024 · similarity 0.88)
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.