The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models
Jongyeong Lee, Chao-Kai Chiang, Masashi Sugiyama
摘要
Thompson sampling (TS) has been known for its outstanding empirical performance supported by theoretical guarantees across various reward models in the classical stochastic multi-armed bandit problems. Nonetheless, its optimality is often restricted to specific priors due to the common observation that TS is fairly insensitive to the choice of the prior when it comes to asymptotic regret bounds. However, when the model contains multiple parameters, the optimality of TS highly depends on the choice of priors, which casts doubt on the generalizability of previous findings to other models. To address this gap, this study explores the impact of selecting noninformative priors, offering insights into the performance of TS when dealing with new models that lack theoretical understanding. We first extend the regret analysis of TS to the model of uniform distributions with unknown supports, which would be the simplest non-regular model. Our findings reveal that changing noninformative priors can significantly affect the expected regret, aligning with previously known results in other multiparameter bandit models. Although the uniform prior is shown to be optimal, we highlight the inherent limitation of its optimality, which is limited to specific parameterizations and emphasizes the significance of the invariance property of priors. In light of this limitation, we propose a slightly modified TS-based policy, called TS with Truncation (TS-T), which can achieve the asymptotic optimality for the Gaussian models and the uniform models by using the reference prior and the Jeffreys prior that are invariant under one-to-one reparameterizations. This policy provides an alternative approach to achieving optimality by employing fine-tuned truncation, which would be much easier than hunting for optimal priors in practice.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- MOTS: Minimax Optimal Thompson SamplingTianyuan Jin, Pan Xu, Jieming Shi, Xiaokui Xiao 等ICML 2021 · 被引用 37 次
- Thompson Sampling with Less Exploration is Fast and OptimalTianyuan Jin, Xianglin Yang, Xiaokui Xiao, Pan XuICML 2023 · 被引用 23 次
- Optimality of Thompson Sampling with Noninformative Priors for Pareto BanditsJongyeong Lee, Junya Honda, Chao-Kai Chiang, Masashi SugiyamaICML 2023 · 被引用 4 次
相关 Paper
- Lenient Regret for Multi-Armed BanditsNadav Merlis, Shie MannorAAAI 2021 · 被引用 10 次
- Only Pay for What Is Uncertain: Variance-Adaptive Thompson SamplingAadirupa Saha, Branislav KvetonICLR 2024 · 被引用 3 次
- Adaptive Variance Inflation in Thompson Sampling: Efficiency, Safety, Robustness, and BeyondFeng Zhu, David Simchi-LeviNeurIPS 2025 · 被引用 3 次
- Statistical Efficiency of Thompson Sampling for Combinatorial Semi-BanditsPierre Perrault, Etienne Boursier, Michal Valko, Vianney PerchetNeurIPS 2020 · 被引用 45 次
- No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian ProcessesJasmine Bayrooti, Sattar Vakili, Amanda Prorok, Carl Henrik EkNeurIPS 2025 · 被引用 5 次
