{"title":"裁剪残差回归的最小平方和","authors":"Yijun Zuo, Hanwen Zuo","doi":"10.1214/23-ejs2164","DOIUrl":null,"url":null,"abstract":"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 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 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.","PeriodicalId":49272,"journal":{"name":"Electronic Journal of Statistics","volume":"2010 1","pages":"0"},"PeriodicalIF":1.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Least sum of squares of trimmed residuals regression\",\"authors\":\"Yijun Zuo, Hanwen Zuo\",\"doi\":\"10.1214/23-ejs2164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 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 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.\",\"PeriodicalId\":49272,\"journal\":{\"name\":\"Electronic Journal of Statistics\",\"volume\":\"2010 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1214/23-ejs2164\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1214/23-ejs2164","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
Least sum of squares of trimmed residuals regression
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 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 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.
期刊介绍:
The Electronic Journal of Statistics (EJS) publishes research articles and short notes on theoretical, computational and applied statistics. The journal is open access. Articles are refereed and are held to the same standard as articles in other IMS journals. Articles become publicly available shortly after they are accepted.