Prior Diffusiveness and Regret in the Linear-Gaussian Bandit

Yifan Zhu, John C. Duchi, Benjamin Van Roy
1/5/2026
cs.LG

No confident code implementation found for this paper.

Abstract

We prove that Thompson sampling exhibits $\tilde{O}(σd \sqrt{T} + d r \sqrt{\mathrm{Tr}(Σ_0)})$ Bayesian regret in the linear-Gaussian bandit with a $\mathcal{N}(μ_0, Σ_0)$ prior distribution on the coefficients, where $d$ is the dimension, $T$ is the time horizon, $r$ is the maximum $\ell_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 \sqrt{\mathrm{Tr}(Σ_0)}$ decouples additively from the minimax (long run) regret $σd \sqrt{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.

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. Any repos shown below are weak matches — 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{zhu2026prior,
  title  = {Prior Diffusiveness and Regret in the Linear-Gaussian Bandit},
  author = {Yifan Zhu and John C. Duchi and Benjamin Van Roy},
  year   = {2026},
  eprint = {2601.02022},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.02022v1}
}

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/2601.02022.svg)](https://codeofpaper.com/paper/2601.02022)

Discussion