Restriction of Break Point
growth function mH(N): max number of dichotomies
mH(N) <= maximum possible mH(N) given k <= poly(N)
Bounding Function: Basic Cases
bounding function B(N,k):
maximum possible mH(N) when break point = k
Bounding Function: Inductive Cases
Bounding Function: The Theorem
B(N,k) <= sum (A(N,i) i=[0,k)
A Pictorial Proof
That's All!
Vapni-Chervonenkis(VC) bound:
P [ h belongs to H | Ein(h) - Eount(h) >e ] <= 4mH(2N) exp (-1/8 e^2 N)