Estimation And Selection Via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications
Year: 2011
Type: article
Abstract: . Adaptive Lasso is considered as a special case. A multistage method is developed to approximate concave regularized estimation by applying an adaptive Lasso recursively. We provide prediction and estimation oracle inequalities for single- and multi-stage estimators, a general selection consistency theorem, and an upper bound for 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.
Source: PubMed
Authors: Huang, Jian, Zhang, Cun-Hui
Language: English
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Cancer Institute
OpenAlex ID: W1924642174
