Research map / Bandits and online learning / Multi-armed bandits
Structure Adaptive Algorithms for Stochastic Bandits
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 SP_k or SP_λ instead of vanilla UCB | Structured stochastic bandits · Experiments across unconstrained, categorised, linear, unimodal, and sparse structures | regret | Mixed |
| Use OSSB instead of vanilla UCB | OSSB · Structured bandit experiments | regret | Mixed |
| Use OSSB on a structure where its exploration test never triggers | OSSB · Structure in Figure [ref] | regret | Hurt |
Closest papers by meaning
- Greedy Algorithms for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure (NeurIPS 2025 · similarity 0.91)
- Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints (NeurIPS 2024 · similarity 0.90)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.90)
- Adaptive Regret for Bandits Made Possible: Two Queries Suffice (ICLR 2024 · similarity 0.90)
- p-Mean Regret for Stochastic Bandits (AAAI 2025 · similarity 0.90)
- Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates (NeurIPS 2024 · similarity 0.89)
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.