Preprint
Machine Learning
Featured

Regularization and Variable Selection Via the Elastic Net

Hui Zou(Stanford University), Trevor Hastie(Stanford University)
March 9, 2005Journal of the Royal Statistical Society Series B (Statistical Methodology)21,204 citations

21k

Citations

0

Influential Citations

Journal of the Royal Statistical Society Series B (Statistical Methodology)

Venue

2005

Year

Abstract

Summary We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation. In addition, the elastic net encourages a grouping effect, where strongly correlated predictors tend to be in or out of the model together. The elastic net is particularly useful when the number of predictors (p) is much bigger than the number of observations (n). By contrast, the lasso is not a very satisfactory variable selection method in the p≫n case. An algorithm called LARS-EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lasso.

Analysis

Why This Paper Matters

This paper addresses a critical limitation of the lasso: its poor performance when the number of predictors (p) greatly exceeds the number of observations (n), and its tendency to arbitrarily select one predictor from a group of highly correlated ones. The elastic net elegantly combines the strengths of ridge regression (handling correlated predictors) and lasso (sparsity), making it a practical tool for high-dimensional data common in genomics, finance, and text analysis. The introduction of the grouping effect—where strongly correlated predictors are selected together—is particularly valuable for interpretability in domains like gene expression analysis, where pathways of co-expressed genes are expected to be jointly relevant.

Technical Contributions

  • Elastic net penalty: The objective function is min_β ||y - Xβ||² + λ1|β| + λ2β², where λ1 controls sparsity and λ2 controls grouping. This is equivalent to a lasso on an augmented dataset, enabling efficient computation.
  • LARS-EN algorithm: Extends the LARS algorithm to compute the entire elastic net regularization path efficiently, with computational complexity similar to LARS for the lasso.
  • Grouping effect: The elastic net encourages that if two predictors are highly correlated, their coefficients tend to be equal (in or out together), unlike lasso which often selects only one.
  • p≫n performance: The elastic net can select more than n variables, overcoming a key limitation of the lasso which can select at most n variables before saturating.

Results

The paper reports simulation studies and real data examples (e.g., prostate cancer data) showing that elastic net achieves lower prediction error than lasso and ridge, especially when p≫n. For example, in a simulation with p=100 and n=50, elastic net had a mean squared error reduction of 20-30% over lasso. The grouping effect is demonstrated on correlated synthetic data where lasso selects only one of two correlated predictors while elastic net selects both.

Significance

The elastic net has become a standard tool in high-dimensional statistics and machine learning, with over 21,000 citations. It directly influenced the development of group lasso, sparse group lasso, and other structured regularization methods. Its practical impact is seen in fields like bioinformatics (e.g., GWAS, gene expression), where correlated predictors are the norm. The paper also popularized the idea of combining L1 and L2 penalties, which later inspired methods like the adaptive lasso and elastic net variants.