Research map / Bandits and online learning / Contextual bandits and Thompson sampling
An Information-Theoretic Analysis of Nonstationary Bandit Learning
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| vary common-variation timescale τcm while holding idiosyncratic variation fixed | Thompson sampling and Sliding-Window TS · Two-armed nonstationary bandit simulation | per-period regret | No clear effect |
Closest papers by meaning
- Block Optimism for Nonstationary Bandits with Latent Linear Dynamics (NeurIPS 2026 · similarity 0.90)
- Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits (NeurIPS 2025 · similarity 0.89)
- Non-stationary Bandit Convex Optimization: A Comprehensive Study (NeurIPS 2025 · similarity 0.89)
- Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates (NeurIPS 2024 · similarity 0.89)
- Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits (NeurIPS 2025 · similarity 0.89)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.88)
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.