Lemma 9, eq. (9):
ProvedStabGen.Hypothesis.lemma9_looalgorithmic-stabilitylearning-theoryp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a probability distribution on , let the cost satisfy , and let be a symmetric deterministic learning algorithm whose losses are measurable. Let with and let be independent of . Then for every index ,
The expectation on the right is exactly the quantity that hypothesis stability (Definition 3) bounds, so this inequality turns hypothesis stability into a second-moment bound for the leave-one-out estimator.
Formalization Note Lemma 9 is stated for with , which presupposes ; this is a hypothesis here. The expectation is the integral against .
Preamble
import Mathlib import Definitions.Def_FoundationsML_Stability_Loss import Definitions.Def_FoundationsML_Stability_EmpiricalError import Definitions.Def_FoundationsML_Stability_GeneralizationError import Definitions.Def_StabGen_Hypothesis_Setting open MeasureTheory
Formal statement
namespace StabGen.Hypothesis
open FoundationsML.Stability
theorem lemma9_loo {X Y Y' : Type*} [MeasurableSpace X] [MeasurableSpace Y]
(D : Measure (X × Y)) [IsProbabilityMeasure D] (L : Y' → Y → ℝ) (M : ℝ)
(hL : ∀ (y' : Y') (y : Y), 0 ≤ L y' y ∧ L y' y ≤ M)
(A : LearningAlgorithm X Y Y')
(hA : ∀ n : ℕ, Measurable (fun p : (Fin n → X × Y) × (X × Y) =>
Loss L (A (trainingSet p.1)) p.2))
(m : ℕ) (hm : 2 ≤ m) (i : Fin m) :
∫ S : Fin m → X × Y,
(GeneralizationError D L (A (trainingSet S)) - looError L A S) ^ 2
∂(Measure.pi fun _ : Fin m => D)
≤ M ^ 2 / (2 * (m : ℝ))
+ 3 * M * ∫ p : (Fin m → X × Y) × (X × Y),
|Loss L (A (trainingSet p.1)) p.2 - Loss L (A (removeAt p.1 i)) p.2|
∂((Measure.pi fun _ : Fin m => D).prod D) := by sorry
end StabGen.Hypothesis
Source
Bousquet & Elisseeff, Stability and Generalization, JMLR 2 (2002), p. 505, Lemma 9, eq. (9); proof in Appendix A, pp. 520–523
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.