A Comparison of Hamming Errors of Representative Variable Selection Methods
Tracy Ke, Longlin Wang
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- Deciphering Lasso-based Classification Through a Large Dimensional Analysis of the Iterative Soft-Thresholding AlgorithmMalik Tiomoko, Ekkehard Schnoor, Mohamed El Amine Seddik, Igor Colin 等ICML 2022 · 被引用 4 次
- Provably tuning the ElasticNet across instancesMaria-Florina Balcan, Misha Khodak, Dravyansh Sharma, Ameet TalwalkarNeurIPS 2022 · 被引用 28 次
- Regularization properties of adversarially-trained linear regressionAntônio H. Ribeiro, Dave Zachariah, Francis R. Bach, Thomas B. SchönNeurIPS 2023 · 被引用 23 次
- The Hessian Screening RuleJohan Larsson, Jonas WallinNeurIPS 2022 · 被引用 4 次
- The Complete Lasso Tradeoff DiagramHua Wang, Yachong Yang, Zhiqi Bu, Weijie J. SuNeurIPS 2020 · 被引用 8 次
