LFD Book Forum Hw 6 q1
 Register FAQ Calendar Mark Forums Read

#1
 lucifirm Member Join Date: Apr 2012 Posts: 20 Hw 6 q1

The problem question is:
"In general, if we use H′ instead of H, how does deterministic noise behave?"

My doubt is:
Is this for a fixed N? A small N or large enough to get rid of overfitting?
#2
 mikesakiandcp Member Join Date: Apr 2012 Posts: 31 Re: Hw 6 q1

Quote:
 Originally Posted by lucifirm The problem question is: "In general, if we use H′ instead of H, how does deterministic noise behave?" My doubt is: Is this for a fixed N? A small N or large enough to get rid of overfitting?
The size of the training set (N) is more related to overfitting of stochastic noise. Deterministic noise is the ability of the hypothesis set to fit the target function.
#3
 elkka Invited Guest Join Date: Apr 2012 Posts: 57 Re: Hw 6 q1

I am also confused about this term "in general". Does it mean - in absolutely any situation. Or does it mean in most situations? Or - in all reasonable situations, excluding cases when we try to fit 10 degree polynomials to 10 points, as in this lecture's example?

mikesakiandcp, I think N has to do with deterministic noise, at least as described in the lecture. Yes, it is the ability of the hypothesis set to fit the target function, measured as expected difference between the "best" hypothesis and the target. But the way we defined the expected hypothesis, as an expectation over infinite number of data sets of specific size N - that depends on N very much. Slide 14, Lecture 11, illustrates the connection.
#4
 AqibEjaz Junior Member Join Date: May 2012 Posts: 7 Re: Hw 6 q1

@elkka: Well the "deterministic noise" is actually independent of N, refer to lecture 08 slide 20, You can see that the "bias" remains the same no matter how large N becomes. With increasing N it is the variance that becomes smaller and hence overall Eout becomes smaller. As I understand it, if you have infinite training sets, then it does not matter whether you have 10 points in each set or 10,000 points, the average hypothesis will remain the same. In case of 10 points, the different hypotheses we get from each training set will be spread all over the place but they will be "centered" around the same hypothesis (i.e. the average hypothesis). In case of 10,000 points, the individual hypotheses will be less spread out but again they will be centered around the same hypothesis as that in the 10 points. "Bias" only depends upon the mismatch between the target function and the modelling hypothesis.
#5
 mikesakiandcp Member Join Date: Apr 2012 Posts: 31 Re: Hw 6 q1

Quote:
 Originally Posted by elkka I am also confused about this term "in general". Does it mean - in absolutely any situation. Or does it mean in most situations? Or - in all reasonable situations, excluding cases when we try to fit 10 degree polynomials to 10 points, as in this lecture's example? mikesakiandcp, I think N has to do with deterministic noise, at least as described in the lecture. Yes, it is the ability of the hypothesis set to fit the target function, measured as expected difference between the "best" hypothesis and the target. But the way we defined the expected hypothesis, as an expectation over infinite number of data sets of specific size N - that depends on N very much. Slide 14, Lecture 11, illustrates the connection.
You are right, N is related to the deterministic noise. What I meant to say is that we have no control over N (since it is the number of inputs in our training set, which we have no control over). Given a fixed training set (and thus a fixed N), we are interested in how well the hypothesis set can approximate the target function.
#6
 gjtucker Junior Member Join Date: May 2012 Posts: 7 Re: Hw 6 q1

It seems like it depends on the definition of deterministic noise. If we define it as E_x[(g^{bar}(x) - f(x))^2] (as was done in the lecture slides) and we assume that g^{bar} is the best hypothesis in H, then it is independent of N.

Where the finite N comes in is through the variance term. With few N, the more complicated model will have a harder time finding the best hypothesis and have high variance, which what we see in the plots in lecture. But, as N increases, my guess is that E_x[(g^{bar}(x) - f(x))^2] says approximately the same, while the variance term goes down. I suppose this wouldn't be too hard to check numerically.
#7
 dudefromdayton Invited Guest Join Date: Apr 2012 Posts: 140 Re: Hw 6 q1

Heads up from the textbook: exercise 4.3 on page 125!
#8
 elkka Invited Guest Join Date: Apr 2012 Posts: 57 Re: Hw 6 q1

Thanks, but I don't have the book

 Thread Tools Show Printable Version Email this Page Display Modes Switch to Linear Mode 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 04:11 PM. 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.
{"ft_lang_label":"__label__en","ft_lang_prob":0.94162375,"math_prob":0.77951235,"size":2760,"snap":"2022-05-2022-21","text_gpt3_token_len":721,"char_repetition_ratio":0.12481858,"word_repetition_ratio":0.026871402,"special_character_ratio":0.26956522,"punctuation_ratio":0.11518325,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9604156,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-16T23:11:44Z\",\"WARC-Record-ID\":\"<urn:uuid:156fb11a-c3d7-4ac8-a881-4d7e3628afee>\",\"Content-Length\":\"62272\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b8a04ba0-4935-41df-8c2b-68fbec1be6c7>\",\"WARC-Concurrent-To\":\"<urn:uuid:d318768a-c2f5-4aaa-ac70-8dc12eadb64c>\",\"WARC-IP-Address\":\"131.215.134.70\",\"WARC-Target-URI\":\"http://book.caltech.edu/bookforum/showthread.php?s=8865208d48f363a190ac33f474e15a8a&mode=hybrid&t=477\",\"WARC-Payload-Digest\":\"sha1:F5L4SHIQGBXBW3NEMV7IVVIB3RIC7FTS\",\"WARC-Block-Digest\":\"sha1:BNMGMAUUTEKBSCPTASFLVOAHKOMBBRLZ\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320300244.42_warc_CC-MAIN-20220116210734-20220117000734-00139.warc.gz\"}"}