 Solution

ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2015/computational-learning-theory/1/a/ii/solution

VC (H) = sup {∣ S ∣ : S \subseteq X is finite and is shattered by H} .

It is infinite if arbitrarily large finite sets are shattered. A hypothesis class has VC dimension zero when it shatters no one-point set; for a nonempty hypothesis class, the empty set is always shattered.

 New to topics? Read the docs here!