mlsanityData to 14 Oct 2026

The Adaptive τ-Lasso: Robustness and Oracle Properties

arXiv 2304.09310 ↗First posted 18 Apr 2023stat.ML cs.LG eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper introduces a new regularized version of the robust τ-regression estimator for analyzing high-dimensional datasets subject to gross contamination in the response variables and covariates. The resulting estimator, termed adaptive τ-Lasso, is robust to outliers and high-leverage points. It also incorporates an adaptive ℓ1-norm penalty term, which enables the selection of relevant variables and reduces the bias associated with large true regression coefficients. More specifically, this adaptive ℓ1-norm penalty term assigns a weight to each regression coefficient. For a fixed number of predictors p, we show that the adaptive τ-Lasso has the oracle property, ensuring both variable-selection consistency and asymptotic normality. Asymptotic normality applies only to the entries of the regression vector corresponding to the true support, assuming knowledge of the true regression vector support. We characterize its robustness by establishing the finite-sample breakdown point and the influence function. We carry out extensive simulations and observe that the class of τ-Lasso estimators exhibits robustness and reliable performance in both contaminated and uncontaminated data settings. We also validate our theoretical findings on robustness properties through simulations. In the face of outliers and high-leverage points, the adaptive τ-Lasso and τ-Lasso estimators achieve the best performance or match the best performances of competing regularized estimators, with minimal or no loss in terms of prediction and variable selection accuracy for almost all scenarios considered in this study. Therefore, the adaptive τ-Lasso and τ-Lasso estimators provide attractive tools for a variety of sparse linear regression problems, particularly in high-dimensional settings and when the data is contaminated by outliers and high-leverage points.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 58 references that are in the map. First posted on arXiv 18 Apr 2023.

Builds on

10 of 58 references.

References · 10

  1. 2013Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optimacited by 66
  2. 2017Adaptive Huber Regressioncited by 60
  3. 2020Robust regression with covariate filtering: Heavy tails and adversarial contaminationcited by 50
  4. 2015Statistical consistency and asymptotic normality for high-dimensional robust M-estimatorscited by 27
  5. 2014Support recovery without incoherence: A case for nonconvex regularizationcited by 25
  6. 2018Scale calibration for high-dimensional robust regressioncited by 6
  7. 2018Ultrahigh-dimensional Robust and Efficient Sparse Regression using Non-Concave Penalized Density Power Divergencecited by 3
  8. 2016The regularized tau estimator: A robust and efficient solution to ill-posed linear inverse problemscited by 2
  9. 2021Robust Variable Selection and Estimation Via Adaptive Elastic Net S-Estimators for Linear Regressioncited by 1
  10. 2022Two-Stage Robust and Sparse Distributed Statistical Inference for Large-Scale Datacited by 1

Built on by

Not cited yet.