LFD Book Forum  

Go Back   LFD Book Forum > Book Feedback - Learning From Data > Chapter 2 - Training versus Testing

 
 
Thread Tools Display Modes
Prev Previous Post   Next Post Next
  #1  
Old 02-25-2013, 01:27 PM
cls2k cls2k is offline
Junior Member
 
Join Date: May 2012
Posts: 5
Default 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.
Reply With Quote
 

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -7. The time now is 09:33 AM.


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. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.