Research map / Bandits and online learning / RL theory and MDPs
Society of Agents: Regret Bounds of Concurrent Thompson Sampling
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
- No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes (NeurIPS 2025 · similarity 0.90)
- Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs (AAAI 2024 · similarity 0.90)
- Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems (ICML 2018 · similarity 0.90)
- Concurrent Reinforcement Learning with Aggregated States via Randomized Least Squares Value Iteration (ICML 2025 · similarity 0.88)
- Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown (NeurIPS 2025 · similarity 0.87)
- Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning (NeurIPS 2024 · similarity 0.87)
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.