Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§28.2.2: for ε < 1/(8√2) and m < d/(512ε²), every algorithm has excess risk ≥ ε with probability ≥ 1/8 under some D_b, so m(ε, 1/8) ≥ 8d/ε²

Proved
UnderstandingML.agnostic_lower_bound_d

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

agnostic-learningfundamental-theoremlower-boundsample-complexity

§28.2.2. We shall now prove that for every ϵ<1/(82)\epsilon < 1/(8\sqrt2)ϵ<1/(82​) we have that m(ϵ,δ)≥8dϵ2m(\epsilon, \delta) \ge \frac{8d}{\epsilon^2}m(ϵ,δ)≥ϵ28d​ (for δ≤1/8\delta \le 1/8δ≤1/8). Choosing ρ=8ϵ\rho = 8\epsilonρ=8ϵ we conclude that if m<d512ϵ2m < \frac{d}{512\epsilon^2}m<512ϵ2d​, then with probability of at least 1/81/81/8 we will have LD(A(S))−min⁡h∈HLD(h)≥ϵL_D(A(S)) - \min_{h \in H}L_D(h) \ge \epsilonLD​(A(S))−minh∈H​LD​(h)≥ϵ.

Formally: C={c1,…,cd}C = \{c_1, \dots, c_d\}C={c1​,…,cd​} shattered by HHH, and the distribution is one of the DbD_bDb​ with ρ=8ϵ\rho = 8\epsilonρ=8ϵ.

Preamble
import Definitions.Def_UnderstandingML_FundamentalProof

open MeasureTheory
Formal statement
namespace UnderstandingML

/-- **§28.2.2** (p. 398). For every `ε < 1/(8√2)`, `m(ε, 1/8) ≥ 8d/ε²`: choosing `ρ = 8ε`, if
`m < d/(512 ε²)` then for any algorithm `A` there is a distribution `D_b` such that with
probability of at least `1/8` over `S ∼ D^m`, `L_D(A(S)) − min_{h ∈ H} L_D(h) ≥ ε`. Here
`C = {c₁, …, c_d}` is shattered by `H`. -/
theorem agnostic_lower_bound_d {X : Type*} [MeasurableSpace X] [MeasurableSingletonClass X]
    (H : Set (X → Bool)) {d : ℕ} (C : Fin d → X) (hC : Function.Injective C)
    (hshat : ∀ g : Fin d → Bool, ∃ h ∈ H, ∀ i, h (C i) = g i) (ε : ℝ) (hε : 0 < ε)
    (hε2 : ε < 1 / (8 * Real.sqrt 2)) (m : ℕ) (hm : (m : ℝ) < d / (512 * ε ^ 2))
    (A : Learner (X × Bool) (X → Bool)) :
    ∃ b : Fin d → Bool, ENNReal.ofReal (1 / 8) ≤
      iidLaw (lowerBoundLaw C (8 * ε) b) m {S | ∃ h ∈ H,
        risk loss01 (lowerBoundLaw C (8 * ε) b) h + ε ≤
          risk loss01 (lowerBoundLaw C (8 * ε) b) (A m S)} := by sorry

end UnderstandingML
Source
Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms, Cambridge University Press 2014, doi:10.1017/CBO9781107298019, §28.2.2 p. 398 (via Lemma B.1 with ρ = 8ε)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me