Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit-parameter Gaussian-surrogate separation

Proved
LG2021.paper_strong_separation

by sim2000dg · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysisprobabilitystochastic-optimization

For a globally convex Lipschitz function f:Rd→Rf:\mathbb R^d\to\mathbb Rf:Rd→R, let X∼N(0,Id)X\sim N(0,I_d)X∼N(0,Id​) and define

m=Ef(X),gλ(z)=m+Ef((1−λ)X+λz)−mλ,Δr=m−min⁡∥x∥≤rf(x).m=\mathbb E f(X),\qquad g_\lambda(z)=m+\frac{\mathbb E f((1-\lambda)X+\lambda z)-m}{\lambda},\qquad \Delta_r=m-\min_{\|x\|\le r}f(x).m=Ef(X),gλ​(z)=m+λEf((1−λ)X+λz)−m​,Δr​=m−∥x∥≤rmin​f(x).

Let d,n≥1d,n\ge1d,n≥1 and D≥0D\ge0D≥0. Set

A=106(d+1)(D+1)(n+1),L=32log⁡A,r=105d22L,λ=(4⋅105dL)−1.A=10^6(d+1)(D+1)(n+1),\quad L=32\log A,\quad r=10^5d^2\sqrt{2L},\quad \lambda=(4\cdot10^5dL)^{-1}.A=106(d+1)(D+1)(n+1),L=32logA,r=105d22L​,λ=(4⋅105dL)−1.

Suppose fff has a global Lipschitz constant K≤dD/rK\le dD/rK≤dD/r. For Z=r2dX∥X∥Z=\frac{r}{2d}\frac{X}{\|X\|}Z=2dr​∥X∥X​ (zero at X=0X=0X=0),

Pr⁡ ⁣(gλ(Z)−f(0)≥Δr−1/n4096dd)≥124.\Pr\!\left(g_\lambda(Z)-f(0)\ge\frac{\Delta_r-1/n}{4096d\sqrt d}\right)\ge\frac1{24}.Pr(gλ​(Z)−f(0)≥4096dd​Δr​−1/n​)≥241​.

All parameter inequalities and the Gaussian tail estimate are proved. In particular, λ(r/(2d))2=12500d\lambda(r/(2d))^2=12500dλ(r/(2d))2=12500d. Nonsmooth convex losses are included.

To allow formalization of the separation argument in Tor Lattimore and András György, Improved Regret for Zeroth-Order Stochastic Convex Bandits, COLT 2021, PMLR 134:2938–2964, the derivation uses the centered Gaussian Hessian score XX⊤−IXX^\top-IXX⊤−I and a direct symmetric-density comparison in the part corresponding to Appendix E. Smoothing supplies the nonsmooth case, and all tail and parameter conditions are explicit. This statement concerns separation; the full regret theorem is stated separately.

Preamble
import Mathlib
import Definitions.Def_LG2021_GaussianSeparation
import Definitions.Def_LG2021_GaussianEstimators
open LG2021 LG2021.Concentration MeasureTheory ProbabilityTheory
Formal statement
theorem LG2021.paper_strong_separation {d n : ℕ} (hd : 0 < d) (hn : 0 < n)
    {D : ℝ} (hD : 0 ≤ D) {f : Space d → ℝ} {K : NNReal}
    (hK : (K : ℝ) ≤ paperLipschitz d D (parameterLog d D n))
    (hf : LipschitzWith K f) (hc : ConvexOn ℝ Set.univ f) :
    (1/24 : ℝ) ≤
      (sphereMeasure d (paperRadius d (parameterLog d D n)/(2*(d : ℝ)))).real {z |
        (gaussianGap (paperRadius d (parameterLog d D n)) f-1/(n : ℝ))/
          (4096*(d : ℝ)*Real.sqrt (d : ℝ)) ≤
        surrogate (paperLambda d (parameterLog d D n)) f z-f 0} := by sorry
Source
Tor Lattimore and András György, Improved Regret for Zeroth-Order Stochastic Convex Bandits, Proceedings of the 34th Conference on Learning Theory (COLT 2021), Proceedings of Machine Learning Research 134:2938–2964, 2021, Lemma 5 and Appendix E. Separation argument adapted for formalization.

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