Least sum of squares of trimmed residuals regression

被引:2
|
作者
Zuo, Yijun [1 ]
Zuo, Hanwen
机构
[1] Michigan State Univ, Dept Stat & Probabil, E Lansing, MI 48824 USA
来源
ELECTRONIC JOURNAL OF STATISTICS | 2023年 / 17卷 / 02期
关键词
Trimmed residuals; robust regression; finite sam-ple breakdown point; consistency; approximate computation algorithm; HIGH BREAKDOWN-POINT; HALF-SPACE DEPTH; GENERAL NOTIONS; ALGORITHM;
D O I
10.1214/23-EJS2164
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
In the famous least sum of trimmed squares (LTS) estimator [21], residuals are first squared and then trimmed. In this article, we first trim residuals - using a depth trimming scheme - and then square the remaining of residuals. The estimator that minimizes the sum of trimmed and squared residuals, is called an LST estimator. Not only is the LST a robust alternative to the classic least sum of squares (LS) estimator. It also has a high finite sample breakdown pointand can resist, asymptotically, up to 50% contamination without breakdown - in sharp contrast to the 0% of the LS estimator. The population version of the LST is Fisher consistent, and the sample version is strong, root-n consistent, and asymptotically normal. We propose approximate algorithms for computing the LST and test on synthetic and real data sets. Despite being approximate, one of the algorithms compute the LST estimator quickly with relatively small variances in contrast to the famous LTS estimator. Thus, evidence suggests the LST serves as a robust alternative to the LS estimator and is feasible even in high dimension data sets with contamination and outliers.
引用
收藏
页码:2416 / 2446
页数:31
相关论文
共 50 条