Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problems
Young Hun Jung, Ambuj Tewari
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use Whittle or myopic policy as competitor instead of the best fixed arm policy | restless bandit benchmark · Gilbert-Elliott channel, K=4, N=2 | value per episode: 50.2 -> 55.6 | Improved |
| Thompson sampling with different policy mappings (fixed arm, myopic, Whittle) | Thompson sampling · Gilbert-Elliott channel, K=8, N=3 | Bayesian regret | No clear effect |
Closest papers by meaning
- Tightening Regret Lower and Upper Bounds in Restless Rising Bandits (NeurIPS 2025 · similarity 0.91)
- Online Restless Bandits with Unobserved States (ICML 2023 · similarity 0.91)
- Approximations of the Restless Bandit Problem (JMLR 2019 · similarity 0.91)
- Lenient Regret for Multi-Armed Bandits (AAAI 2021 · similarity 0.91)
- The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models (AAAI 2024 · similarity 0.90)
- Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown (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.
