atlas

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

Adversarial Attacks on Stochastic Bandits

NeurIPS 2018 · Bandits and online learning › Multi-armed bandits · approach: Non-stationary and structured-reward bandits · 48 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
Manipulate rewards of non-target arms online, without knowing their meansε-greedy · Stochastic bandit; ε_t=1/t in the simulationtarget-arm pulls: 6 -> 9994Helped
Manipulate rewards of non-target arms online, without knowing their meansUCB · Two-arm stochastic bandit, T=10^7target-arm pulls: 156 -> 10^7-2Helped
Increase the UCB attack parameter Δ_0 (ablation)UCB attack · Two-arm stochastic banditcumulative attack costHelped
Use a constant attack A greater than the maximum reward gapHeuristic constant attack on ε-greedy and UCB · Two-arm bandit with maximum gap 1target-arm pullsHelped
Use a constant attack A smaller than the maximum reward gapHeuristic constant attack on ε-greedy and UCB · Two-arm bandit with maximum gap 1attack successHurt
Increase the non-target reward gap Δ_1 (ablation)ε-greedy attack · Two-arm Gaussian bandit simulationcumulative attack costHurt

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