Research map / Bandits and online learning / RL theory and MDPs
Online Restless Bandits with Unobserved States
Bowen Jiang, Bo Jiang, Jian Li, TAO LIN, Xinbing Wang, Chenghu Zhou
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 |
|---|---|---|---|
| Thompson sampling with episodic explore-then-commit (TSEETC) instead of baselines | online restless bandits with unobserved states · Simulation (2 arms, 2 states, T=50000) | average accumulated regret: 580 vs 871 for SEEU (next best) | Improved |
| TSEETC vs SEEU across arm/state configurations | online restless bandits with unobserved states · Simulation (multiple arm/state configs) | average accumulated regret: lower regret in all listed configurations | Improved |
Closest papers by meaning
- Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback (ICML 2024 · similarity 0.88)
- Block Optimism for Nonstationary Bandits with Latent Linear Dynamics (NeurIPS 2026 · similarity 0.87)
- DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback (ICLR 2025 · similarity 0.87)
- Graph-Triggered Rising Bandits (ICML 2024 · similarity 0.87)
- Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback (ICML 2025 · similarity 0.87)
- Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown (NeurIPS 2025 · 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.
