Adaptive Variance Inflation in Thompson Sampling: Efficiency, Safety, Robustness, and Beyond
Feng Zhu, David Simchi-Levi
Abstract
Thompson Sampling (TS) has emerged as a powerful algorithm for sequential decision-making, with strong empirical success and theoretical guarantees. However, it has been shown that its behavior under stringent safety and robustness criteria — such as safety of cumulative regret distribution and robustness to model mis-specification — can sometimes perform poorly. In this work, we try to address these aspects through the lens of adaptive variance inflation for Gaussian Thompson Sampling. Our one-line change introduces a time-and arm-dependent inflation factor into the sampling variance, and yields several compelling benefits. The resulting policy achieves provably worst-case optimal expected regret and worst-case optimal fast-decaying regret tail bounds, even in the presence of heavy-tailed (sub-exponential) noise or mis-specified environments. The policy is also robust to mis-specified noise variances. Beyond cumulative regret, we further demonstrate that our method ensures strong post-experiment guarantees: simple regret and estimation error per arm exhibit fast-decaying tail probabilities, contributing to more reliable and robust downstream decisions. Finally, we extend our policy to incorporate settings with unknown arm-specific variances and empirically validate the consistent performance of our approach across a range of environments.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6a5d6e55-b787-40cb-8973-6dcb62cdc27eBuilds on4
- MOTS: Minimax Optimal Thompson SamplingTianyuan Jin, Pan Xu, Jieming Shi, Xiaokui Xiao et al.ICML 2021 · 37 citations
- Revisiting Simple Regret: Fast Rates for Returning a Good ArmYao Zhao, Connor Stephens, Csaba Szepesvári, Kwang-Sung JunICML 2023 · 23 citations
- Stochastic Multi-armed Bandits: Optimal Trade-off among Optimality, Consistency, and Tail RiskDavid Simchi-Levi, Zeyu Zheng, Feng ZhuNeurIPS 2023 · 8 citations
- A Simple and Optimal Policy Design for Online Learning with Safety against Heavy-tailed RiskDavid Simchi-Levi, Zeyu Zheng, Feng ZhuNeurIPS 2022 · 7 citations
Related papers
- Only Pay for What Is Uncertain: Variance-Adaptive Thompson SamplingAadirupa Saha, Branislav KvetonICLR 2024 · 3 citations
- Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed BanditsJiatai Huang, Yan Dai, Longbo HuangICML 2022 · 24 citations
- Noise-Adaptive Thompson Sampling for Linear Contextual BanditsRuitu Xu, Yifei Min, Tianhao WangNeurIPS 2023 · 19 citations
- The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit ModelsJongyeong Lee, Chao-Kai Chiang, Masashi SugiyamaAAAI 2024 · 1 citation
- Optimality of Thompson Sampling with Noninformative Priors for Pareto BanditsJongyeong Lee, Junya Honda, Chao-Kai Chiang, Masashi SugiyamaICML 2023 · 4 citations
