LFD Book Forum Lecture 6- 2N sample
 Register FAQ Calendar Mark Forums Read

#1
04-29-2013, 12:24 PM
 a.sanyal902 Member Join Date: Apr 2013 Posts: 11
Lecture 6- 2N sample

Hi all,
At the end of lecture 6, Prof. Yaser replaces one sample with 2 samples of size N each. We then replace m(N) with m(2N) in the inequality.

However, these are 2 distinct samples. So won't the maximum no. of hypothesis actually be 2m(N), which in general is more than m(2N)) ?
The constraints of 2N points would hold if it were a single sample set, but here more no. of hypothesis are possible as the N-sets are distinct.

Is this the reason for the additional factors in the inequality?
#2
04-29-2013, 01:45 PM
 yaser Caltech Join Date: Aug 2009 Location: Pasadena, California, USA Posts: 1,478
Re: Lecture 6- 2N sample

Quote:
 Originally Posted by a.sanyal902 Hi all, At the end of lecture 6, Prof. Yaser replaces one sample with 2 samples of size N each. We then replace m(N) with m(2N) in the inequality. However, these are 2 distinct samples. So won't the maximum no. of hypothesis actually be 2m(N), which in general is more than m(2N))?
I am not sure I completely got the point that you are making, so let me just address the above statement. The growth function normally grows very fast, so it will more than double in value when its argument doubles. When we consider all dichotomies on points, whether we view them as one sample or two samples, the number to be considered is .
__________________
Where everyone thinks alike, no one thinks very much
#3
04-29-2013, 09:22 PM
 a.sanyal902 Member Join Date: Apr 2013 Posts: 11
Re: Lecture 6- 2N sample

Thank you Prof! I was a little confused earlier. Much clearer now!

 Thread Tools Display Modes Hybrid 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 03:59 AM.