Robust statistics

Robust statistics provides an alternative approach to classical statistical methods. The motivation is to produce estimators that are not unduly affected by small departures from model assumptions.

## Contents

* 1 Introduction
* 2 Example: speed of light data
* 2.1 Estimation of location
* 2.2 Estimation of scale
* 2.3 Manual screening for outliers
* 2.4 Variety of applications
* 3 Measures of robustness
* 3.1 Breakdown point
* 3.1.1 Example: speed of light data
* 3.2 Empirical influence function
* 3.3 Influence function and sensitivity curve
* 4 Desirable properties
* 4.1 Rejection point
* 4.2 Gross-error sensitivity
* 4.3 Local-shift sensitivity
* 5 M-estimators
* 5.1 Properties of M-estimators
* 5.2 Influence function of an M-estimator
* 5.3 Choice of <math>\psi</math> and <math>\rho</math>
* 6 Robust parametric approaches
* 6.1 Example: speed of light data
* 7 Key contributors
* 8 References
* 9 See also
* 10 External links

## Introduction

[edit | edit source]

In statistics, classical methods rely heavily on assumptions which are often not met in practice. In particular, it is often assumed that the data are normally distributed, at least approximately, or that the central limit theorem can be relied on to produce normally distributed estimates. Unfortunately, when there are outliers in the data, classical methods often have very poor performance. Robust statistics seeks to provide methods that emulate classical methods, but which are not unduly affected by outliers or other small departures from model assumptions.

In order to quantify the robustness of a method, it is necessary to define some measures of robustness. Perhaps the most common of these are the breakdown point and the influence function, described below.

Good books on robust statistics include those by Huber (1981), Hampel et al (1986) and Rousseeuw and Leroy (1987). A modern treatment is given by Maronna et al (2006). Huber's book is quite theoretical, whereas the book by Rousseew and Leroy is very practical (although the sections discussing software are rather out of date, the bulk of the book is still very relevant). Hampel et al (1987) and Maronna et al (2006) fall somewhere in the middle ground. All four of these are recommended reading, though Maronna et al is the most up to date.

Robust parametric statistics tends to rely on replacing the normal distribution in classical methods with the t-distribution with low degrees of freedom (high kurtosis; degrees of freedom between 4 and 6 have often been found to be useful in practice) or with a mixture of two or more distributions.

## Example: speed of light data

[edit | edit source]

Gelman et al. in Bayesian Data Analysis (2004) consider a data set relating to speed of light measurements made by Simon Newcomb. The data sets for that book can be found via the Classic data sets page, and the book's website contains more information on the data.

Although the bulk of the data look to be more or less normally distributed, there are two obvious outliers. These outliers have a large effect on the mean, dragging it towards them, and away from the center of the bulk of the data. Thus, if the mean is intended as a measure of the location of the center of the data, it is, in a sense, biased when outliers are present.

Also, the distribution of the mean is known to be asymptotically normal due to the central limit theorem. However, outliers can make the distribution of the mean non-normal even for fairly large data sets. Besides this non-normality, the mean is also inefficient in the presence of outliers and less variable measures of location are available.

### Estimation of location

[edit | edit source]

The plot below shows a density plot of the speed of light data, together with a rug plot (panel (a)). Also shown is a normal QQ-plot (panel (b)). The outliers are clearly visible in these plots.

Panels (c) and (d) of the plot show the bootstrap distribution of the mean (c) and the 10% trimmed mean (d). The trimmed mean is a simple robust estimator of location that deletes a certain percentage of observations (10% here) from each end of the data, then computes the mean in the usual way. The analysis was performed in R and 10 000 bootstrap samples were used for each of the raw and trimmed means.

The distribution of the mean is clearly much wider than that of the 10% trimmed mean (the plots are on the same scale). Also note that whereas the distribution of the trimmed mean appears to be close to normal, the distribution of the raw mean is quite skewed to the left. So, in this sample of 66 observations, only 2 outliers cause the central limit theorem to be inapplicable.

File:SpeedOfLight.png

Robust statistical methods, of which the trimmed mean is a simple example, seek to outperform classical statistical methods in the presence of outliers, or, more generally, when underlying parametric assumptions are not quite correct.

