mlsanityData to 7 Oct 2026

Thompson Sampling for Linear Bandit Problems with Normal-Gamma Priors

arXiv 2303.03348 ↗First posted 6 Mar 2023cs.LG cs.AI stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider Thompson sampling for linear bandit problems with finitely many independent arms, where rewards are sampled from normal distributions that are linearly dependent on unknown parameter vectors and with unknown variance. Specifically, with a Bayesian formulation we consider multivariate normal-gamma priors to represent environment uncertainty for all involved parameters. We show that our chosen sampling prior is a conjugate prior to the reward model and derive a Bayesian regret bound for Thompson sampling under the condition that the 5/2-moment of the variance distribution exist.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 21 references that are in the map. First posted on arXiv 6 Mar 2023.

Builds on

7 of 21 references.

References · 7

  1. 2019Introduction to Multi-Armed Banditscited by 475
  2. 2017A Tutorial on Thompson Samplingcited by 420
  3. 2013Learning to Optimize Via Posterior Samplingcited by 253
  4. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  5. 2020Thompson Sampling Algorithms for Mean-Variance Banditscited by 27
  6. 2013Prior-free and prior-dependent regret bounds for Thompson Samplingcited by 25
  7. 2021Information Directed Sampling for Sparse Linear Banditscited by 20

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2023The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models
  2. 2023Optimality of Thompson Sampling with Noninformative Priors for Pareto Bandits
  3. 2024Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
  4. 2021Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning
  5. 2018Nonparametric Gaussian Mixture Models for the Multi-Armed Bandit
  6. 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
  7. 2025Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
  8. 2026BFTS: Thompson Sampling with Bayesian Additive Regression Trees