Thread: Exercise 2.1 View Single Post
#2
09-21-2015, 04:50 PM
 magdon RPI Join Date: Aug 2009 Location: Troy, NY, USA. Posts: 597
Re: Exercise 2.1

Yes, when there is no break point, the theorem says that for all N. So the theorem is trivially verified.
Quote:
 Originally Posted by ilson Hi, For the convex set case, it seems to me that since N points on a circle can always be shattered, there's always at least one data set of size k that can be shattered by . Thus, the break point does not exist for this . So then you can't really verify that for this case - or can you say that it's trivially true since break point k doesn't even exist? Is this the correct interpretation of this exercise?
__________________
Have faith in probability