Thompson Sampling for Linear Bandit Problems with Normal-Gamma Priors

Björn Lindenberg, Karl-Olof Lindahl
3/6/2023
cs.LGcs.AIstat.ML

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lindenberg2023thompson,
  title  = {Thompson Sampling for Linear Bandit Problems with Normal-Gamma Priors},
  author = {Björn Lindenberg and Karl-Olof Lindahl},
  year   = {2023},
  eprint = {2303.03348},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.03348v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.03348.svg)](https://codeofpaper.com/paper/2303.03348)

Discussion