Solution

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

The shattering coefficient, also called the growth function of a hypothesis class, counts the largest number of labellings obtainable on inputs:
When has at least points, the same value is obtained by maximizing over -point sets . Always , with equality exactly when some -point set is shattered.

New to topics? Read the docs here!