A Fast Algorithm for S-Regression Estimates
Matías Salibián‐Barrera, Vı́ctor J. Yohai · Journal of Computational and Graphical Statistics · 2006
Equivariant high-breakdown point regression estimates are computationally expensive, and the corresponding algorithms become unfeasible for moderately large number of regressors. One important advance to improve the computational speed of one such estimator is the fast-LTS algorithm. This article proposes an analogous algorithm for computing S-estimates. The new algorithm, that we call “fast-S”, is also based on a “local improvement” step of the resampling initial candidates. This allows for a substantial reduction of the number of candidates required to obtain a good approximation to the optimal solution. We performed a simulation study which shows that S-estimators computed with the fast-S algorithm compare favorably to the LTS-estimators computed with the fast-LTS algorithm.
Cited by 238 works. doi:10.1198/106186006x113629
Authors
References
- Robust Estimation of a Location Parameter
- Robust Regression and Outlier Detection
- Least Median of Squares Regression
- A General Qualitative Definition of Robustness
- A Fast Algorithm for the Minimum Covariance Determinant Estimator
- High Breakdown-Point and High Efficiency Robust Estimates for Regression
- Robust Regression by Means of S-Estimators
- Cube Root Asymptotics
- Identification of Outliers in Multivariate Data
- IEEE Transactions on Power Systems