Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.3 — absolute loss under the upper update bound

Proved
WeightedMajority.Continuous.lemma_5_3

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

loss-boundonline-learningp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1weighted-majority

Under Lemma 5.2's assumptions, with positive final total weight, the weighted mean predictions γ(j)\gamma^{(j)}γ(j) have total absolute loss bounded by

∑j∣γ(j)−ρ(j)∣≤ln⁡(winit/wfin)1−β.\sum_j|\gamma^{(j)}-\rho^{(j)}|\le\frac{\ln(w_{\mathrm{init}}/w_{\mathrm{fin}})}{1-\beta}.j∑​∣γ(j)−ρ(j)∣≤1−βln(winit​/wfin​)​.

This inequality applies to any nonnegative weight sequence satisfying the upper update bound, independently of how its update factors were selected.

Formalization Note Positive final weight selects the finite-valued case of the paper's bound; when final weight vanishes, its right side is interpreted as infinite.

Preamble
import Definitions.Def_WeightedMajority_Continuous_WMCRun
Formal statement
namespace WeightedMajority.Continuous

/-- Lemma 5.3, p. 236: the absolute loss bound under Lemma 5.2's conditions. -/
theorem lemma_5_3 {n t : ℕ} (beta : ℝ) (w : ℕ → Fin n → ℝ)
    (x : Fin t → Fin n → ℝ) (rho : Fin t → ℝ)
    (h : PotentialConditions beta w x rho) (hfin : 0 < WeightedMajority.Basic.totalWeight w t) :
    masterLoss w x rho ≤
      Real.log (WeightedMajority.Basic.totalWeight w 0 / WeightedMajority.Basic.totalWeight w t) / (1 - beta) := by sorry

end WeightedMajority.Continuous
Source
Littlestone and Warmuth, The Weighted Majority Algorithm, Information and Computation 108 (1994), p. 236, Lemma 5.3; https://doi.org/10.1006/inco.1994.1009
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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