1
$\begingroup$

For the loss function with L2 regularization:

$$Loss\ function + \lambda||w||^2_2.$$

I think following three things are equivalent with large probability:

large estimation value of $w^i$ <=> large estimation variance of $w^i$ <=> large probability of overfitting.

Is there any intuitive way to explain above conclusion?

One way is from the Bayesian's point, L2 regularization corresponds the $(0,\sigma^2)$-normal priority distribution of $w,$ to appear the large value, we need the large variance $\sigma^2.$ I cannot guarantee the statement is correct and definitely is not intuitive.

$\endgroup$

1 Answer 1

2
$\begingroup$

To see why the equivalences do not hold, consider the following examples.

  1. First, a simple least-squares loss function with L2 regularization: $y = w x + e$. Now, multiply $x$ by $10^{-8}$. A little thought should convince us that, correspondingly, all the $w$ will be multiplied by $10^8$, giving us exactly the same $\hat{y}$ and exactly the same residuals. The probability of overfitting is evidently exactly the same as it was before, but all the estimation values of $w$ will be $10^8 \times$ as large as before. Since we can make that $10^8$ as large a number as we want, it is evident that large estimation values of $w$ do not imply anything about the probability of overfitting - regardless of how that is defined (but see point 3 below.)

  2. Consider the same model, but with $\sigma^2_e = 0$. Clearly, there will be no estimation error regardless of how large $||w||$ is. Hand-waving over the obvious smoothness argument, we can conclude that by making $\sigma^2_e$ arbitrarily small, we can make the estimation error of $w$ arbitrarily small, regardless of how large $w$ is, and similarly for making $\sigma^2_e$ arbitrarily large. Therefore, large (or small) $||w||$ by itself is not sufficient for us to draw any conclusions about how large the estimation error of $w$ is.

  3. It is not clear what you mean by "large probability of overfitting", which would require at the least a mathematical definition of "overfitting". If you just mean "the parameter estimates $\neq$ the true values", for most real-world models the probability of this occurring is $1$. (I am not sure I've ever run into a situation where it isn't $1$ in my practice.) Consequently, it is independent of both the magnitude and variance of the parameter estimates.

$\endgroup$
4
  • $\begingroup$ thanks, maybe we can ignore the last point (overfitting <=> large estimation variance). But for the first point, it is from the fact that in order to fit some noise/outlies, curve has to change dramatically i.e. large slope (coefficient in a line) nearby such point. So need we add some condition where the large coefficient implies the large variance. $\endgroup$ Commented Oct 25, 2021 at 5:52
  • $\begingroup$ But there isn't such a condition, unless you just make one up. At that point, you are essentially saying "If a large coefficient implies a large estimation variance, then a large coefficient implies a large estimation variance." Not a generalizable conclusion... $\endgroup$
    – jbowman
    Commented Oct 25, 2021 at 14:55
  • $\begingroup$ maybe I should state as when coefficient is large, how do you detect it is from "in order to fit some noise/outlies, curve has to change dramatically"? $\endgroup$ Commented Oct 25, 2021 at 15:22
  • $\begingroup$ That's an excellent, but completely different, question... if that's what you want to know, I suggest posting that and maybe closing this one; you'll get responses, believe me! $\endgroup$
    – jbowman
    Commented Oct 25, 2021 at 16:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.