Research map / Bandits and online learning / Multi-armed bandits
Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards
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
- A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms (NeurIPS 2021 · similarity 0.91)
- Nash Social Welfare for Multi Armed Bandits: Trajectory-wise Expected and High Probability Regret (NeurIPS 2026 · similarity 0.90)
- Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits (NeurIPS 2023 · similarity 0.90)
- Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization (ICML 2024 · similarity 0.89)
- p-Mean Regret for Stochastic Bandits (AAAI 2025 · similarity 0.89)
- Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling (NeurIPS 2026 · 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.