atlas

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

PAC Lower Bounds and Efficient Algorithms for The Max K-Armed Bandit Problem

ICML 2016 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 4 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 multi-armed adaptive UCB-type sampling (Max-CB) instead of uniform-over-arms unified-arm samplingMax K-Armed Bandit with few optimal arms · Example 1 synthetic (|K|=10^4)sample complexity: 3.52e8 vs 6.9e10 for unified-arm algorithmHelped
Use multi-armed Max-CB instead of unified-arm sampling when many arms are near-optimalMax K-Armed Bandit with many optimal arms · Example 2 synthetic (|K|=10^4)sample complexity: 1.56e12 vs 6.9e10 for unified-arm algorithmHurt
Assume lower bound G*(ε) on tail function that is optimistic by factor α<1 (robustness analysis)Max-CB · theoretical analysiscorrectness level and sample complexityHurt
Use conservative tail bound G*(ε) (true tail is αG*, α>1)Max-CB · theoretical analysisfailure probabilityHelped

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