Least-angle regression

In statistics, least-angle regression (LARS) is an algorithm for fitting linear regression models to high-dimensional data, developed by Bradley Efron, Trevor Hastie, Iain Johnstone and Robert Tibshirani.

Standardized coefficients shown as a function of proportion of shrinkage.

Suppose we expect a response variable to be determined by a linear combination of a subset of potential covariates. Then the LARS algorithm provides a means of producing an estimate of which variables to include, as well as their coefficients.

Instead of giving a vector result, the LARS solution consists of a curve denoting the solution for each value of the L1 norm of the parameter vector. The algorithm is similar to forward stepwise regression, but instead of including variables at each step, the estimated parameters are increased in a direction equiangular to each one's correlations with the residual.

Pros and cons

The advantages of the LARS method are:

1. It is computationally just as fast as forward selection.
2. It produces a full piecewise linear solution path, which is useful in cross-validation or similar attempts to tune the model.
3. If two variables are almost equally correlated with the response, then their coefficients should increase at approximately the same rate. The algorithm thus behaves as intuition would suggest, and also is more stable.
4. It is easily modified to produce efficient algorithms for other methods producing similar results, like the lasso and forward stagewise regression.
5. It is effective in contexts where p ≫ n (i.e., when the number of predictors p is significantly greater than the number of points n)

The disadvantages of the LARS method include:

1. With any amount of noise in the dependent variable and with high dimensional multicollinear independent variables, there is no reason to believe that the selected variables will have a high probability of being the actual underlying causal variables. This problem is not unique to LARS, as it is a general problem with variable selection approaches that seek to find underlying deterministic components. Yet, because LARS is based upon an iterative refitting of the residuals, it appears to be especially sensitive to the effects of noise. This problem is discussed in detail by Weisberg in the discussion section of the Efron et al. (2004) Annals of Statistics article. Weisberg provides an empirical example based upon re-analysis of data originally used to validate LARS that the variable selection appears to have problems with highly correlated variables.
2. Since almost all high dimensional data in the real world will just by chance exhibit some degree of collinearity across at least some variables, the problem that LARS has with correlated variables may limit its application to high dimensional data.

Algorithm

The basic steps of the Least-angle regression algorithm are:

• Start with all coefficients $\beta$ equal to zero.
• Find the predictor $x_{j}$ most correlated with $y$.
• Increase the coefficient $\beta _{j}$ in the direction of the sign of its correlation with $y$. Take residuals $r=y-{\hat {y}}$ along the way. Stop when some other predictor $x_{k}$ has as much correlation with $r$ as $x_{j}$ has.
• Increase ($\beta _{j}$, $\beta _{k}$) in their joint least squares direction, until some other predictor $x_{m}$ has as much correlation with the residual $r$.
• Increase ($\beta _{j}$, $\beta _{k}$, $\beta _{m}$) in their joint least squares direction, until some other predictor $x_{n}$ has as much correlation with the residual $r$.
• Continue until: all predictors are in the model.

Software implementation

Least-angle regression is implemented in R via the lars package, in Python with the scikit-learn package, and in SAS via the GLMSELECT procedure.

See also

• High-dimensional statistics
• Lasso (statistics)
• Regression analysis
• Model selection