Research map / Bandits and online learning / Multi-armed bandits
Observation-Free Attacks on Stochastic Bandits
Yinglun Xu, Bhuvesh Kumar, Jacob Abernethy
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 |
|---|---|---|---|
| Apply observation-free corruption attack (inject high rewards to target arm) | UCB · 2-arm simulation | rate of pulling optimal arm | Hurt |
| Apply observation-free corruption attack (inject high rewards to target arm) | ϵ-greedy · 2-arm simulation | rate of pulling optimal arm | Hurt |
| Apply observation-free corruption attack (inject high rewards to target arm) | Thompson Sampling · 2-arm simulation | rate of pulling optimal arm | Hurt |
Closest papers by meaning
- Stochastic Bandits Robust to Adversarial Attacks (ICLR 2025 · similarity 0.92)
- Practical Adversarial Attacks on Stochastic Bandits via Fake Data Injection (NeurIPS 2026 · similarity 0.90)
- A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond (NeurIPS 2025 · similarity 0.90)
- Locally Private and Robust Multi-Armed Bandits (NeurIPS 2024 · similarity 0.90)
- Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits (AAAI 2024 · similarity 0.89)
- Combinatorial Stochastic-Greedy Bandit (AAAI 2024 · similarity 0.87)
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.
