pith. sign in

arxiv: 1011.1373 · v1 · pith:RMXV3XPCnew · submitted 2010-11-05 · 📊 stat.ME · stat.ML

The Loss Rank Criterion for Variable Selection in Linear Regression Analysis

classification 📊 stat.ME stat.ML
keywords selectioncriterionvariablemodelapproachconsistencyregularizationwhen
0
0 comments X
read the original abstract

Lasso and other regularization procedures are attractive methods for variable selection, subject to a proper choice of shrinkage parameter. Given a set of potential subsets produced by a regularization algorithm, a consistent model selection criterion is proposed to select the best one among this preselected set. The approach leads to a fast and efficient procedure for variable selection, especially in high-dimensional settings. Model selection consistency of the suggested criterion is proven when the number of covariates d is fixed. Simulation studies suggest that the criterion still enjoys model selection consistency when d is much larger than the sample size. The simulations also show that our approach for variable selection works surprisingly well in comparison with existing competitors. The method is also applied to a real data set.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.