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 09-21-2015, 10:33 AM
ilson ilson is offline
Member
 
Join Date: Sep 2015
Posts: 10
Default Exercise 2.1

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 \mathcal{H}. Thus, the break point does not exist for this \mathcal{H}. So then you can't really verify that m_{\mathcal{H}}(k)< 2^k 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?
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 03:47 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.