Prior Diffusiveness and Regret in the Linear-Gaussian Bandit

Read full text
Authors: Yifan Zhu, John C. Duchi, Benjamin Van Roy
Cited by: 0

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.

Fields of Study & Subjects

Advanced Bandit Algorithms Research Stochastic Gradient Optimization Techniques Gaussian Processes and Bayesian Inference

Publication details

Journal / source
arXiv (Cornell University)
Publication date
5 January 2026
Document type
Preprint