atlas

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

Thresholding Bandit with Optimal Aggregate Regret

NeurIPS 2019 · Bandits and online learning › Multi-armed bandits · approach: Pure exploration 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 LSA instead of Uniform, APT, UCBE, or Opt-KGThresholding bandit · Setup 1 (arithmetic progression I)aggregate regretHelped
Use LSA instead of the competing algorithmsThresholding bandit · Setup 2 (arithmetic progression II)aggregate regretHelped
Use LSA instead of the competing algorithmsThresholding bandit · Setup 3 (two-group setting)aggregate regretHelped
Use a fixed LSA tuning parameter across setups rather than selecting APT's precision parameter for each setting and budgetLSA and APT · Thresholding bandit, Setups 1–3robustness across settingsHelped
Use uniform sampling instead of optimal budget allocationThresholding bandit · Constructed hard instances, K ≥ 20budget required for the same order of aggregate regret: Ω(K)Hurt

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