Foundations of Machine Learning XII: Algorithmic StabilityTextbook
Every generalization bound in Chapters 2-11 depends only on the complexity of a fixed hypothesis set — Rademacher complexity, VC-dimension, growth function — and holds regardless of which algorithm within actually returns the hypothesis. This is both a strength (broad applicability) and a limitation: it throws away everything specific to how an…