Whilst the trimmed mean performs well relative to the mean in this example, better robust estimates are available. In fact, the mean, median and trimmed mean are all special cases of M-estimators. Details appear in the sections below.

### Estimation of scale

[edit | edit source]

The outliers in the speed of light data do not just have an adverse effect on the mean. The usual estimate of scale is the standard deviation, and this quantity is even more badly affected by outliers because the squares of the deviations from the mean go into the calcuation, so the outliers' effects are exacerbated.

The plots below show the bootstrap distributions of the standard deviation, median absolute deviation (MAD) and Qn estimator of scale (Rousseeuw and Croux, 1993). The plots are based on 10000 bootstrap samples for each estimator, and some normal random noise was added to the resampled data (smoothed bootstrap). Panel (a) shows the distribution of the standard deviation, (b) of the MAD and (c) of Qn.

File:SpeedOfLightScale.png

The distribution of standard deviation is erratic and wide, a result of the outliers. The MAD is better behaved, and Qn is a little bit more efficient than MAD. This simple example demonstrates that when outliers are present, the standard deviation cannot be recommended as an estimate of scale.

### Manual screening for outliers

[edit | edit source]

Traditionally, statisticians would manually screen data for outliers, and remove them, usually checking the source of the data to see if the outliers were erroneously recorded. Indeed, in the speed of light example above, it is easy to see and remove the two outliers prior to proceeding with any further analysis. However, in modern times, data sets often consist of large numbers of variables being measured on large numbers of experimental units. As such, manual screening for outliers is impractical.

Outliers can often interact in such a way that they mask each other. As a simple example, consider a small univariate data set containing one modest and one large outlier. The estimated standard deviation will be grossly inflated by the large outlier. The result is that the modest outlier looks relatively normal. As soon as the large outlier is removed, the estimated standard deviation shrinks, and the modest outlier now looks unusual.

This problem of masking gets worse as the complexity of the data increases. For example, in regression problems, diagnostic plots are used to identify outliers. However, it is common that once a few outliers have been removed, others become visible. The problem is even worse in higher dimensions.

Robust methods provide automatic ways of detecting, downweighting (or removing), and flagging outliers, largely removing the need for manual screening.

### Variety of applications

[edit | edit source]

Although this article deals with general principles for univariate statistical methods, robust methods also exist for regression problems, generalized linear models, and parameter estimation of various distributions.

## Measures of robustness

[edit | edit source]

The basic tools used to describe and measure robustness are, the breakdown point', the 'influence function and the sensitivity curve.

### Breakdown point

[edit | edit source]

Intuitively, the breakdown point of an estimator is the proportion of incorrect observations (i.e. arbitrarily large observations) an estimator can handle before giving an arbitrarily large result. For example, given <math>n</math> independent random variables <math>(X_1,\cdots,X_n)\sim\mathcal{N}(0,1)</math> and the corresponding realizations <math>x_1,\cdots,x_n</math>, we can use <math>\overline{X_n}:=\frac{X_1+\cdots+X_n}{n}</math> to estimate the mean. Such an estimator has a breakdown point of 0 because we can make <math>\overline{x}</math> arbitrarily large just by changing any of <math>x_1,\cdots,x_n</math>.

The higher the breakdown point of an estimator, the more robust it is. Intuitively, we can understand that a breakdown point cannot exceed 50% because if more than half of the observations are contaminated, it is not possible to distinguish between the underlying distribution and the contaminating distribution. Therefore, the maximum breakdown point is 0.5 and there are estimators which achieve such a breakdown point. For example, the median has a breakdown point of 0.5. The X% trimmed mean has breakdown point of X%, for the chosen level of X. Huber (1981) and Maronna et al (2006) contain more details.

#### Example: speed of light data

[edit | edit source]

In the speed of light example, removing the two lowest observations causes the mean to change from 26.2 to 27.75, a change of 1.55. The estimate of scale produced by the Qn method is 6.3. Intuitively, we can divide this by the square root of the sample size to get a robust standard error, and we find this quantity to be 0.78. Thus, the change in the mean resulting from removing two outliers is approximately twice the robust standard error.

The 10% trimmed mean for the speed of light data is 27.43. Removing the two lowest observations and recomputing gives 27.67. Clearly, the trimmed mean is less affected by the outliers and has a higher breakdown point.

