Proof of Theorem 8 — the expected test average loss equals the expected loss
ProvedXuMannorRobust.WeakRobust.theorem8_first_equalitygeneralizationlearning-theoryp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a measurable space with a probability measure , a set of hypotheses, and a loss measurable in its sample argument. Let and let be i.i.d. samples. Then for every hypothesis
where and .
In the proof of Theorem 8 this is applied to the fixed hypothesis , turning the generalization gap into .
Formalization Note The law of is the product measure Measure.pi (fun _ : Fin n => μ). Measurability of is added (the paper ignores measurability). The case is excluded, where the average loss is in Lean.
Preamble
import Mathlib import Definitions.Def_XuMannorRobust_WeakRobust_Setup open MeasureTheory
Formal statement
namespace XuMannorRobust.WeakRobust
/-- Xu & Mannor 2012, p. 410, proof of Theorem 8, first equality: since the test samples
`t(n)` are `n` i.i.d. draws from `μ`, `E_{t(n)} L(h, t(n)) = 𝓛(h)` for every hypothesis `h`
(`n ≥ 1`; loss measurable with values in `[0, M]`). -/
theorem theorem8_first_equality {Z H : Type*} [MeasurableSpace Z] (μ : Measure Z)
[IsProbabilityMeasure μ] (l : H → Z → ℝ) (M : ℝ)
(hl_bound : ∀ h z, 0 ≤ l h z ∧ l h z ≤ M) (hl_meas : ∀ h, Measurable (l h))
{n : ℕ} (hn : 0 < n) (h : H) :
∫ t, avgLoss l h t ∂(Measure.pi fun _ : Fin n => μ) = expectedLoss μ l h := by sorry
end XuMannorRobust.WeakRobust
Source
Xu & Mannor, Robustness and Generalization, Mach Learn 86 (2012), DOI 10.1007/s10994-011-5268-1, p. 410, proof of Theorem 8, first equality of the sufficiency display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.