The elastic net method overcomes the limitations of the LASSO method which uses a penalty function based on Use of this penalty function has several limitations. For example, in the "large p, small n" case, the LASSO selects at most n variables before it saturates. Also if there is a group of highly correlated variables, then the LASSO tends to select one variable from a group and ignore the others. To overcome these limitations, the elastic net adds a quadratic part to the penalty, which when used alone is ridge regression. The estimates from the elastic net method are defined by The quadratic penalty term makes the loss function strongly convex, and it therefore has a unique minimum. The elastic net method includes the LASSO and ridge regression: in other words, each of them is a special case where or. Meanwhile, the naive version of elastic net method finds an estimator in a two-stage procedure : first for each fixed it finds the ridge regression coefficients, and then does a LASSO type shrinkage. This kind of estimation incurs a double amount of shrinkage, which leads to increased bias and poor predictions. To improve the prediction performance, the authors rescale the coefficients of the naive version of elastic net by multiplying the estimated coefficients by. Examples of where the elastic net method has been applied are:
In late 2014, it was proven that the elastic net can be reduced to the linear support vector machine. A similar reduction was previously proven for the LASSO in 2014. The authors showed that for every instance of the elastic net, an artificial binary classification problem can be constructed such that the hyper-plane solution of a linear support vector machine is identical to the solution . The reduction immediately enables the use of highly optimized SVM solvers for elastic net problems. It also enables the use of GPU acceleration, which is often already used for large-scale SVM solvers. The reduction is a simple transformation of the original data and regularization constants into new artificial data instances and a regularization constant that specify a binary classification problem and the SVM regularization constant Here, consists of binary labels. When it is typically faster to solve the linear SVM in the primal, whereas otherwise the dual formulation is faster. The authors referred to the transformation as Support Vector Elastic Net, and provided the following MATLAB pseudo-code: function β=SVEN; =size; X2 = ’; Y2=; if 2p>n then w = SVMPrimal; α = C * max; else α = SVMDual; end if β = t * - α) / sum;
Software
"Glmnet: Lasso and elastic-net regularized generalized linear models" is a software which is implemented as an R source package and as a MATLAB toolbox. This includes fast algorithms for estimation of generalized linear models with ℓ1, ℓ2 and mixtures of the two penalties using cyclical coordinate descent, computed along a regularization path.
JMP Pro 11 includes elastic net regularization, using the Generalized Regression personality with Fit Model.
"pensim: Simulation of high-dimensional data and parallelized repeated penalized regression" implements an alternate, parallelised "2D" tuning method of the ℓ parameters, a method claimed to result in improved prediction accuracy.
SVEN, a Matlab implementation of Support Vector Elastic Net. This solver reduces the Elastic Net problem to an instance of SVM binary classification and uses a Matlab SVM solver to find the solution. Because SVM is easily parallelizable, the code can be faster than Glmnet on modern hardware.
, a Matlab implementation of sparse regression, classification and principal component analysis, including elastic net regularized regression.
Apache Spark provides support for Elastic Net Regression in its machine learning library. The method is available as a parameter of the more general LinearRegression class.
SAS The SAS procedure Glmselect supports the use of elastic net regularization for model selection.