Notice that if we replace the lowest observation, -44, by -1000, the mean becomes 11.73, whereas the 10% trimmed mean is still 27.43. In many areas of applied statistics, it is common for data to be log-transformed to make them near symmetrical. Very small values become large negative when log-transformed, and zeroes become negatively infinite. Therefore, this example is of practical interest.

### Empirical influence function

[edit | edit source]

The empirical influence function gives us an idea of how an estimator behaves when we change one point in the sample and relies on the data (i.e. no model assumptions). The following picture is Tukey's biweight function, which, as we will later see, is an example of what a "good" (in a sense defined later on) empirical influence function should look like:

File:Biweight.png

The context is the following:

1. <math>(\Omega,\mathcal{A},P)</math> is a probability space,
2. <math>(\mathcal{X},\Sigma)</math> is a measure space (state space),
3. <math>\Theta</math> is a parameter space of dimension <math>p\in\mathbb{N}^*</math>,
4. <math>(\Gamma,S)</math> is a measure space,
5. <math>\gamma:\Theta\rightarrow\Gamma</math> is a projection,
6. <math>\mathcal{F}(\Sigma)</math> is the set of all possible distributions on <math>\Sigma</math>

For example,

1. <math>(\Omega,\mathcal{A},P)</math> is any probability space,
2. <math>(\mathcal{X},\Sigma)=(\mathbb{R},\mathcal{B})</math>,
3. <math>\Theta=\mathbb{R}\times\mathbb{R}^+</math>
4. <math>(\Gamma,S)=(\mathbb{R},\mathcal{B})</math>,
5. <math>\gamma:\mathbb{R}\times\mathbb{R}^+\rightarrow\mathbb{R}</math> is defined by <math>\gamma(x,y)=x</math>.

The definition of an empirical influence function is: Let <math>n\in\mathbb{N}^*</math> and <math>X_1,\cdots,X_n:(\Omega, \mathcal{A})\rightarrow(\mathcal{X},\Sigma)</math> are iid and <math>(x_1,\cdots,x_n)</math> is a sample from these variables. <math>T_n:(\mathcal{X}^n,\Sigma^n)\rightarrow(\Gamma,S)</math> is an estimator. Let <math>i\in\\{1,\cdots,n\\}</math>. The empirical influence function <math>EIF_i</math> at observation <math>i</math> is defined by:

<math>EIF_i:x\in\mathcal{X}\mapsto T_n(x_1,\cdots,x_{i-1},x,x_{i+1},\cdots,x_n)\in\Gamma</math>

What this actually means is that we are replacing the i-th value in the sample by an arbitrary value and looking at the output of the estimator.

### Influence function and sensitivity curve

[edit | edit source]

Instead of relying solely on the data, we could use the distribution of the random variables. The approach is quite different from that of the previous paragraph. What we are now trying to do is to see what happens to an estimator when we change the distribution of the data slightly.

Let <math>A</math> be a convex subset of the set of all finite signed measures on <math>\mathcal{X}</math>. We want to estimate the parameter <math>\theta\in\Theta</math> of a distribution <math>F</math> in <math>A</math>. Let the functional <math>T:A\rightarrow\Gamma</math> be the asymptotic value of some estimator sequence <math>(T_n)_{n\in\mathbb{N}}</math>. We will suppose that this functional is Fisher consistent, i.e. <math>\forall \theta\in\Theta, T(F_\theta)=\theta</math>. this means that at the model <math>F</math>, the estimator sequence asymptotically measures the right quantity.

Let <math>G</math> be some distribution in <math>A</math>. What happens when the data doesn't follow the model <math>F</math> exactly but another, slightly different, "going towards" <math>G</math>?

We're looking at: <math>dF_{G-F}(F) = \lim_{t\rightarrow 0^+}\frac{T(tG+(1-t)F) - T(F)}{t}</math>,

which is the directional derivative of <math>T</math> at <math>F</math>, in the direction of <math>G</math>.

Let <math>x\in\mathcal{X}</math>. <math>\Delta_x</math> is the probability measure which gives mass 1 to <math>x</math>. We chose <math>G=\Delta_x</math>. The influence function is then defined by:

<math>IF(x; T; F):=\lim_{t\rightarrow 0^+}\frac{T(t\Delta_x+(1-t)F) - T(F)}{t}</math>

