Research map / Bandits and online learning / Multi-armed bandits
On Regret with Multiple Best Arms
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.
Closest papers by meaning
- Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory (AAAI 2020 · similarity 0.92)
- Lenient Regret for Multi-Armed Bandits (AAAI 2021 · similarity 0.92)
- Bandits with many optimal arms (NeurIPS 2021 · similarity 0.92)
- 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)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.90)
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.