LFD Book Forum (http://book.caltech.edu/bookforum/index.php)
-   Chapter 2 - Training versus Testing (http://book.caltech.edu/bookforum/forumdisplay.php?f=109)
-   -   Exercises and Problems (http://book.caltech.edu/bookforum/showthread.php?t=258)

 yaser 08-29-2012 12:44 PM

Re: Problem 2.10

Quote:
 Originally Posted by vsthakur (Post 4571) But all we know about the growth functions (in general) is their bound
Actually, we also know the definition of growth functions, and this may be the key to answering the question.

 htlin 08-29-2012 08:09 PM

Re: Problem 2.9 : Growth function of perceptron, seems incorrect

Quote:
 Originally Posted by vsthakur (Post 4570) Sorry for the delayed response here, but i still find that is not the case for a perceptron in d-dimensional space. When N=6 and d=2, this equation says , while i was able to get 38 dichotomies (by picking 6 equidistant points on the circumference of a circle). If i am missing something, then can you please point me to the proof. Thank you.
I checked the case you are describing, and the number of dichotomies in the case is . (Hint: did you double-calculate the case of 3-positive and 3-negative?) Hope this helps.

 vsthakur 08-30-2012 04:45 AM

Re: Problem 2.9 : Growth function of perceptron, seems incorrect

Quote:
 Originally Posted by htlin (Post 4612) I checked the case you are describing, and the number of dichotomies in the case is . (Hint: did you double-calculate the case of 3-positive and 3-negative?) Hope this helps.
You are right, that was the mistake. My apologies.
Thank you.

 vsthakur 09-01-2012 10:34 AM

Re: Problem 2.10

Quote:
 Originally Posted by yaser (Post 4598) Actually, we also know the definition of growth functions, and this may be the key to answering the question.
I think i get it now. Let . Now, if we partition any set of points into two sets of points each, each of these two partitions will produce dichotomies at best. If we now combine these two sets, then the maximum no. of dichotomies possible will be the cross product of the two sets of dichotomies (with N points each), i.e.,

Thank you.

 vsthakur 09-01-2012 10:46 AM

Re: Possible correction to Problem 2.14 (b)

Quote:
 Originally Posted by magdon (Post 4584) The problem, though an over-estimate seems correct. Hint: If you have points, then can implement at most dichotomies on those points. Now try to upper bound the number of dichotomies that all hypothesis sets can implement on these points and proceed from there.
Got it, thanks. The inequality should be strict i think ().

 magdon 09-03-2012 06:54 AM

Re: Problem 2.10

Yes, well done.

Quote:
 Originally Posted by vsthakur (Post 4743) I think i get it now. Let . Now, if we partition any set of points into two sets of points each, each of these two partitions will produce dichotomies at best. If we now combine these two sets, then the maximum no. of dichotomies possible will be the cross product of the two sets of dichotomies (with N points each), i.e., Thank you.

 doris 09-22-2012 03:00 PM

Problem 2.3 c

the last comment confused me a little bit.
For a given set of N points, we should change the center of the sphere to get as many dichotomies as we can, thus measuring the effective number of hypotheses (spheres) in this hypothesis set.

Does it make sense to move project the spheres from 3D to 1D and look at the problem as intervals of +1 for a<=x<=b and -a>=x>=b?

 magdon 09-23-2012 10:42 AM

Re: Problem 2.3 c

You will note from the definition of the hypothesis set: contains functions which are +1 for

You only get to vary , and so the two spheres are restricted to be centered on the origin.

And yes, the for this hypothesis set is very related to the growth function for positive intervals.

Quote:
 Originally Posted by doris (Post 5695) the last comment confused me a little bit. For a given set of N points, we should change the center of the sphere to get as many dichotomies as we can, thus measuring the effective number of hypotheses (spheres) in this hypothesis set. Does it make sense to move project the spheres from 3D to 1D and look at the problem as intervals of +1 for a<=x<=b and -a>=x>=b?

 mileschen 09-23-2012 06:19 PM

Problem 2.15

In (a), it said that we should provide a monotonic classifier. Then, why there are +1 and -1 regions?

Also, as it said in (b) that generating the next point by increasing the first component and decreasing the second component. Then, how can we determine which point is larger? Because X1>=X2 if and only if the inequality is satisfied for every component. However, the next point is just with one component larger than that of the first one, while another component is less than that of the first one. So, it's a little confusing.

 magdon 09-23-2012 08:23 PM

Re: Problem 2.15

The function is +1 in some region and is -1 in the complement - i.e. it takes on two values. Any function can be monotonic, even one that takes on just 2 values.

In (b), you are asked to compute m(N). To compute m(N) you need to count the maximum number of implementable dichotomys on some N points. The problem suggest a set of N points which might be helpful. The fact that no point is larger than another is crucial [hint: because if a point were larger than another, there is a dichotomy that you cannot implement].

Quote:
 Originally Posted by mileschen (Post 5745) In (a), it said that we should provide a monotonic classifier. Then, why there are +1 and -1 regions? Also, as it said in (b) that generating the next point by increasing the first component and decreasing the second component. Then, how can we determine which point is larger? Because X1>=X2 if and only if the inequality is satisfied for every component. However, the next point is just with one component larger than that of the first one, while another component is less than that of the first one. So, it's a little confusing.

All times are GMT -7. The time now is 10:38 AM.

Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2021, 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.