LFD Book Forum Exercises and Problems
 Register FAQ Calendar Mark Forums Read

#1
03-25-2012, 12:25 AM
 yaser Caltech Join Date: Aug 2009 Location: Pasadena, California, USA Posts: 1,478
Exercises and Problems

Please comment on the chapter problems in terms of difficulty, clarity, and time demands. This information will help us and other instructors in choosing problems to assign in our classes.

Also, please comment on the exercises in terms of how useful they are in understanding the material.
__________________
Where everyone thinks alike, no one thinks very much
#2
07-02-2012, 02:36 PM
 tadworthington Member Join Date: Jun 2012 Location: Chicago, IL Posts: 32
ERRATA: Small mistake in description of Exercise 2.1

I won't "mathify" this correction, as I don't know how in this forum (my LaTex has escaped me after years of neglect!). It's a minor point, but I feel like it should be corrected. In the wording for Exercise 2.1 on page 45:

ERROR: "Verify that m_H(n) < 2^k"
CORRECTION: "Verify that m_H(k) < 2^k"

Thanks!
#3
07-02-2012, 03:58 PM
 yaser Caltech Join Date: Aug 2009 Location: Pasadena, California, USA Posts: 1,478
Re: ERRATA: Small mistake in description of Exercise 2.1

Quote:
 Originally Posted by tadworthington I won't "mathify" this correction, as I don't know how in this forum (my LaTex has escaped me after years of neglect!). It's a minor point, but I feel like it should be corrected. In the wording for Exercise 2.1 on page 45: ERROR: "Verify that m_H(n) < 2^k" CORRECTION: "Verify that m_H(k) < 2^k" Thanks!
Thank you for catching this!
__________________
Where everyone thinks alike, no one thinks very much
#4
08-24-2012, 09:20 AM
 vsthakur Member Join Date: Jun 2012 Posts: 14
Problem 2.9 : Growth function of perceptron, seems incorrect

The problem says that in case of perceptron in d-dimensional space, growth function is equal to B(N,k). Consider the following case :

d = 2, implies dvc = 2+1 = 3
N = 4
B(N,k) = 15
but the maximum no. of dichotomies possible in this case is only 14

Can someone please comment if i am missing something.

Thanks.

Vishwajeet.
#5
08-24-2012, 01:17 PM
 magdon RPI Join Date: Aug 2009 Location: Troy, NY, USA. Posts: 597
Re: Problem 2.9 : Growth function of perceptron, seems incorrect

Thanks for catching this erratum. The problem shows the upper bound based on the VC dimension. The actual growth function is given by:

.

Our appologies.

Quote:
 Originally Posted by vsthakur The problem says that in case of perceptron in d-dimensional space, growth function is equal to B(N,k). Consider the following case : d = 2, implies dvc = 2+1 = 3 N = 4 B(N,k) = 15 but the maximum no. of dichotomies possible in this case is only 14 Can someone please comment if i am missing something. Thanks. Vishwajeet.
__________________
Have faith in probability
#6
08-25-2012, 09:04 PM
 vsthakur Member Join Date: Jun 2012 Posts: 14
Re: Problem 2.9 : Growth function of perceptron, seems incorrect

Thank you
#7
08-29-2012, 02:39 AM
 vsthakur Member Join Date: Jun 2012 Posts: 14
Re: Problem 2.9 : Growth function of perceptron, seems incorrect

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.
#8
08-29-2012, 03:10 AM
 vsthakur Member Join Date: Jun 2012 Posts: 14
Problem 2.10

To prove :

As this is a generic statement, it has to apply to every growth function. But all we know about the growth functions (in general) is their bound, in terms of and .

Also, we know that if then is an increasing function whose value is . But, if , then we can only say that is non-decreasing and is bounded by .

I guess my question is that how can we prove the generic statement above. Kindly shed some light on the proof strategy.

Thank you,

Vishwajeet.
#9
08-29-2012, 07:46 AM
 vsthakur Member Join Date: Jun 2012 Posts: 14
Possible correction to Problem 2.14 (b)

The problem says,

(b) Suppose that satisfies . Show that .

I suppose it should say,

(b) Suppose that satisfies . Show that .

If this is indeed the case, then can you please clarify part (c) as well.

Thank you,

Vishwajeet.
#10
08-29-2012, 09:30 AM
 magdon RPI Join Date: Aug 2009 Location: Troy, NY, USA. Posts: 597
Re: Possible correction to Problem 2.14 (b)

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.

Quote:
 Originally Posted by vsthakur The problem says, (b) Suppose that satisfies . Show that . I suppose it should say, (b) Suppose that satisfies . Show that . If this is indeed the case, then can you please clarify part (c) as well. Thank you, Vishwajeet.
__________________
Have faith in probability

 Tags errata, growth function, perceptron

 Thread Tools Display Modes Linear 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 08:25 AM.