A Comparison of Hamming Errors of Representative Variable Selection Methods
Tracy Ke, Longlin Wang
Abstract
Lasso is a celebrated method for variable selection in linear models, but it faces challenges when the variables are moderately or strongly correlated. This motivates alternative approaches such as using a non-convex penalty, adding a ridge regularization, or conducting a post-Lasso thresholding. In this paper, we compare Lasso with 5 other methods: Elastic net, SCAD, forward selection, thresholded Lasso, and forward backward selection. We measure their performances theoretically by the expected Hamming error, assuming that the regression coefficients are iid drawn from a two-point mixture and that the Gram matrix is block-wise diagonal. By deriving the rates of convergence of Hamming errors and the phase diagrams, we obtain useful conclusions about the pros and cons of different methods.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 19438ace-17e4-4a36-8574-4b447d50b0baRelated papers
- Deciphering Lasso-based Classification Through a Large Dimensional Analysis of the Iterative Soft-Thresholding AlgorithmMalik Tiomoko, Ekkehard Schnoor, Mohamed El Amine Seddik, Igor Colin et al.ICML 2022 · 4 citations
- Provably tuning the ElasticNet across instancesMaria-Florina Balcan, Misha Khodak, Dravyansh Sharma, Ameet TalwalkarNeurIPS 2022 · 28 citations
- Regularization properties of adversarially-trained linear regressionAntônio H. Ribeiro, Dave Zachariah, Francis R. Bach, Thomas B. SchönNeurIPS 2023 · 23 citations
- The Hessian Screening RuleJohan Larsson, Jonas WallinNeurIPS 2022 · 4 citations
- The Complete Lasso Tradeoff DiagramHua Wang, Yachong Yang, Zhiqi Bu, Weijie J. SuNeurIPS 2020 · 8 citations