It describes the effect of an infinitesimal contamination at the point <math>x</math> on the estimate we are seeking, standardized by the mass <math>t</math> of the contamination (the asymptotic bias caused by contamination in the observations).

## Desirable properties

[edit | edit source]

Properties of an influence function which bestow it with desirable performance are:

1. Finite rejection point <math>\rho^*</math>,
2. Small gross-error sensitivity <math>\gamma^*</math>,
3. Small local-shift sensitivity <math>\lambda^*</math>.

### Rejection point

[edit | edit source]

<math>\rho^*:=\inf_{r>0}\\{r:IF(x;T;F)=0, |x|>r\\}</math>

### Gross-error sensitivity

[edit | edit source]

<math>\gamma^*(T;F) := \sup_{x\in\mathcal{X}}|IF(x; T ; F)|</math>

### Local-shift sensitivity

[edit | edit source]

<math>\lambda^*(T;F) := \sup_{(x,y)\in\mathcal{X}^2, x\neq y}\left\|\frac{IF(y ; T; F) - IF(x; T ; F)}{y-x}\right\|</math>

This value, which looks a lot like a Lipschitz constant, represents the effect of shifting an observation slightly from <math>x</math> to a neighbouring point <math>y</math>, i.e. add an observation at <math>y</math> and remove one at <math>x</math>.

## M-estimators

[edit | edit source]

Main article: M-estimator

(The mathematical context of this paragraph is given in the section on empirical influence functions.)

Historically, several approaches to robust estimation were proposed, including R-estimators and L-estimators. However, M-estimators now appear to dominate the field as a result of their generality, high breakdown point, and their efficiency. See Huber (1981).

M-estimators are a generalization of maximum likelihood estimators (MLEs). What we try to do with MLE's is to maximize <math>\prod_{i=1}^n f(x_i)</math> or, equivalently, minimize <math>\sum_{i=1}^n-\log f(x_i)</math>. In 1964, Huber proposed to generalize this to the minimization of <math>\sum_{i=1}^n \rho(x_i)</math>, where <math>\rho</math> is some function. MLE are therefore a special case of M-estimators (hence the name: "Maximum likelihood type" estimators).

Minimizing <math>\sum_{i=1}^n \rho(x_i)</math> can often be done by differentiating <math>\rho</math> and solving <math>\sum_{i=1}^n \psi(x_i) = 0</math>, where <math>\psi(x) = \frac{d\rho(x)}{dx}</math> if <math>\rho</math> has a derivative, that is.

Several choices of <math>\rho</math> and <math>\psi</math> have been proposed. The two figures below show four <math>\rho</math> functions and their corresponding <math>\psi</math> functions.

File:RhoFunctions.png

For squared errors, <math>\rho(x)</math> increases at an accelerating rate, whilst for absolute errors, it increases at a constant rate. When Windsorizing is used, a mixture of these two effects is introduced: for small values of x, <math>\rho</math> increases at the squared rate, but once the chosen threshold is reached (1.5 in this example), the rate of increase becomes constant.

Tukey's biweight (also known as bisquare) function behaves in a similar way to the squared error function at first, but for larger errors, the function tapers off.

File:PsiFunctions.png

### Properties of M-estimators

[edit | edit source]

Notice that M-estimators do not necessarily relate to a probability density function. As such, off-the-shelf approaches to inference that arise from likelihood theory can not, in general, be used.

It can be shown that M-estimators are asymptotically normally distributed, so that as long as their standard errors can be computed, an approximate approach to inference is available.

Since M-estimators are normal only asymptotically, for small sample sizes it might be appropriate to use an alternative approach to inference, such as the bootstrap. However, M-estimates are not necessarily unique (i.e. there might be more than one solution that satisfies the equations). Also, it is possible that any particular bootstrap sample can contain more outliers than the estimator's breakdown point. Therefore, some care is needed when designing bootstrap schemes.

Of course, as we saw with the speed of light example, the mean is only normally distributed asymptotically and when outliers are present the approximation can be very poor even for quite large samples. However, classical statistical tests, including those based on the mean, are typically bounded above by the nominal size of the test. The same is not true of M-estimators and the type I error rate can be substantially above the nominal level.

These considerations do not "invalidate" M-estimation in any way. They merely make clear that some care is needed in their use, as is true of any other method of estimation.

