Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
Not on the map. Why?
Abstract (arXiv)
We study Gaussian Process Thompson Sampling (GP-TS) for sequential decision-making over compact, continuous action spaces and provide a frequentist regret analysis based on fractional Gaussian process posteriors, without relying on domain discretization as in prior work. We show that the variance inflation commonly assumed in existing analyses of GP-TS can be interpreted as Thompson Sampling with respect to a fractional posterior with tempering parameter α ∈ (0,1). We derive a kernel-agnostic regret bound expressed in terms of the information gain parameter γt and the posterior contraction rate εt, and identify conditions on the Gaussian process prior under which εt can be controlled. As special cases of our general bound, we recover regret of order tildeO(T^frac12) for the squared exponential kernel, tildeO(T^frac2nu+3d2(2nu+d) ) for the Mat'ern-nu kernel, and a bound of order tildeO(T^frac2nu+3d2(2nu+d)) for the rational quadratic kernel. Overall, our analysis provides a unified and discretization-free regret framework for GP-TS that applies broadly across kernel classes.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 25 references that are in the map. First posted on arXiv 16 Feb 2026.
Builds on
8 of 25 references.
References · 8
- 2017On Kernelized Multi-armed Banditscited by 348
- 2018Gaussian Processes and Kernel Methods: A Review on Connections and Equivalencescited by 188
- 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 156
- 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 136
- 2017Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimizationcited by 77
- 2020Distributionally Robust Bayesian Optimizationcited by 60
- 2021Misspecified Gaussian Process Bandit Optimizationcited by 52
- 2026Robust Bayesian Optimization via Tempered Posteriorscited by 3
Built on by
Not cited yet.