Minimum Distance Lasso for robust high-dimensional regression
Authors:
- Aurélie C. LozanoALAurélie C. Lozano
- Nicolai MeinshausenNMNicolai Meinshausen
- Eunho YangEYEunho Yang
Open Access
- 1 January 2016
- journal article
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 10 (1) , 1296-1340
Abstract
We propose a minimum distance estimation method for robust regression in sparse high-dimensional settings. Likelihood-based estimators lack resilience against outliers and model misspecification, a critical issue when dealing with high-dimensional noisy data. Our method, Minimum Distance Lasso (MD-Lasso), combines minimum distance functionals customarily used in nonparametric estimation for robustness, with $\ell_{1}$-regularization. MD-Lasso is governed by a scaling parameter capping the influence of outliers: the loss is locally convex and close to quadratic for small squared residuals, and flattens for squared residuals larger than the scaling parameter. As the parameter approaches infinity the estimator becomes equivalent to least-squares Lasso. MD-Lasso is able to maintain the robustness of minimum distance functionals in sparse high-dimensional regression. The estimator achieves maximum breakdown point and enjoys consistency with fast convergence rates under mild conditions on the model error distribution. These hold for any solution in a convexity region around the true parameter and in certain cases for every solution. We provide an alternative set of results that do not require the solutions to lie within the convexity region but where the $\ell_{2}$-norm of the feasible solutions is constrained within a safety radius. Thanks to this constraint, a first-order optimization method is able to produce local optima that are consistent. A connection is established with re-weighted least-squares that intuitively explains MD-Lasso robustness. The merits of our method are demonstrated through simulation and eQTL analysis.Keywords
All Related Versions
This publication has 35 references indexed in Scilit:
- Density-Difference EstimationNeural Computation, 2013
- Unveiling Clusters of RNA Transcript Pairs Associated with Markers of Alzheimer’s Disease ProgressionPLOS ONE, 2012
- Robust inversion, dimensionality reduction, and randomized samplingMathematical Programming, 2012
- Optimization with Sparsity-Inducing PenaltiesFoundations and Trends in Machine Learning, 2012
- Neutralization of LINGO-1 during In Vitro Differentiation of Neural Stem Cells Results in Proliferation of Immature NeuronsPLOS ONE, 2012
- Sparse High-Dimensional Models in EconomicsAnnual Review of Economics, 2011
- Phox homology band 4.1/ezrin/radixin/moesin-like proteins function as molecular scaffolds that interact with cargo receptors and Ras GTPasesProceedings of the National Academy of Sciences, 2011
- Genome-wide association analysis by lasso penalized logistic regressionBioinformatics, 2009
- GAB2 Alleles Modify Alzheimer's Risk in APOE ɛ4 CarriersNeuron, 2007
- Robust and efficient estimation by minimising a density power divergenceBiometrika, 1998