atlas

Research map / Bandits and online learning / Multi-armed bandits

Data Poisoning Attacks on Stochastic Bandits

ICML 2019 · Bandits and online learning › Multi-armed bandits · approach: Non-stationary and structured-reward bandits · 29 citations (OpenAlex)

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 changedWhereMeasuredEffect
Poison offline reward data using the optimization strategyε-greedy, UCB, and Thompson Sampling · Offline attacksattack success: all the attacks are successfulHelped
Poison offline reward data using the optimization strategyε-greedy · Offline attackspoisoning effort ratio: less than 10%Helped
Poison offline reward data using the optimization strategyUCB · Offline attackspoisoning effort ratio: less than 2%Helped
Poison offline reward data using the optimization strategyThompson Sampling · Offline attackspoisoning effort ratio: less than 5%Helped
Use adaptive reward-gap estimates and confidence bounds to set attacksACE · Online attackstarget-arm pulls: T - o(T)Helped
Use adaptive reward-gap estimates and confidence bounds to set attacksACE · Online attacksaccumulated attack cost: O(log T)Helped
Use ACE instead of an algorithm-specific attackε-greedy · Online attacksattack cost: slightly worseHurt
Use ACE instead of an algorithm-specific attackUCB · Online attacksattack cost: much largerHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy