Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.2 — total absolute loss of WMC

Proved
WeightedMajority.Continuous.theorem_5_2

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

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

Let WMC run on any finite sequence of trials with labels in [0,1][0,1][0,1], using a finite nonempty pool whose predictions lie in [0,1][0,1][0,1]. Every initial weight is positive; at each trial, WMC predicts the pool's current weighted mean and updates each weight by any factor permitted by equation (5.1), with 0≤β<10\le\beta<10≤β<1. If the final total weight is positive, its total absolute loss mmm satisfies

m≤ln⁡(winit/wfin)1−β.m\le\frac{\ln(w_{\mathrm{init}}/w_{\mathrm{fin}})}{1-\beta}.m≤1−βln(winit​/wfin​)​.

The result holds for every permitted factor choice and every finite instance and label sequence. It is the continuous-prediction counterpart of the paper's binary Weighted Majority bound.

Formalization Note The instances themselves are implicit in the supplied expert predictions, since the inequality uses them only through those predictions. The paper's bound is infinite when wfin=0w_{\mathrm{fin}}=0wfin​=0; this real-valued statement covers its finite case.

Preamble
import Definitions.Def_WeightedMajority_Continuous_WMCRun
Formal statement
namespace WeightedMajority.Continuous

/-- Theorem 5.2, p. 236: the total absolute loss of any WMC run. -/
theorem theorem_5_2 {n t : ℕ} (beta : ℝ) (w : ℕ → Fin n → ℝ)
    (x : Fin t → Fin n → ℝ) (rho : Fin t → ℝ)
    (h : IsWMCRun 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, Theorem 5.2; 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