Research map / Bandits and online learning / Multi-armed bandits
An optimal algorithm for the Thresholding Bandit Problem
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use UCBE with tuned a=(T-K)/H (requires knowing H) instead of parameter-free APT | UCBE(1) baseline · Experiments 1-3 (Bernoulli and Gaussian) | probability of success | Mixed |
| Mis-tuned UCBE parameter (a=4^i (T-K)/H with i in {-1,4}) versus parameter-free APT | UCBE variants · Experiments 1-3 | probability of success | Hurt |
Closest papers by meaning
- The Batch Complexity of Bandit Pure Exploration (ICML 2025 · similarity 0.90)
- Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates (NeurIPS 2024 · similarity 0.89)
- Combinatorial Stochastic-Greedy Bandit (AAAI 2024 · similarity 0.89)
- Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit (AAAI 2024 · similarity 0.88)
- Near Optimal Non-asymptotic Sample Complexity of 1-Identification (ICML 2025 · similarity 0.88)
- Instance-Optimal Pure Exploration for Linear Bandits on Continuous Arms (ICML 2025 · similarity 0.88)
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.