LFD Book Forum  

Go Back   LFD Book Forum > Course Discussions > Online LFD course > Homework 3

Reply
 
Thread Tools Display Modes
  #1  
Old 04-18-2013, 02:41 PM
Michael Reach Michael Reach is offline
Senior Member
 
Join Date: Apr 2013
Location: Baltimore, Maryland, USA
Posts: 71
Default Question 9 with triangles

I am having a hard time finding a good way to visualize this. Maybe someone can make suggestions.

One thing I decided early on: A "best" set of N points (with a maximal number of dichotomies) has to be convex. If it is concave, make the point on the inside -1 and three points surrounding it +1 and it won't work.

Once the set is convex (maybe you can put them on a circle WLOG or some such), I _think_ I can guess the number that will force no breaking, but I don't have a clear argument.
Reply With Quote
  #2  
Old 04-18-2013, 02:54 PM
yaser's Avatar
yaser yaser is offline
Caltech
 
Join Date: Aug 2009
Location: Pasadena, California, USA
Posts: 1,477
Default Re: *ANSWER* Question 9 with triangles

Quote:
Originally Posted by Michael Reach View Post
I am having a hard time finding a good way to visualize this. Maybe someone can make suggestions.

One thing I decided early on: A "best" set of N points (with a maximal number of dichotomies) has to be convex. If it is concave, make the point on the inside -1 and three points surrounding it +1 and it won't work.

Once the set is convex (maybe you can put them on a circle WLOG or some such), I _think_ I can guess the number that will force no breaking, but I don't have a clear argument.
Take a look at this thread:

http://book.caltech.edu/bookforum/showthread.php?t=2606

and we can discuss this further.
__________________
Where everyone thinks alike, no one thinks very much
Reply With Quote
  #3  
Old 04-18-2013, 03:59 PM
Michael Reach Michael Reach is offline
Senior Member
 
Join Date: Apr 2013
Location: Baltimore, Maryland, USA
Posts: 71
Default Re: *ANSWER* Question 9 with triangles

Well, I see that an N-gon (won't say which) is easy to shatter, and the (N+2)-gon is easy to see that it can't be shattered. So I know which of the answers to choose, but I'm still not clear on the (N+1)-gon in between.
Reply With Quote
  #4  
Old 04-18-2013, 04:28 PM
yaser's Avatar
yaser yaser is offline
Caltech
 
Join Date: Aug 2009
Location: Pasadena, California, USA
Posts: 1,477
Default Re: Question 9 with triangles

I took out the *ANSWER* warning since the discussion seems safe so far.
__________________
Where everyone thinks alike, no one thinks very much
Reply With Quote
  #5  
Old 04-18-2013, 04:48 PM
Michael Reach Michael Reach is offline
Senior Member
 
Join Date: Apr 2013
Location: Baltimore, Maryland, USA
Posts: 71
Default Re: Question 9 with triangles

Ah, well, I guess an (N+1)-gon works too - brute force check on all triangles. Not very elegant, but it works.
Reply With Quote
  #6  
Old 04-19-2013, 08:02 AM
Michael Reach Michael Reach is offline
Senior Member
 
Join Date: Apr 2013
Location: Baltimore, Maryland, USA
Posts: 71
Default Re: Question 9 with triangles

I was having about the same troubles figuring out the perceptron problem, but I think looking in the book (*ANSWER*) helps a lot.
Reply With Quote
Reply

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 01:26 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.