Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1 — WM mistake bound from initial and final weights

Proved
WeightedMajority.Basic.theorem_2_1

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

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

Let WM use any factor 0≤β<10\le\beta<10≤β<1 and any strictly positive initial weights on a finite pool. On an arbitrary finite sequence of binary predictions and labels, let mmm be the number of mistakes made by the master, and let W0W_0W0​ and WTW_TWT​ be the initial and final total pool weights. Every legal WM run with WT>0W_T>0WT​>0 satisfies

m≤log⁡(W0/WT)log⁡ ⁣(2/(1+β)).m\le\frac{\log(W_0/W_T)}{\log\!\left(2/(1+\beta)\right)}.m≤log(2/(1+β))log(W0​/WT​)​.

The bound measures the master's mistakes by the decrease in the pool's total weight and applies without a distributional assumption on the sequence.

Formalization Note Both logarithms are natural; their common base cancels, as specified on p. 220. When β=0\beta=0β=0 and WT=0W_T=0WT​=0, the paper says the logarithmic bound becomes vacuous (infinite). The explicit WT>0W_T>0WT​>0 condition excludes exactly that case while retaining the Halving Algorithm case β=0\beta=0β=0 whenever its final weight is positive.

Preamble
import Mathlib
import Definitions.Def_WeightedMajority_Basic_IsWMRun
Formal statement
namespace WeightedMajority.Basic

/-- Littlestone and Warmuth's Theorem 2.1. -/
theorem theorem_2_1 {n T : ℕ} (β : ℝ) (hβ₀ : 0 ≤ β) (hβ₁ : β < 1)
    (initial : Fin n → ℝ) (hinitial : ∀ i, 0 < initial i)
    (x : Fin T → Fin n → Bool) (label : Fin T → Bool)
    (w : ℕ → Fin n → ℝ) (prediction : Fin T → Bool)
    (hrun : IsWMRun β initial x label w prediction)
    (hfinal : 0 < totalWeight w T) :
    (mistakeCount prediction label : ℝ) ≤
      Real.log (totalWeight w 0 / totalWeight w T) /
        Real.log (2 / (1 + β)) := by sorry

end WeightedMajority.Basic
Source
Littlestone and Warmuth, The Weighted Majority Algorithm, Information and Computation 108(2) (1994), p. 221, Theorem 2.1; 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