Redescending M-estimators

被引:37
|
作者
Shevlyakov, Georgy [2 ]
Morgenthaler, Stephan [1 ]
Shurygin, Alexander [3 ]
机构
[1] Ecole Polytech Fed Lausanne, SB IMA, CH-1015 Lausanne, Switzerland
[2] Gwangju Inst Sci & Technol, Sch Informat & Mechatron, Kwangju, South Korea
[3] Moscow MV Lomonosov State Univ, Dept Mech & Math, Moscow, Russia
关键词
M-estimators; minimax robustness; change-of-variance function; redescending M-estimators;
D O I
10.1016/j.jspi.2007.11.008
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
in finite sample studies redescending M-estimators outperform bounded M-estimators (see for example, Andrews et al. [1972. Robust Estimates of Location. Princeton University Press, Princeton]). Even though redescenders arise naturally out of the maximum likelihood approach if one uses very heavy-tailed models, the commonly used redescenders have been derived from purely heuristic considerations. Using a recent approach proposed by Shurygin, we study the optimality of redescending M-estimators. We show that redescending M-estimator can be designed by applying a global minimax criterion to locally robust estimators, namely maximizing over a class of densities the minimum variance sensitivity over a class of estimators. As a particular result, we prove that Smith's estimator, which is a compromise between Huber's skipped mean and Tukey's biweight, provides a guaranteed level of an estimator's variance sensitivity over the class of densities with a bounded variance. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:2906 / 2917
页数:12
相关论文
共 50 条