Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
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
- Optimistic posterior sampling for reinforcement learning: worst-case regret bounds (NeurIPS 2017 · similarity 0.92)
- Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems (ICML 2018 · similarity 0.92)
- First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach (ICML 2022 · similarity 0.91)
- No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes (NeurIPS 2025 · similarity 0.90)
- Horizon-Free Regret for Linear Markov Decision Processes (ICLR 2024 · similarity 0.89)
- Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling (ICML 2024 · similarity 0.88)
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.