 LFD Book Forum Exercises and Problems #11 yaser Caltech Join Date: Aug 2009 Location: Pasadena, California, USA Posts: 1,477 Re: Problem 2.10

Quote:
 Originally Posted by vsthakur 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.
__________________
Where everyone thinks alike, no one thinks very much
#12 htlin NTU Join Date: Aug 2009 Location: Taipei, Taiwan Posts: 601 Re: Problem 2.9 : Growth function of perceptron, seems incorrect

Quote:
 Originally Posted by vsthakur 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.
__________________
When one teaches, two learn.
#13
 vsthakur Member Join Date: Jun 2012 Posts: 14 Re: Problem 2.9 : Growth function of perceptron, seems incorrect

Quote:
 Originally Posted by htlin 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.
#14
 vsthakur Member Join Date: Jun 2012 Posts: 14 Re: Problem 2.10

Quote:
 Originally Posted by yaser 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.
#15
 vsthakur Member Join Date: Jun 2012 Posts: 14 Re: Possible correction to Problem 2.14 (b)

Quote:
 Originally Posted by magdon 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 ( ).
#16 magdon RPI Join Date: Aug 2009 Location: Troy, NY, USA. Posts: 595 Re: Problem 2.10

Yes, well done.

Quote:
 Originally Posted by vsthakur 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.
__________________
Have faith in probability
#17
 doris Junior Member Join Date: Sep 2012 Posts: 3 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?
#18 magdon RPI Join Date: Aug 2009 Location: Troy, NY, USA. Posts: 595 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 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?
__________________
Have faith in probability
#19
 mileschen Member Join Date: Sep 2012 Posts: 11 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.
#20 magdon RPI Join Date: Aug 2009 Location: Troy, NY, USA. Posts: 595 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 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.
__________________
Have faith in probability Tags errata, growth function, perceptron Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode 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 Rules
 Forum Jump User Control Panel Private Messages Subscriptions Who's Online Search Forums Forums Home General     General Discussion of Machine Learning     Free Additional Material         Dynamic e-Chapters         Dynamic e-Appendices Course Discussions     Online LFD course         General comments on the course         Homework 1         Homework 2         Homework 3         Homework 4         Homework 5         Homework 6         Homework 7         Homework 8         The Final         Create New Homework Problems Book Feedback - Learning From Data     General comments on the book     Chapter 1 - The Learning Problem     Chapter 2 - Training versus Testing     Chapter 3 - The Linear Model     Chapter 4 - Overfitting     Chapter 5 - Three Learning Principles     e-Chapter 6 - Similarity Based Methods     e-Chapter 7 - Neural Networks     e-Chapter 8 - Support Vector Machines     e-Chapter 9 - Learning Aides     Appendix and Notation     e-Appendices

All times are GMT -7. The time now is 10:53 AM. 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.