![]() |
Lec-11: Overfitting in terms of (bias, var, stochastic-noise)
We have:
total-noise = var (overfitting-noise ? ) + bias (deterministic-noise) + stochastic-noise Qs: 1. Is overfitting-noise the var part alone? From Prof’s lecture, I tend to conclude that it is var caused because of attempt to fit stochastic-noise i.e. overfitting-noise really is an interplay of (stochastic-noise -> variance). Need help in interpreting it. 2. When we try to arrest the overfitting, using brakes(regularization) and/or validation, are we really working with overfitting alone ? In case of validation, we will have a measure of total-error : Is it that the relativity of total-errors across choice of model-complexity(e.g. H2 Vs H10), is giving us an estimate of relative measure of overfitting across choices of hypothesis-complexity? In case of brakes(regularization) : will the brake really be applied on overfitting alone, and not other parts of total-error, esp bias part ? 3. Consider a case in which target-complexity is 2nd order polynomial and we chose a 2nd order(H2) and a 10th order polynomial(H10) to fit it. How will the overfit and bias vary for the two hypothesis (as N grows on the x-axis)? Specifically, will the H10 have overfitting (with or without stochastic noise)? Also, H10 should have higher bias compared to H2 ? 4. Is there a notion of underfitting wrt Target-Function ? When we try to fit a 10th order polynomial target-function, with a 2nd order polynomial hypothesis, are we not underfitting ? If so, can we associate underfitting to bias then ? If not, what else ? Thanks |
Re: Lec-11: Overfitting in terms of (bias, var, stochastic-noise)
Thanks Elroch for your detailed reply ( and your patience therein ). That helped.
[ Just one clarification to my first set of Qs. Let's say that we always have 'sufficient' data-points to learn from, for any choice of the 'order of polynomial' in the hypothesis set - i.e for H2 we have >>20 and for H10, we have >> 100 points, and likewise for any other order ] Quote:
Quote:
However, if we had a probability-distribution on target-function's complexity, then a given instance of it will still be a fixed-order polynomial, albeit we may not know what it is. So we will use validation-set to gauge which order of polynomial on hypothesis seems more promising. Right? Quote:
|
Re: Lec-11: Overfitting in terms of (bias, var, stochastic-noise)
Very thoughtful questions.
1. Yes, you are correct. The term which overfitting is responsible for is the ![]() One way to look at this is as follows. Suppose you picked the function that was truly the best. What would your error be? To a good approximation, it would be: ![]() This is because for most normal learning models, the best hypothesis is approximately the average hypothesis ![]() So the additional ![]() So you can view the ![]() The answers to your remaining questions are related to the above discussion as well as to later material in the text. 2. Let's take regularization (validation is a little more complicated). In chapter 4 we will make an explicit connection between regularization and using a `smaller' hypothesis set. So at the end of the day most methods for `braking' effectively result in using a smaller hypothesis set. Regularization does this in a more flexible and `soft' way than simply picking H2 versus H10. And then, you are right. There is a tradeoff when you reduce the size of the model. You will increase the bias (direct impact) but decrease the var (indirect impact). One of these effects wins and this determines whether you should increase or decrease your model size. In small ![]() 3. I highly recommend thinking about Exercise 4.3:) 4. Yes, there is such a thing as underfitting (see chapter 4). This is usually happening when it is the direct impact (bias) that wins over the indirect impact (var). And so, you should increase the size of ![]() Quote:
|
Re: Lec-11: Overfitting in terms of (bias, var, stochastic-noise)
Thanks a lot, Prof Magdon. It feels much better now. :)
Sure - I'll take the exercises as you suggested. |
All times are GMT -7. The time now is 03:23 PM. |
Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.
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.