Research map / Bandits and online learning / Multi-armed bandits
Adaptation to the Range in K-Armed Bandits
Hédi Hadiji, Gilles Stoltz
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints (JMLR 2022 · similarity 0.94)
- Adaptive Algorithms for Infinitely Many-Armed Bandits: A Unified Framework (JMLR 2026 · similarity 0.93)
- From Finite to Countable-Armed Bandits (NeurIPS 2020 · similarity 0.92)
- Bayesian Regret Minimization in Offline Bandits (ICML 2024 · similarity 0.91)
- Adaptive Regret for Bandits Made Possible: Two Queries Suffice (ICLR 2024 · similarity 0.90)
- Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards (NeurIPS 2025 · 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.
