Calibrated zero-norm regularized LS estimator for high-dimensional error-in-variables regression
From MaRDI portal
Abstract: This paper is concerned with high-dimensional error-in-variables regression that aims at identifying a small number of important interpretable factors for corrupted data from many applications where measurement errors or missing data can not be ignored. Motivated by CoCoLasso due to Datta and Zou cite{Datta16} and the advantage of the zero-norm regularized LS estimator over Lasso for clean data, we propose a calibrated zero-norm regularized LS (CaZnRLS) estimator by constructing a calibrated least squares loss with a positive definite projection of an unbiased surrogate for the covariance matrix of covariates, and use the multi-stage convex relaxation approach to compute the CaZnRLS estimator. Under a restricted eigenvalue condition on the true matrix of covariates, we derive the -error bound of every iterate and establish the decreasing of the error bound sequence, and the sign consistency of the iterates after finite steps. The statistical guarantees are also provided for the CaZnRLS estimator under two types of measurement errors. Numerical comparisons with CoCoLasso and NCL (the nonconvex Lasso proposed by Poh and Wainwright cite{Loh11}) demonstrate that CaZnRLS not only has the comparable or even better relative RSME but also has the least number of incorrect predictors identified.
Recommendations
- CoCoLasso for high-dimensional error-in-variables regression
- Sparse estimation in high-dimensional linear errors-in-variables regression via a covariate relaxation method
- An \(\{\ell_{1},\ell_{2},\ell_{\infty}\}\)-regularization approach to high-dimensional errors-in-variables models
- Balanced estimation for high-dimensional measurement error models
- Weighted \(\ell_1\)-penalized corrected quantile regression for high dimensional measurement error models
Cites work
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- An \(\{\ell_{1},\ell_{2},\ell_{\infty}\}\)-regularization approach to high-dimensional errors-in-variables models
- CoCoLasso for high-dimensional error-in-variables regression
- Convex Analysis
- Error Distribution for Gene Expression Data
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Improved matrix uncertainty selector
- Linear and conic programming estimators in high dimensional errors-in-variables models
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
- Missing values: sparse inverse covariance estimation and an extension to sparse regression
- Nearly unbiased variable selection under minimax concave penalty
- On the conditions used to prove oracle results for the Lasso
- One-step sparse estimates in nonconcave penalized likelihood models
- Regularization and Variable Selection Via the Elastic Net
- Restricted eigenvalue properties for correlated Gaussian designs
- Sparse recovery under matrix uncertainty
- Statistics for high-dimensional data. Methods, theory and applications.
- The Adaptive Lasso and Its Oracle Properties
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(2)
This page was built for publication: Calibrated zero-norm regularized LS estimator for high-dimensional error-in-variables regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5004050)
