Theorem 26.12: for ‖x‖₂ ≤ R a.s., H = {‖w‖₂ ≤ B} and ℓ = φ(⟨w,x⟩,y) with ρ-Lipschitz φ bounded by c on [−BR,BR], w.p. ≥ 1−δ, ∀w∈H: L_D(w) ≤ L_S(w) + 2ρBR/√m + c√(2ln(2/δ)/m)
ProvedUnderstandingML.linear_l2_generalizationgeneralization-boundhilbert-spacelinear-predictorsrademacher-complexity
Theorem 26.12. Suppose that is a distribution over such that with probability we have that . Let and let be a loss function of the form (26.18) such that for all , is a -Lipschitz function and such that . Then, for any , with probability of at least over the choice of an i.i.d. sample of size ,
Formally: a separable Hilbert space with its Borel σ-algebra, jointly measurable, , .
Preamble
import Definitions.Def_UnderstandingML_Rademacher open MeasureTheory open scoped InnerProductSpace
Formal statement
namespace UnderstandingML
/-- **Theorem 26.12** (p. 384). Suppose that `D` is a distribution over `X × Y` such that with
probability `1` we have `‖x‖₂ ≤ R`. Let `H = {w : ‖w‖₂ ≤ B}` and let `ℓ(w, (x, y)) = φ(⟨w, x⟩, y)`
(26.18) with `a ↦ φ(a, y)` `ρ`-Lipschitz for all `y` and `max_{a ∈ [−BR, BR]} |φ(a, y)| ≤ c`. Then,
for any `δ ∈ (0, 1)`, with probability of at least `1 − δ` over the choice of an i.i.d. sample
of size `m`, `∀ w ∈ H, L_D(w) ≤ L_S(w) + 2ρBR/√m + c √(2 ln(2/δ)/m)`.
`X` is a separable Hilbert space with its Borel σ-algebra, `φ` is jointly measurable, `m ≥ 1`. -/
theorem linear_l2_generalization {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[MeasurableSpace E] [BorelSpace E] [SecondCountableTopology E] {Y : Type*} [MeasurableSpace Y]
(D : Measure (E × Y)) [IsProbabilityMeasure D] (R : ℝ) (hR : D {p | R < ‖p.1‖} = 0)
(B : ℝ) (hB : 0 ≤ B) (φ : ℝ → Y → ℝ) (hφm : Measurable (Function.uncurry φ)) (ρ : NNReal)
(hφ : ∀ y, LipschitzWith ρ (fun a ↦ φ a y)) (c : ℝ)
(hc : ∀ a y, |a| ≤ B * R → |φ a y| ≤ c) (m : ℕ) (hm : 0 < m) (δ : ℝ) (hδ : 0 < δ)
(hδ1 : δ < 1) :
iidLaw D m {S | ∃ w : E, ‖w‖ ≤ B ∧
empRisk (fun w p ↦ φ ⟪w, p.1⟫_ℝ p.2) S w + 2 * ρ * B * R / Real.sqrt m +
c * Real.sqrt (2 * Real.log (2 / δ) / m) < risk (fun w p ↦ φ ⟪w, p.1⟫_ℝ p.2) D w} ≤
ENNReal.ofReal δ := 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, §26.3 p. 384, Theorem 26.12 with its proof
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.