AI Paper Atlas

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

An Optimal Private Stochastic-MAB Algorithm based on Optimal Private Stopping Rule

ICML 2019 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 10 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
Use DP Successive Elimination instead of DP-UCBPrivate stochastic multi-armed bandits · Tested settings C1-C4average pseudo-regret: at least 5 timesHelped
Partition arm pulls into geometrically increasing epochs and reset estimates between epochsDP Successive Elimination · Stochastic K-armed MABexpected pseudo-regret: O \left( \left(\sum\limits_{a\neq a^*} \frac{\log(T)}{\Delta_{a}}\right) + \frac{K\log(T)}{\varepsilon} \right)Helped
Check stopping conditions at exponentially increasing sample intervals (ablation)DP-NAS · Private stopping rulesample complexity: no more than a constant factorNo clear effect
Use a simpler private stopping rule based on sparse vector rather than tree-based continual releasePrivate stochastic multi-armed bandits · Stochastic K-armed MABadded pseudo-regret: O(\nicefrac{K\log(T)}\varepsilon)Helped

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