The Square-root Elastic Net With a New Calculating Method
DOI:
https://doi.org/10.54097/hset.v49i.8597Keywords:
Variable selection; Elastic net; Square-root lasso; Proximal gradient.Abstract
The elastic net is a well-known algorithm and powerful in simultaneous estimation and variable selection under diverse conditions. In this paper, we proposed a novel version called square-root elastic net, which expands the application of the elastic net in some common cases that the noise distribution of data is not normal. We showed a calculating method based on proximal gradient descent combined with backtracking. Similar to the elastic net, the square-root elastic net can select more essential features than the sample size. Furthermore, the mean square error of the square-root elastic net is remarkably reduced when dealing with the abnormal noise compared to the elastic net.
Downloads
References
Hocking R. R., Leslie, R. N. Selection of the best subset in regression analysis [J]. Technometrics, 1967, 9(4): 531-540.
Tibshirani R. Regression shrinkage and selection via the lasso [J]. Journal of the Royal Statistical Society, Series B, 1996, 58(1).
Tibshirani, Ryan J. The Lasso Problem and Uniqueness [J]. Electronic Journal of Stats, 2013, 7(1): 1456-1490.
Tibshirani R. Regression shrinkage and selection via the lasso: a retrospective[J]. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 2011, 73(3): 273-282.
Belloni A, Chernozhukov V, Wang L. Square-root lasso: pivotal recovery of sparse signals via conic programming [J]. Biometrika, 2011, 98(4): 791-806.
Zou H, Hastie T. Regularization and variable selection via the elastic net[J]. Journal of the royal statistical society: series B (statistical methodology), 2005, 67(2): 301-320.
Fu W J. Penalized regressions: the bridge versus the lasso[J]. Journal of computational and graphical statistics, 1998, 7(3): 397-416.
Beck A, Teboulle M. Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints[J]. Siam Journal on Optimization, 2008, 11(1):179-188.
Nesterov Y. Smooth minimization of non-smooth functions [J]. Mathematical Programming, 2005, 103(1):127-152.
Beck A, Tabouleh M. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems[J]. Siam J Imaging Sciences, 2009, 2(1): 183-202.
Tseng P. On accelerated proximal gradient methods for convex-concave optimization [J]. submitted to SIAM Journal on Optimization, 2008, 2(3).
Belloni A, Chernozhukov V, Wang L. Square-root lasso: pivotal recovery of sparse signals via conic programming [J]. Biometrika, 2011, 98(4): 791-806.
Bickel P J, Ritov Y, Tsybakov A B. Simultaneous analysis of Lasso and Dantzig selector [J]. The Annals of statistics, 2009, 37(4): 1705-1732.
F Bunea, Lederer J, She Y. The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms[J]. IEEE Transactions on Information Theory, 2013, 60(2): 1313-1325.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
