AI Paper Atlas

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

Non-Asymptotic Pure Exploration by Solving Games

Rémy Degenne, Wouter M. Koolen, Pierre Ménard

NeurIPS 2019 · Bandits and online learning › Multi-armed bandits · approach: Pure exploration algorithms · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 direct rather than cumulative tracking (ablation)tracking-based sampling rules · Best Arm and Minimum Threshold experimentssample complexityImproved
use uniform sampling instead of an adaptive sampling rule (ablation)pure exploration algorithms · Best Arm and Minimum Threshold experimentssample complexityHurt
follow the oracle proportions (ablation)pure exploration sampling · Best Arm experimentssample complexityHurt
use Track-and-Stop rather than Optimistic Track-and-Stop (ablation)pure exploration sampling · sparse-allocation experimentsample complexityHurt
use Optimistic Track-and-Stoppure exploration sampling · sparse-allocation experiment at δ=10^-20sample complexityImproved
use the simplified single learner instead of partitioning rounds by the candidate answer (ablation)AdaHedge vs Best-Response (D) · Best Arm and Minimum Threshold experimentssample complexityNo clear effect

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