.png){kind=icon}
.png){kind=icon}
Return
Adaptive Huber Regression
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2018.1543124.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Big data can easily be contaminated by outliers or contain variables with heavy-tailed distributions, which makes many conventional methods inadequate. To address this challenge, we propose the adaptive Huber regression for robust estimation and inference. The key observation is that the robustification parameter should adapt to the sample size, dimension and moments for optimal tradeoff between bias and robustness. Our theoretical framework deals with heavy-tailed distributions with bounded th moment for any . We establish a sharp phase transition for robust estimation of regression parameters in both low and high dimensions: when , the estimator admits a sub-Gaussian-type deviation bound without sub-Gaussian assumptions on the data, while only a slower rate is available in the regime and the transition is smooth and optimal. In addition, we extend the methodology to allow both heavy-tailed predictors and observation noise. Simulation studies lend further support to the theory. In a genetic study of cancer cell lines that exhibit heavy-tailedness, the proposed methods are shown to be more robust and predictive. for this article are available online.
Keywords:
Adaptive Huber regression
Bias and robustness tradeoff
Finite-sample inference
Heavy-tailed data
Nonasymptotic optimality
Phase transition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3
Papers:
5.1K
Citations:
4.8W
Organization
View more organizations