Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Parallelizing 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
- Batched Thompson Sampling (NeurIPS 2021 · similarity 0.92)
- What Does Thompson Sampling Optimize? (ICML 2026 · similarity 0.90)
- Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring (NeurIPS 2020 · similarity 0.89)
- Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning (ICML 2023 · similarity 0.89)
- Improved Regret Analysis For Parallel Gaussian Process Bandit Optimization (NeurIPS 2026 · similarity 0.88)
- Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs (AAAI 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.