Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Scalar confidence on the complete terminal history

Proved
LG2021.Concentration.estimatorGood_full_scalar

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

convex-analysisonline-learningprobabilitystochastic-optimization

Fix d,n≥1d,n\ge1d,n≥1, D≥0D\ge0D≥0, a compact convex legal set with pairwise diameter bound DDD, and the published configuration. Assume a one-Lipschitz loss with unit range on the legal set and the normalized adaptive noise condition. Let N≤nN\le nN≤n and 2N≤n2N\le n2N≤n. For a complete nnn-observation history, suppose all candidate norms obey the configured bound and its first 2N2N2N observations lie in the published event estimatorGood\texttt{estimatorGood}estimatorGood. Then every scalar estimate at every healthy actual trace state p<Np<Np<N and every candidate differs from its true surrogate gap by at most the published confidence radius at the actual sample count.

This is a deterministic implication about the complete terminal history. It connects the paired-prefix confidence event to the estimates used by the actual policy. The probability cost of that event is supplied separately by the simultaneous estimator-failure theorem.

This is a formalization auxiliary for Algorithms 1–2 and their probability analysis in Tor Lattimore and András György, Improved Regret for Zeroth-Order Stochastic Convex Bandits, COLT 2021, PMLR 134, Lemma 4 and Sections 5–7. The implementation and event predicates are published definitions; the guarantee is proved in this theorem. Adaptive observation kernels and exact finite-history semantics are explicit formal interfaces. Statistical concentration and regret claims are not assumed by the implementation definitions.

Preamble
import Mathlib
import Definitions.Def_LG2021_Policy

open LG2021 LG2021.Algorithm LG2021.Concentration BilateralProfitMHR MeasureTheory ProbabilityTheory Set Metric
Formal statement
theorem LG2021.Concentration.estimatorGood_full_scalar {d n u N : ℕ} (hd : 0 < d) (hn : 0 < n)
    {D : ℝ} (hD : 0 ≤ D) {K : Set (Space d)} (hK : IsCompact K) (hcv : Convex ℝ K)
    (hdiam : ∀ x ∈ K, ∀ y ∈ K, dist x y ≤ D) (R : ℝ) (anchor : Space d) (ha : anchor ∈ K)
    (ν : ObsKernel (Space d)) (hνm : ν.IsMeasurable) (F : Space d → ℝ)
    (hLip : LipschitzWith 1 F) (hF : ∀ x ∈ K, F x ∈ Set.Icc (0 : ℝ) 1)
    (hν : CorollaryTransport.UnitNoiseCond K F ν) (hN : N ≤ n) (hpair : 2*N ≤ n)
    (w : Seed d u n × (Fin n → ℝ)) (v : Fin (d+1) → Space d)
    (hseed : ∀ a k, ‖seedCandidates w.1 a k‖ ≤ (oracleConfig d D n).radius / (2*(d : ℝ)))
    (hg : historyPrefix hpair w ∈ estimatorGood (oracleConfig d D n) K hK.isClosed.measurableSet R anchor ν hνm N v) :
    ∀ p < N, (interior (codedBody K (traceState (oracleConfig d D n) K R w.1 (terminalPairs w.2) p).1)).Nonempty → ∀ k,
      |traceScalar (oracleConfig d D n) K R w.1 (terminalPairs w.2) p k -
        traceGap (oracleConfig d D n) K R w.1 (terminalPairs w.2) F p k| ≤
      confidenceRadius (oracleConfig d D n) u (traceSampleCount (oracleConfig d D n) K R w.1 (terminalPairs w.2) p) := by sorry
Source
Tor Lattimore and András György, Improved Regret for Zeroth-Order Stochastic Convex Bandits, COLT 2021, PMLR 134:2938–2964, 2021. Lemma 4, Algorithms 1–2, and Sections 5–7 (printed pp. 7–11). Concrete adaptive-policy confidence and finite-history formalization auxiliary.

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