Optimism Stabilizes Thompson Sampling for Adaptive Inference
Not on the map. Why?
Abstract (arXiv)
Thompson sampling (TS) is widely used for stochastic multi-armed bandits, yet its inferential properties under adaptive data collection are subtle. Classical asymptotic theory for sample means can fail because arm-specific sample sizes are random and coupled with the rewards through the action-selection rule. We study adaptive inference for Thompson sampling with Gaussian randomized indices in K-armed stochastic bandits with independent sub-Gaussian reward noises, and identify optimism as a key mechanism for restoring stability, meaning that each arm's pull count concentrates around a deterministic scale. This stability yields asymptotically valid Wald inference despite adaptive sampling. First, we prove that variance-inflated TS is stable for any K ≥ 2, including the challenging regime where multiple arms are optimal, with asymptotically uniform allocation over optimal arms and sharp logarithmic pull-count asymptotics for suboptimal arms. This resolves the K-armed extension question raised by citethalder2025stable, using new winner-map and Lyapunov-drift techniques to control allocation among multiple optimal arms. Second, we analyze an alternative optimistic modification that keeps the Gaussian index variance unchanged but adds an explicit mean bonus to the index center, and establish a similar stability conclusion. In summary, suitably implemented optimism stabilizes Thompson sampling and enables asymptotically valid Wald inference in multi-armed bandits, while incurring only a mild additional regret cost.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 33 of its 51 references that are in the map. First posted on arXiv 5 Feb 2026.
Builds on
33 of 51 references.
References · 33
- 2017A Tutorial on Thompson Samplingcited by 433
- 2013Learning to Optimize Via Posterior Samplingcited by 256
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 229
- 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
- 2014Generalization and Exploration via Randomized Value Functionscited by 112
- 2019Frequentist Regret Bounds for Randomized Least-Squares Value Iterationcited by 101
- 2019Confidence Intervals for Policy Evaluation in Adaptive Experimentscited by 95
- 2016Statistical Inference for Model Parameters in Stochastic Gradient Descentcited by 71
- 2021Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learningcited by 66
- 2020Inference for Batched Banditscited by 63
- 2017Ensemble Samplingcited by 62
- 2022GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP, and Beyondcited by 46
21 more
- 2021Statistical Inference with M-Estimators on Adaptively Collected Datacited by 40
- 2022Model-based RL with Optimistic Posterior Sampling: Structural Conditions and Sample Complexitycited by 32
- 2022A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learningcited by 31
- 2021A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithmscited by 30
- 2021A Statistical Analysis of Polyak-Ruppert Averaged Q-learningcited by 29
- 2020MOTS: Minimax Optimal Thompson Samplingcited by 28
- 2021Online Multi-Armed Bandits with Adaptive Inferencecited by 22
- 2023Online Statistical Inference for Nonlinear Stochastic Approximation with Markovian Datacited by 20
- 2024UCB algorithms for multi-armed bandits: Precise regret and adaptive inferencecited by 19
- 2024Statistical Inference for Policy Evaluation with Temporal Difference Learningcited by 15
- 2018HiGrad: Uncertainty Quantification for Online Learning and Stochastic Approximationcited by 13
- 2022The Typical Behavior of Bandit Algorithmscited by 12
- 2024Inference with the Upper Confidence Bound Algorithmcited by 12
- 2022Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Banditscited by 11
- 2025Uncertainty quantification for Markov chain induced martingales with application to temporal difference learningcited by 11
- 2025Stable Thompson Sampling: Valid Inference via Variance Inflationcited by 8
- 2025Statistical Inference under Adaptive Sampling with LinUCBcited by 7
- 2026SGD with Dependent Data: Optimal Estimation, Regret, and Inferencecited by 6
- 2026Thompson sampling: Precise arm-pull dynamics and adaptive inferencecited by 6
- 2024Allocation Stability and Wald Inference under Variance-Aware UCBcited by 4
- 2025Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stabilitycited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Toward the Optimal Regret-Instability Trade-off in Multi-Armed Bandits18 Aug 2026
- 2026Bandit Simulation for Average Reward Inference30 May 2026