mlsanityData to 7 Oct 2026

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit

arXiv 2601.02022 ↗First posted 5 Jan 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We prove that Thompson sampling exhibits tildeO(σ d √T + d r √Tr(Sigma0)) Bayesian regret in the linear-Gaussian bandit with a N(μ0, Sigma0) prior distribution on the coefficients, where d is the dimension, T is the time horizon, r is the maximum ℓ2 norm of the actions, and σ2 is the noise variance. In contrast to existing regret bounds, this shows that to within logarithmic factors, the prior-dependent ``burn-in'' term d r √Tr(Sigma0) decouples additively from the minimax (long run) regret σ d √T. Previous regret bounds exhibit a multiplicative dependence on these terms. We establish these results via a new ``elliptical potential'' lemma, and also provide a lower bound indicating that the burn-in term is unavoidable.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 23 references that are in the map. First posted on arXiv 5 Jan 2026.

Builds on

8 of 23 references.

References · 8

  1. 2017On Kernelized Multi-armed Banditscited by 348
  2. 2013Learning to Optimize Via Posterior Samplingcited by 253
  3. 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
  4. 2021Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDPcited by 45
  5. 2018An Information-Theoretic Analysis for Thompson Sampling with Many Actionscited by 35
  6. 2020The Elliptical Potential Lemma Revisitedcited by 23
  7. 2022Norm-Agnostic Linear Banditscited by 12
  8. 2025Linear Bandits on Ellipsoids: Minimax Optimal Algorithmscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.