### Influence function of an M-estimator

[edit | edit source]

It can be shown that the influence function of an M-estimator <math>T</math> is proportional to <math>\psi</math> (see Huber, 1981 (and 2004), page 45), which means we can derive the properties of such an estimator (such as its rejection point, gross-error sensitivity or local-shift sensitivity) when we know its <math>\psi</math> function.

<math>IF(x;T,F) = M^{-1}\psi(x,T(F))</math> with the <math>p\times p</math> given by: <math>M = -\int_{\mathcal{X}}\left(\frac{\partial \psi(x,\theta)}{\partial \theta}\right)_{T(F)}dF(x)</math>.

### Choice of <math>\psi</math> and <math>\rho</math>

[edit | edit source]

In many practical situations, the choice of the <math>\psi</math> function is not critical to gaining a good robust estimate, and many choices will give similar results that offer great improvements, in terms of efficiency and bias, over classical estimates in the presence of outliers (Huber, 1981).

Theoretically, redescending <math>\psi</math> functions are to be preferred, and Tukey's biweight (also known as bisquare) function is a popular choice. Maronna et al (2006) recommend the biweight function with efficiency at the normal set to 85%.

## Robust parametric approaches

[edit | edit source]

M-estimators do not necessarily relate to a density function and so are not fully parametric. Fully parametric approaches to robust modelling and inference, both Bayesian and likelihood approaches, usually deal with heavy tailed distributions such as Student's t-distribution.

For the t-distribution with <math>\nu</math> degrees of freedom, it can be shown that

<math>\psi(x) = \frac{x}{x^2 + \nu}</math>.

For <math>\nu=1</math>, the t-distribution is equivalent to the Cauchy distribution. Notice that the degrees of freedom is sometimes known as the kurtosis parameter. It is the parameter that controls how heavy the tails are. In principle, <math>\nu</math> can be estimated from the data in the same way as any other parameter. In practice, it is common for there to be mulitple local maxima when <math>\nu</math> is allowed to vary. As such, it is common to fix <math>\nu</math> at a value around 4 or 6. The figure below displays the <math>\psi</math>-function for 4 different values of <math>\nu</math>.

File:TDistPsi.png

### Example: speed of light data

[edit | edit source]

For the speed of light data, allowing the kurtosis parameter to vary and maximizing the likelihood, we get

<math> \hat\mu = 27.40, \hat\sigma = 3.81, \hat\nu = 2.13.</math>

Fixing <math>\nu = 4</math> and maximizing the likelihood gives

<math>\hat\mu = 27.49, \hat\sigma = 4.51.</math>

## Key contributors

[edit | edit source]

Key contributors to the field of robust statistics include Frank Hampel, Peter J. Huber, Peter J. Rousseeuw, and John Tukey.

## References

[edit | edit source]

Robust Statistics - The Approach Based on Influence Functions, Frank R. Hampel, Elvezio M. Ronchetti, Peter J. Rousseeuw and Werner A. Stahel, Wiley, 1986 (republished in paperback, 2005)

Robust Statistics, Peter. J. Huber, Wiley, 1981 (republished in paperback, 2004)

Robust Regression and Outlier Detection, Peter J. Rousseeuw and Annick M. Leroy, Wiley, 1987 (republished in paperback, 2003)

Robust Statistics - Theory and Methods, Ricardo Maronna, Doug Martin and Victor Yohai, Wiley, 2006

Bayesian Data Analysis, Andrew Gelman, John B. Carlin, Hal S. Stern and Donald B. Rubin, Chapman & Hall/CRC, 2004

Alternatives to the Median Absolute Deviation, P. J. Rousseeuw and C. Croux, C., Journal of the American Statistical Association, 88, 1993

## See also

[edit | edit source]

* Winsorising
* Robust regression
* M-estimator

## External links

[edit | edit source]

* Brian Ripley's  robust statistics course notes.
* Nick Fieller's course notes on Statistical Modelling and Computation contain material on robust regression.
* David Olive's site contains course notes on robust statistics and some data sets.
* The R Project for statistical computing.
* The home of the S-PLUS statistical software package.
* Olfa Nasraoui's Overview of Robust Statistics.
* Why write statistical software? The case of robust statistical methods, A. J. Stromberg.

de:Robuste Statistik

Template:WS