Variable Selection with Exponential Weights and -Penalization
arXiv:1208.2635
Abstract
In the context of a linear model with a sparse coefficient vector, exponential weights methods have been shown to be achieve oracle inequalities for prediction. We show that such methods also succeed at variable selection and estimation under the necessary identifiability condition on the design matrix, instead of much stronger assumptions required by other methods such as the Lasso or the Dantzig Selector. The same analysis yields consistency results for Bayesian methods and BIC-type variable selection under similar conditions.
arXiv comment23 pages; 1 figures
References in corpus (6)
- Nearly unbiased variable selection under minimax concave penalty
- Simultaneous analysis of Lasso and Dantzig selector
- Nonconcave penalized likelihood with a diverging number of parameters
- High-dimensional instrumental variables regression and confidence sets
- Exponential Screening and optimal rates of sparse estimation
- Consistent selection via the Lasso for high dimensional approximating regression models