Robust and sparse estimation methods for high dimensional linear and logistic regression
Not on the map. Why?
Abstract (arXiv)
Fully robust versions of the elastic net estimator are introduced for linear and logistic regression. The algorithms to compute the estimators are based on the idea of repeatedly applying the non-robust classical estimators to data subsets only. It is shown how outlier-free subsets can be identified efficiently, and how appropriate tuning parameters for the elastic net penalties can be selected. A final reweighting step improves the efficiency of the estimators. Simulation studies compare with non-robust and other competing robust estimators and reveal the superiority of the newly proposed methods. This is also supported by a reasonable computation time and by good performance in real data examples.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Mar 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1.
3 papers.
- 2021Gaining Outlier Resistance with Progressive Quantiles: Fast Algorithms and Theoretical Studiescited by 5
- 2023Robust penalized least squares of depth trimmed residuals regression for high-dimensional datacited by 0
- 2024Adaptive and Stratified Subsampling for High-Dimensional Robust Estimationcited by 0
- 2024Adaptive and Stratified Subsampling for High-Dimensional Robust Estimation16 Oct 2024
- 2023Robust penalized least squares of depth trimmed residuals regression for high-dimensional data4 Sep 2023
- 2021Gaining Outlier Resistance with Progressive Quantiles: Fast Algorithms and Theoretical Studies15 Dec 2021