Exercise problem 2.4
I'm stuck at the exercise problem 2.4 behind the book despite the hint. My approach is to characterize the B(N+1,K) >= recursion as an upper bound on the lower order (in N) terms and then follow the approach of proving the Sauer lemma. However I'm stuck on constructing the "specific set" of dichotomies. I fail to see how the special property to this set (limiting the number of 1 as hinted) can make this proof go easier.
I'm not very good at mathematical proofs so any additional hints will be greatly appreciated. 
Re: Exercise problem 2.4
Here is a hint. Lets consider showing B(5,2)>=1+5; It suffices to list 6 dichotomies on 5 points such that no subset of size 2 is shattered.
Consider the following 6 dichotomies on 5 points: [1 1 1 1 1] (zero 1s) [1 1 1 1 1] (5 ways of having one 1) [1 1 1 1 1] [1 1 1 1 1] [1 1 1 1 1] [1 1 1 1 1] Can you show that no subset of 2 points is shattered? Hint: are there any two points that are classified 1,1? So, in general, you can guarantee that no subset of size k can be shattered if no subset of size k is classified all 1. This means that at most k1 points are classified 1 by any dichotomy. Quote:

Re: Exercise problem 2.4
Thank you! this is such an awesome and elegant insight and now the proof is easy.

Re: Exercise problem 2.4
Professor, thank you for this amazingly helpful hint!

Re: Exercise problem 2.4
I still don't get it after reading this hint. :clueless:
Could somebody PM me to help me out so I don't ruin it for everybody else? 
Re: Exercise problem 2.4

All times are GMT 7. The time now is 05:58 PM. 
Powered by vBulletin® Version 3.8.3
Copyright ©2000  2019, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. AbuMostafa, Malik MagdonIsmail, and HsuanTien Lin, and participants in the Learning From Data MOOC by Yaser S. AbuMostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.