arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.10329stat.ME
收藏

截尾残差最小平方和回归

Least sum of squares of trimmed residuals regression

Yijun Zuo

摘要:

在著名的残差估计量的最小截尾平方和(LTS)中,残差首先被平方,然后被修剪。在本文中,我们首先修剪残差-使用深度修剪方案-然后平方剩余的残差。能使截尾残差的平方和最小的估计量称为LST估计量。事实证明,LST是经典的最小二乘估计(LS)的一个强大的替代品。事实上,它具有非常高的有限样本击穿点,并且可以渐进地抵抗高达$50\%$的污染而不击穿-与LS估计器的$0\%$形成鲜明对比。LST的总体版本是Fisher相容的,样本版本是强的和根$n$相容的,并且是渐近正态的。计算LST的近似算法提出和测试合成和真实数据的例子。这些实验表明,其中一种算法可以非常快地计算LST估计量,并且比著名的LTS估计量具有相对较小的方差。所有的证据表明,LST值得是一个强大的替代LS估计,并在实践中是可行的高维数据集(可能的污染和离群值)。

英文摘要:

In the famous least sum of trimmed squares (LTS) of residuals estimator (Rousseeuw (1984)), residuals are first squared and then trimmed. In this article, we first trim residuals - using a depth trimming scheme - and then square the rest of residuals. The estimator that can minimize the sum of squares of the trimmed residuals, is called an LST estimator. It turns out that LST is a robust alternative to the classic least sum of squares (LS) estimator. Indeed, it has a very high finite sample breakdown point, and can resist, asymptotically, up to $50\%$ contamination without breakdown - in sharp contrast to the $0\%$ of the LS estimator. The population version of LST is Fisher consistent, and the sample version is strong and root-$n$ consistent and asymptotically normal. Approximate algorithms for computing LST are proposed and tested in synthetic and real data examples. These experiments indicate that one of the algorithms can compute the LST estimator very fast and with relatively smaller variances than the famous LTS estimator. All the evidence suggests that LST deserves to be a robust alternative to the LS estimator and is feasible in practice for high dimensional data sets (with possible contamination and outliers).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