Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma G.5 — exploration contribution of GIA-FTRL under the fixed loss vector

Proved
IAFTRL.lemma_G_5

by Canzhe Zhao · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

bandit-algorithmslinear-banditsonline-learning

Setting. The setting is that of Proposition G.1 (proposition_G_1_anc):

  • a GIA-FTRL run on a compact generator B\mathcal BB of a compact spanning A⊆Bd\mathcal A\subseteq\mathbb B^dA⊆Bd, with k≥1k\ge1k≥1;
  • a sharp instance (θ,a∗)(\theta,a^*)(θ,a∗) with ∥θ∥A≤1\|\theta\|_{\mathcal A}\le1∥θ∥A​≤1 and unique optimal action a∗∈Aa^*\in\mathcal Aa∗∈A;
  • the corrupted regime ∑t<T∥θt−θ∥A≤C\sum_{t<T}\|\theta_t-\theta\|_{\mathcal A}\le C∑t<T​∥θt​−θ∥A​≤C almost surely.

The sums I1,…,I4I_1,\dots,I_4I1​,…,I4​ are those of the definition IAFTRL_GTerms.

Claim. There is JJJ such that for every finite feasible centered sampling allocation nnn on B\mathcal BB there is MMM, independent of TTT, CCC and the run, with

I3=∑t=1TE⟨pt−qt,Δ⟩≤16 B Crat4 cctrnlog⁡(eT)+M+JClog⁡(e+C),I_3=\sum_{t=1}^T\mathbb E\langle p_t-q_t,\Delta\rangle\le16\,B\,C_{\mathrm{rat}}^4\,c^n_{\mathrm{ctr}}\log(eT)+M+J\sqrt C\log(e+C),I3​=t=1∑T​E⟨pt​−qt​,Δ⟩≤16BCrat4​cctrn​log(eT)+M+JC​log(e+C),

where B=236(d+1)B=2^{36}(d+1)B=236(d+1) and Crat=64C_{\mathrm{rat}}=64Crat​=64. This is Lemma G.5 combined with the weighted failure estimate.

Preamble
import Mathlib
import Definitions.Def_IAFTRL_LinEnv
import Definitions.Def_IAFTRL_GIAFTRL
import Definitions.Def_IAFTRL_GTerms
Formal statement
namespace IAFTRL

open MeasureTheory

/-- **Lemma G.5 (Exploration contribution under the fixed loss vector).** Zhao–Tan, *Best-of-Both-Worlds FTRL for Linear Bandits* (STOC submission version), Lemma G.5,
p.131: "For a fixed feasible centered sampling allocation `n_des` …
`I₃ := Σ_t E[⟨p_t − q_t, Δ⟩] ≤ 16 B C_rat⁴ c^{n_des}_ctr log(eT) + M_{3,θ,n_des} + 8d E_T`",
combined with the weighted failure estimate (G.11)–(G.13) (Lemma G.26); `B = 2^36(d+1)`,
`C_rat = 64`.

In the sharp corrupted setting there is `J` such that for every finite feasible centered
allocation `n` on `ℬ` there is `M` (independent of `T`, `C` and the run) with
`I₃ ≤ 16 B C_rat⁴ c^n_ctr log(eT) + M + J √C log(e + C)`. -/
theorem lemma_G_5 {d : ℕ} (hd : 1 ≤ d) (𝒜 ℬ : Set (Fin d → ℝ)) (e : ℕ → Fin d → ℚ)
    (h𝒜 : IsCompact 𝒜) (hℬ : IsCompact ℬ) (hgen : IsGenerator 𝒜 ℬ)
    (hball : ∀ a ∈ 𝒜, a ⬝ᵥ a ≤ 1) (hspan : Submodule.span ℝ 𝒜 = ⊤) (hk : 1 ≤ kdim ℬ)
    (he : Function.Surjective e) (θ astar : Fin d → ℝ) (hθ : setNorm 𝒜 θ ≤ 1)
    (hastar : astar ∈ 𝒜) (huniq : ∀ a ∈ 𝒜, a ≠ astar → astar ⬝ᵥ θ < a ⬝ᵥ θ)
    (hsharp : IsSharp 𝒜 θ astar) :
    ∃ J : ℝ, ∀ n : Measure (Fin d → ℝ), IsCtrAlloc ℬ θ astar n →
      ∃ M : ℝ, ∀ {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
        (T : ℕ) (C : ℝ) (R : GRun d Ω), 1 ≤ T → 0 ≤ C →
        IsGIAFTRLRun P 𝒜 ℬ e T R → IsCorruptedG P 𝒜 θ C T R →
        exploI3 P ℬ e T R θ astar ≤
          16 * gB d * 64 ^ 4 * ctrCost θ astar n * Real.log (Real.exp 1 * T) + M +
            J * Real.sqrt C * Real.log (Real.exp 1 + C) := by sorry

end IAFTRL
Source
Zhao–Tan, Best-of-Both-Worlds FTRL for Linear Bandits: The Interplay of Information Acquisition, Corruption, and Geometry (STOC submission version; arXiv:2611.01299), Appendix G.4, Lemma G.5, and (G.11)–(G.13)

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