AI Paper Atlas

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

Anytime optimal algorithms in stochastic multi-armed bandits

ICML 2016 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 26 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 MOSS-anytime (MOSS-style index with no doubling trick) instead of MOSS with a doubling trickstochastic bandit with equal gaps · synthetic Gaussian bandit, equal gapsregretHelped
Use MOSS-anytime instead of UCB2 and other anytime algorithmsstochastic bandit with increasing gaps · synthetic Gaussian bandit, increasing gapsregretHurt
Set exploration parameter alpha to 0.1 instead of theoretical 1.35 (ablation)MOSS-anytime · increasing gaps synthetic banditregretHelped
Use a single-pull variant of UCB2 instead of block-structured UCB2 (ablation)UCB2 · synthetic Gaussian banditregretNo clear effect
Add the conjectured-optimal H-inspired UCB index (sum of pulls below sqrt t)UCB variant · equal gaps and increasing gaps synthetic banditsregretNo clear effect
Use full-information follow-the-leader (FTL) instead of bandit feedbackfull information setting · theorydistribution-free regret boundHelped

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