Outlier-robust Estimation of a Sparse Linear Model Using Invexity
Preprint
Abstract
In this paper, we study problem of estimating a sparse regression vector with correct support in the presence of outlier samples. The inconsistency of lasso-type methods is well known in this scenario. We propose a combinatorial version of outlier-robust lasso which also identifies clean samples. Subsequently, we use these clean samples to make a good estimation. We also provide a novel invex relaxation for the combinatorial problem and provide provable theoretical guarantees for this relaxation. Finally, we conduct experiments to validate our theory and compare our results against standard lasso.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Adaptive Huber RegressionJournal of the American Statistical Association, 2019
- Minimum Distance Lasso for robust high-dimensional regressionElectronic Journal of Statistics, 2016
- How Close is the Sample Covariance Matrix to the Actual Covariance Matrix?Journal of Theoretical Probability, 2011
- Robust regression through the Huber’s criterion and adaptive lasso penaltyElectronic Journal of Statistics, 2011
- High-dimensional Ising model selection using ℓ1-regularized logistic regressionThe Annals of Statistics, 2010
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)IEEE Transactions on Information Theory, 2009
- The Adaptive Lasso and Its Oracle PropertiesJournal of the American Statistical Association, 2006
- High-dimensional graphs and variable selection with the LassoThe Annals of Statistics, 2006
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle PropertiesJournal of the American Statistical Association, 2001
- Determination of the inertia of a partitioned Hermitian matrixLinear Algebra and its Applications, 1968