Research map / Bandits and online learning / Multi-armed bandits
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed 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.
Closest papers by meaning
- MOTS: Minimax Optimal Thompson Sampling (ICML 2021 · similarity 0.92)
- Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling (NeurIPS 2026 · similarity 0.92)
- Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox (NeurIPS 2024 · similarity 0.91)
- Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits (NeurIPS 2024 · similarity 0.90)
- The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models (AAAI 2024 · similarity 0.89)
- Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits (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.