Model-Consistent Sparse Estimation through the Bootstrap

Details Model-Consistent Sparse Estimation through the Bootstrap Model-Consistent Sparse Estimation through the Bootstrap

2009-01-21

arxiv.org/abs/0901.3202v1

Computer Science

Learning

Scientific paper

We consider the least-square linear regression problem with regularization by the $\ell^1$-norm, a problem usually referred to as the Lasso. In this paper, we first present a detailed asymptotic analysis of model consistency of the Lasso in low-dimensional settings. For various decays of the regularization parameter, we compute asymptotic equivalents of the probability of correct model selection. For a specific rate decay, we show that the Lasso selects all the variables that should enter the model with probability tending to one exponentially fast, while it selects all other variables with strictly positive probability. We show that this property implies that if we run the Lasso for several bootstrapped replications of a given sample, then intersecting the supports of the Lasso bootstrap estimates leads to consistent model selection. This novel variable selection procedure, referred to as the Bolasso, is extended to high-dimensional settings by a provably consistent two-step procedure.

Affiliated with

Also associated with

No associations

Rating

Model-Consistent Sparse Estimation through the Bootstrap does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Model-Consistent Sparse Estimation through the Bootstrap, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model-Consistent Sparse Estimation through the Bootstrap will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684169