AI Paper Atlas

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

NeurIPS 2019 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Thompson sampling analysis · 15 citations (OpenAlex)

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 changedWhereMeasuredEffect
use Whittle or myopic policy as competitor instead of the best fixed arm policyrestless bandit benchmark · Gilbert-Elliott channel, K=4, N=2value per episode: 50.2 -> 55.6Improved
Thompson sampling with different policy mappings (fixed arm, myopic, Whittle)Thompson sampling · Gilbert-Elliott channel, K=8, N=3Bayesian regretNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy