AI Paper Atlas

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

Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality

Kwang-Sung Jun, Chicheng Zhang

NeurIPS 2020 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 6 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 pessimism-guided, forced-sampling-free exploration in place of forced samplingCROP · Finite structured banditsexpected regret: P_1 ln(n) + P_2 ln(ln(n)) + P_3 (ln(|F|) + ln(Q_1)) + K_ψ Δ_maxImproved
Use CROP rather than forced samplingCheating code, K ≈ n · Cheating coderegret: CROP: ln^3(n); forced sampling: linear regretImproved
Rely on the asymptotically optimal oracle across problem instancesClairvoyant oracle · Cheating code problem familyworst-case regret: linear regretHurt

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