English

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors

Statistics Theory 2026-02-17 v1 Machine Learning Optimization and Control Machine Learning Statistics Theory

Abstract

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)\alpha \in (0,1). We derive a kernel-agnostic regret bound expressed in terms of the information gain parameter γt\gamma_t and the posterior contraction rate ϵt\epsilon_t, and identify conditions on the Gaussian process prior under which ϵt\epsilon_t can be controlled. As special cases of our general bound, we recover regret of order O~(T12)\tilde{\mathcal{O}}(T^{\frac{1}{2}}) for the squared exponential kernel, O~(T2ν+3d2(2ν+d))\tilde{\mathcal{O}}(T^{\frac{2\nu+3d}{2(2\nu+d)}} ) for the Mat\'ern-ν\nu kernel, and a bound of order O~(T2ν+3d2(2ν+d))\tilde{\mathcal{O}}(T^{\frac{2\nu+3d}{2(2\nu+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.

Keywords

Cite

@article{arxiv.2602.14472,
  title  = {Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors},
  author = {Somjit Roy and Prateek Jaiswal and Anirban Bhattacharya and Debdeep Pati and Bani K. Mallick},
  journal= {arXiv preprint arXiv:2602.14472},
  year   = {2026}
}

Comments

34 pages, Submitted