The L2 regularization term is useful because it penalizes large weights over smaller weights which is good to prevent overfitting. I'm having a hard time understanding how exactly it does this.
This is what I know about L2. I know that one can take a standard cost function and use the following statistical approach using a prior distribution...
$$P(\Theta \mid x) = \frac{P(x\mid\Theta )P(\Theta )}{P(x)}$$
and use the MAP rule...
$$\operatorname{argmax}\sum log(P(x_i\mid\Theta )P(\Theta)$$
to re-write the cost function in the following format...
$$\log(P(x_i\mid\Theta)) + \log(P(\Theta))$$
where $\log(P(\Theta))$ is essentially the regularization term. My question is, how is this prior, $\log(P(\Theta))$, penalizing large weights? It is not clear to me. How does the prior (regularization term) penalize large weights and generalize to prevent overfitting?
Perhaps my understanding of priors is pretty basic, which might be why I can't see how this is done, I'm hoping someone can explain it to me via examples or proofs.