#11




Re: Problem 2.10
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




Re: Problem 2.9 : Growth function of perceptron, seems incorrect
Quote:
__________________
When one teaches, two learn. 
#13




Re: Problem 2.9 : Growth function of perceptron, seems incorrect
Quote:
Thank you. 
#14




Re: Problem 2.10
Quote:
Thank you. 
#15




Re: Possible correction to Problem 2.14 (b)

#16




Re: Problem 2.10
Yes, well done.
Quote:
__________________
Have faith in probability 
#17




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




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:
__________________
Have faith in probability 
#19




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




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:
__________________
Have faith in probability 
Tags 
errata, growth function, perceptron 
Thread Tools  
Display Modes  

