AI Paper Atlas

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

Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits

Junwen Yang, Vincent Tan

NeurIPS 2022 · Bandits and online learning › Multi-armed bandits · approach: Best-arm identification in linear bandits · 1 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 linear structure so hardness depends on the top d arms rather than all K armsOD-LinBAI · Fixed-budget linear banditshardness quantity: H_{2,\mathrm{lin}}\le H_{2} \le \frac K d H_{2,\mathrm{lin}}Improved
Use ε-approximate instead of exact G-optimal designs (ablation)OD-LinBAI · Fixed-budget linear banditsfailure probability bound: 32H_{2,\mathrm{lin}} -> 32(1+\epsilon) H_{2,\mathrm{lin}}Hurt
Use near-optimal designs with smaller support (ablation)OD-LinBAI · Fixed-budget linear banditsfailure probability bound: 32H_{2,\mathrm{lin}} -> 64 H_{2,\mathrm{lin}}Mixed

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