And this method can be generalizes!!
for
with VC dimension
H1: hypothesis over
mapping these point to cases that at most
points to +1 and other points to 1
H2: hypothesis over
mapping these point to cases that at most
points to 1 and other points to +1
so there is at least
+1 and other points to 1
easy to prove that
since
so
can shatter all
point
By proper extension with same idea, it can reach higher bound in k points cases
Quote:
Originally Posted by MindExodus
sry about didn't notice that requirement
but the key to this problem is the same:
let me just put another example:
just think of H1 and H2 on
H1:
H2:
thus:
,
and can shatter all 3 point
