Logo image
Back
Estimation And Selection Via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications
Preprint   Open access

Estimation And Selection Via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications

Jian Huang and Cun-Hui Zhang
ArXiv.org
12/29/2011
DOI: 10.48550/arXiv.1112.6363
url
https://doi.org/10.48550/arXiv.1112.6363View
Preprint (Author's original)This preprint has not been evaluated by subject experts through peer review. Preprints may undergo extensive changes and/or become peer-reviewed journal articles. Open Access

Abstract

The ℓ1-penalized method, or the Lasso, has emerged as an important tool for the analysis of large data sets. Many important results have been obtained for the Lasso in linear regression which have led to a deeper understanding of high-dimensional statistical problems. In this article, we consider a class of weighted ℓ1-penalized estimators for convex loss functions of a general form, including the generalized linear models. We study the estimation, prediction, selection and sparsity properties of the weighted ℓ1-penalized estimator in sparse, high-dimensional settings where the number of predictors p can be much larger than the sample size n. Adaptive Lasso is considered as a special case. A multistage method is developed to apply an adaptive Lasso recursively. We provide ℓq oracle inequalities, a general selection consistency theorem, and an upper bound on the dimension of the Lasso estimator. Important models including the linear regression, logistic regression and log-linear models are used throughout to illustrate the applications of the general results.

Details

Metrics

41 Record Views
Logo image