atlas

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

Achieving Privacy in the Adversarial Multi-Armed Bandit

AAAI 2017 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 21 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
Add Laplace noise to each gain before EXP3 observes itEXP3 · Oblivious adversarial banditsexpected regret: O{T^{2/3} /ε} -> O{√T lnT /ε}Helped
Run EXP3 in fixed-size batches and feed it the average gain per batchEXP3 · Switching costs adversaryexpected regret: O{T^{3/4}} -> O{T^{2/3}}Helped
Run EXP3 in fixed-size batches and use its inherent action-selection privacyEXP3 · Oblivious adversarial banditscumulative privacy loss: O{2T} -> O{√ln T}Helped
Use EXP3τ instead of DPEXP3-LaplacePrivate adversarial bandit algorithms · Oblivious adversary or a weaker adversaryregretHurt
Use EXP3τ instead of EXP3 or DPEXP3-LaplacePrivate adversarial bandit algorithms · Switching costs adversaryregretHelped

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