Robustness of the deepest projection regression functional
Depth notions in regression have been systematically proposed and examined in Zuo (arXiv:1805.02046, 2018). One of the prominent advantages of the notion of depth is that it can be directly utilized to introduce median-type deepest estimating functionals (or estimators in the case of empirical distributions) for location or regression parameters in a multi-dimensional setting. Regression depth shares the advantage. Depth induced deepest estimating functionals are expected to inherit desirable and inherent robustness properties (e.g. bounded maximum bias and influence function and high breakdown point) as their univariate location counterpart does. Investigating and verifying the robustness of the deepest projection estimating functional (in terms of maximum bias, asymptotic and finite sample breakdown point, and influence function) is the major goal of this article. It turns out that the deepest projection estimating functional possesses a bounded influence function and the best possible asymptotic breakdown point as well as the best finite sample breakdown point with robust choice of its univariate regression and scale component.
KeywordsDepth Linear regression Deepest regression estimating functionals Maximum bias Breakdown point Influence function Robustness
Mathematics Subject ClassificationPrimary 62G05 Secondary 62G08 62G35 62G30
The author thanks Professor Emeritus James Stapleton for his careful English proofreading and an anonymous referee who provided insightful comments and suggestions which have led to significant improvements of the manuscript.
- Donoho DL (1982) Breakdown properties of multivariate location estimators. PhD Qualifying Paper, Harvard UniversityGoogle Scholar
- Donoho DL, Huber P (1983) A Festschrift for Erich L. Lehmann. Wadsworth, Belmont, pp 157–184Google Scholar
- Müller C (2013) Upper and lower bounds for breakdown points. In: Becker C, Fried R, Kuhnt S (eds) Robustness and complex data structures. Festschrift in Honour of Ursula Gather. Springer, Berlin, pp 17–34Google Scholar
- Shao W, Zuo Y (2019) Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm. Comput Stat. https://doi.org/10.1007/s00180-019-00906-x
- Tukey JW (1975) Mathematics and the picturing of data. In: James RD (ed) Proceeding of the international congress of mathematicians, Vancouver 1974, vol 2. Canadian Mathematical Congress, Montreal, pp 523–531Google Scholar
- Zuo Y (2018) On general notions of depth in regression. arXiv:1805.02046