Research map / Bandits and online learning / Multi-armed bandits
On Private and Robust Bandits
Yulian Wu, Xingyu Zhou, Youming Tao, Di Wang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| decrease privacy budget epsilon (1 to 0.2) in Student's t setting (ablation) | PRAE-R and PRAE-C · Student's t rewards, alpha=5% | cumulative regret | Hurt |
| increase Huber corruption level alpha (2% to 10%) in Pareto setting (ablation) | PRAE-R and PRAE-C · Pareto rewards, epsilon=0.5 | cumulative regret | Hurt |
| use PRM that exploits prior mean range D (PRAE-C) instead of PRAE-R | PRAE-R · Student's t and Pareto rewards | cumulative regret | Improved |
Closest papers by meaning
- Locally Private and Robust Multi-Armed Bandits (NeurIPS 2024 · similarity 0.92)
- Algorithms for Differentially Private Multi-Armed Bandits (AAAI 2016 · similarity 0.91)
- Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret (ICML 2025 · similarity 0.89)
- Taming Heavy-Tailed Losses in Adversarial Bandits and the Best-of-Both-Worlds Setting (NeurIPS 2024 · similarity 0.89)
- Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards (NeurIPS 2025 · similarity 0.89)
- Nash Social Welfare for Multi Armed Bandits: Trajectory-wise Expected and High Probability Regret (NeurIPS 2026 · 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.
