# Statistics - Ridge regression

> (Statistics|Probability|Machine Learning|Data Mining|Data and Knowledge Discovery|Pattern Recognition|Data Science|Data Analysis)

### Table of Contents

## 1 - About

Ridge regression is a shrinkage method. It was invented in the '70s.

## 2 - Articles Related

## 3 - Shrinkage Penalty

The least squares fitting procedure estimates the regression parameters using the values that minimize RSS.

**In contrast**, the ridge regression estimates the regression parameters

minimizing the RSS with a penalty term (on the sum of squares of the coefficients)

<MATH> \href{RSS}{RSS} + \underbrace{\lambda \sum^{\href{dimension}{P}}_{j=1}B^2_j}_{\displaystyle \text{penalty term}} \\ </MATH>So if lambda is big, the sum of squares of the coefficients must be small and will shrink the coefficients towards zero. And as lambda gets very big, the coefficients will all be zero.

The algorithm will try to make the RSS small but at the same time, the penalty term is going to push it in the other direction penalizing coefficients which get too large. The more non-zero a coefficient is, the larger the penalty term is. The larger the coefficients are, the bigger the penalty price is.

It's basically fit versus the size of the coefficients.

That penalty is called a **shrinkage penalty** because it's going to encourage the parameters to be
shrunk toward 0.

## 4 - Tuning parameter <math>\lambda</math>

The amount by which the coefficients are encouraged to be 0 is determined by the tuning parameter

<math>\lambda</math>.

If lambda is 0, this is only a least squares regression but the larger lambda is, the more and more a price will be payed for making these coefficients non-zero. If lambda is extremely large, the coefficients are going to be very close to 0 because they'll have to be close to 0 to make the penalty term small enough.

The penalty term has the effect of shrinking the coefficients towards 0 because if a coefficient is 0, the feature is not appearing in the model.

The size of the tuning parameter

<math>\lambda</math>is a trade-off decision between the fit versus the size of the coefficients. To be able to make this critical decision, the tuning parameter

<math>\lambda</math>will be chosen by resampling (namely cross-validation).

## 5 - Plot

### 5.1 - Standardized coefficients versus lambda

The below plot shows a ton of different models for a huge grid of lambda values.

On the left-hand side, lambda is close to 0, there's almost no constraint on the coefficients. This is the full least squares estimates. As lambda gets larger, it's pushing the coefficients towards 0 because we're paying more and more of a price for being non-zero. In the extreme, where lambda is a little more than 10,000, the coefficients are all essentially 0. In between, they're shrunken towards 0 as lambda gets larger, although not uniformly.

The red line indicates a value of lambda equals 100. For this lambda value, ridge regression chooses about four non-zero coefficients. At the red line:

- the B1 coefficient takes on a value of negative 100.
- B2 and B3 take on values of around 250.
- B4 takes on a value of around 100.
- The gray ones are basically essentially 0. They're not quite 0 but they are really small. They're close to 0. The coefficients are never exactly 0 unless you're extremely lucky. So ridge regression shrinks things in a continuous way toward 0 but doesn't actually select variables by setting a coefficient equal to 0 exactly whereas LASSO does.

### 5.2 - Standardized coefficient versus L2 norm

An equivalent picture than the previous one where the standardized coefficient is plotted as a function of a standardized l2 norm.

The standardized l2 norm is:

- the l2 norm of the least squares coefficient for a lambda
- divided by the l2 norm of the full least squares coefficient.

where

<math>\hat{\beta}</math>denotes the vector of least squares coefficient estimates

The notation

<math>|| \beta ||_2</math>denotes the l2 norm (pronounced “ell 2”) of a vector and is defined as:

<MATH> l_2 \text{Norm} = || \beta ||_2=|| \beta_1 \dots \beta_2 ||_2 = \sqrt{\sum_{j=1}^P \beta^2_j} </MATH>On the left side of this picture, the coefficients are all basically 0, the lambda is very large and the l2 norm is 0. And on the right, lambda is very small, and we get the full least squares estimates. And in between, we get shrunken coefficients.

The x-axis goes from 0 to 1 because we're plotting as a function of a standardized l2 norm. At the right-hand side, the ridge regression estimate is the same as the least squares estimate, the numerator and denominator are the same, therefore the ratio is just 1.

## 6 - Prerequisites

#### 6..1 - Scale-variant

Standard least squares is scale-invariant but for penalized methods like ridge regression, the scaling does matter in an important way because the coefficients are all put in a penalty term together.

<MATH>\lambda \sum_{j=1}^p \beta^2_j</MATH>If the units of variable are changed, it will change the scale of the coefficients. The units of the predictors affects the l2 penalty in ridge regression, and hence

<math>\beta</math>and

<math>\hat{y}</math>will both change

As a result, it's important to standardize the predictors before applying ridge regression.

## 7 - Bias-Variance Trade-off

### 7.1 - Lambda

The size of the tuning parameter

<math>\lambda</math>is a Bias-Variance trade-off decision between the fit versus the size of the coefficients. To be able to make this critical decision, the tuning parameter

<math>\lambda</math>will be chosen by resampling (namely cross-validation).

The above plot represents the bias, variance and test error as a function of lambda on the left and of the standardized l2 norm on the right where:

- the bias is the black line,
- the variance is the green line,
- the test error (MSE) is the purple line
- the horizontal dashed lines indicate the minimum possible MSE.
- The purple crosses indicate the ridge regression models for which the MSE is smallest.

When lambda gets larger, the bias is pretty much unchanged, but the variance drops. Therefore, by shrinking the coefficient toward 0, the ridge regression controls the variance.

Ridge regression doesn't allow the coefficient to be too big, and it gets rewarded because the mean square error, (which is the sum of variance and bias) is minimized and becomes lower than for the full least squares estimate.

### 7.2 - U-shaped curve

The U-shaped curve for the mean squared error (in purple) comes up again and again. Considering a bunch of different models that have different levels of flexibility or complexity, there is usually some sweet spot in the middle that has the smallest test error. And that's really what we're looking for.