Penalized Composite Quasi-Likelihood for Ultrahigh-Dimensional Variable Selection
TLDR
A data‐driven weighted linear combination of convex loss functions, together with weighted L1‐penalty is proposed and established a strong oracle property of the method proposed that has both the model selection consistency and estimation efficiency for the true non‐zero coefficients.Abstract:
In high-dimensional model selection problems, penalized least-square approaches have been extensively used. This paper addresses the question of both robustness and efficiency of penalized model selection methods, and proposes a data-driven weighted linear combination of convex loss functions, together with weighted L1-penalty. It is completely data-adaptive and does not require prior knowledge of the error distribution. The weighted L1-penalty is used both to ensure the convexity of the penalty term and to ameliorate the bias caused by the L1-penalty. In the setting with dimensionality much larger than the sample size, we establish a strong oracle property of the proposed method that possesses both the model selection consistency and estimation efficiency for the true non-zero coefficients. As specific examples, we introduce a robust method of composite L1-L2, and optimal composite quantile method and evaluate their performance in both simulated and real data examples.read more
Citations
More filters
Journal ArticleDOI
Efficient robust doubly adaptive regularized regression with applications
TL;DR: A new penalized procedure is constructed that simultaneously attains full efficiency and maximum robustness and satisfies the oracle properties in the problem of estimation and variable selection for general linear regression models.
Journal ArticleDOI
BLP-Lasso for Aggregate Discrete Choice Models of Elections with Rich Demographic Covariates
TL;DR: In this article, the effect of campaign spending on vote shares in data from Mexican elections was investigated using a data-driven approach to estimate these models applying penalized estimation algorithms imported from the machine learning literature along with confidence intervals that are robust to variable selection.
Posted Content
Endogeneity in ultrahigh dimension
Jianqing Fan,Yuan Liao +1 more
TL;DR: In this article, a penalized focussed generalized method of moments (FGMM) criterion function is proposed to cope with the possible endogeneity of high-dimensional regression due to a large pool of regressors.
Journal ArticleDOI
Adaptive elastic net-penalized quantile regression for variable selection
Ailing Yan,Fengli Song +1 more
TL;DR: In this paper, the authors consider the high-dimensional linear regression models and show that the number of observations is much less than that of covariates, considering the fact that the high dimen...
Journal ArticleDOI
Variable selection via composite quantile regression with dependent errors
TL;DR: In this article, the authors proposed composite quantile regression for dependent data, in which the errors are from short-range dependent and strictly stationary linear processes, and they investigated the asymptotic relative efficiency of composite quantiles estimator to both single-level quantile regressions and least-squares regressions.
References
More filters
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Journal ArticleDOI
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Jianqing Fan,Runze Li +1 more
TL;DR: In this article, penalized likelihood approaches are proposed to handle variable selection problems, and it is shown that the newly proposed estimators perform as well as the oracle procedure in variable selection; namely, they work as well if the correct submodel were known.
Journal ArticleDOI
Least angle regression
Bradley Efron,Trevor Hastie,Iain M. Johnstone,Robert Tibshirani,Hemant Ishwaran,Keith Knight,Jean-Michel Loubes,Jean-Michel Loubes,Pascal Massart,Pascal Massart,David Madigan,David Madigan,Greg Ridgeway,Greg Ridgeway,Saharon Rosset,Saharon Rosset,Ji Zhu,Robert A. Stine,Berwin A. Turlach,Sanford Weisberg +19 more
TL;DR: A publicly available algorithm that requires only the same order of magnitude of computational effort as ordinary least squares applied to the full set of covariates is described.
Journal ArticleDOI
The adaptive lasso and its oracle properties
TL;DR: A new version of the lasso is proposed, called the adaptive lasso, where adaptive weights are used for penalizing different coefficients in the ℓ1 penalty, and the nonnegative garotte is shown to be consistent for variable selection.
Journal ArticleDOI
Robust Estimation of a Location Parameter
TL;DR: In this article, a new approach toward a theory of robust estimation is presented, which treats in detail the asymptotic theory of estimating a location parameter for contaminated normal distributions, and exhibits estimators that are asyptotically most robust (in a sense to be specified) among all translation invariant estimators.