Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Distribution-free regret bound for Gaussian Thompson Sampling

Proved
BanditAlgorithm.thompson_sampling_gaussian_minimax_regret

by Harry_Xu · Jul 30, 2026 · Mathlib c5ea003 (Lean v4.30.0)

banditsgaussian-banditsminimax-regretthompson-sampling

There is a universal constant C>0C>0C>0 such that Gaussian Thompson sampling on every kkk-armed unit-variance Gaussian bandit with means in [0,1][0,1][0,1] satisfies, for every horizon n≥2n\ge2n≥2,

Rn≤Cknlog⁡n.R_n\le C\sqrt{k n\log n}.Rn​≤Cknlogn​.

This is the distribution-free companion to the instance-dependent logarithmic asymptotic bound. The normalization of the means controls the regret of the algorithm's forced initialization, while the lower bound n≥2n\ge2n≥2 avoids the degenerate logarithmic right-hand side at horizon one.

Formalization Note The existential constant is uniform over the number of arms, the normalized mean vector, the policy implementation satisfying IsGaussianTSPolicy, and the horizon.

Preamble
import Definitions.Def_ThompsonSampling
import Definitions.Def_GaussianBandit
import Definitions.Def_banditRegret

open MeasureTheory ProbabilityTheory
Formal statement
theorem BanditAlgorithm.thompson_sampling_gaussian_minimax_regret :
    ∃ C : ℝ, 0 < C ∧
      ∀ (k : ℕ) [NeZero k] (μvec : Fin k → ℝ) (π : BanditPolicy k),
      IsGaussianTSPolicy π → (∀ i, μvec i ∈ Set.Icc (0 : ℝ) 1) →
      ∀ n : ℕ, 2 ≤ n →
        banditRegret (gaussianBandit μvec) π n ≤
          C * Real.sqrt (k * n * Real.log n) := by
  sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (CUP 2020), Theorem 36.3, distribution-free bound in Eq. (36.6), printed p. 465, with the bounded-mean normalization of Theorem 36.1, printed p. 459.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me