PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 9, 2005Journal of the Royal Statistical Society Series B (Statistical Methodology)21,562 citationsOpen Access

Regularization and Variable Selection Via the Elastic Net

View Full Paper
HZHui ZouTHTrevor Hastie

Key Points

  • This research introduces the elastic net as an improved method for regularization and variable selection, particularly in high-dimensional data settings.
  • Proposed the elastic net method for regularization and variable selection.
  • Conducted a simulation study comparing elastic net to lasso in various scenarios.
  • Introduced LARS-EN algorithm for efficiently computing elastic net regularization paths.
  • Elastic net outperformed the lasso in performance, especially in cases where predictors outnumber observations (p≫n).
  • Elastic net maintained a similar level of sparsity when compared to lasso.
  • The grouping effect in elastic net allows correlated predictors to enter or leave the model in concert.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zou et al. (2005) studied this question.

synapsesocial.com/papers/698cce8e10e0d4ea3a9d66d4https://doi.org/10.1111/j.1467-9868.2005.00503.x
Ask AI
Helpful
Bookmark
Share
View Full Paper