# Estimator

__: Rule for calculating an estimate of a given quantity based on observed data__

**Short description**In statistics, an **estimator** is a rule for calculating an estimate of a given quantity based on observed data: thus the rule (the estimator), the quantity of interest (the estimand) and its result (the estimate) are distinguished.^{[1]} For example, the sample mean is a commonly used estimator of the population mean.

There are point and interval estimators. The point estimators yield single-valued results. This is in contrast to an interval estimator, where the result would be a range of plausible values. "Single value" does not necessarily mean "single number", but includes vector valued or function valued estimators.

*Estimation theory* is concerned with the properties of estimators; that is, with defining properties that can be used to compare different estimators (different rules for creating estimates) for the same quantity, based on the same data. Such properties can be used to determine the best rules to use under given circumstances. However, in robust statistics, statistical theory goes on to consider the balance between having good properties, if tightly defined assumptions hold, and having less good properties that hold under wider conditions.

## Background

An "estimator" or "point estimate" is a statistic (that is, a function of the data) that is used to infer the value of an unknown parameter in a statistical model. A common way of phrasing it is "the estimator is the method selected to obtain an estimate of an unknown parameter".
The parameter being estimated is sometimes called the *estimand*. It can be either finite-dimensional (in parametric and semi-parametric models), or infinite-dimensional (semi-parametric and non-parametric models).^{[2]} If the parameter is denoted [math]\displaystyle{ \theta }[/math] then the estimator is traditionally written by adding a circumflex over the symbol: [math]\displaystyle{ \widehat{\theta} }[/math]. Being a function of the data, the estimator is itself a random variable; a particular realization of this random variable is called the "estimate". Sometimes the words "estimator" and "estimate" are used interchangeably.

The definition places virtually no restrictions on which functions of the data can be called the "estimators". The attractiveness of different estimators can be judged by looking at their properties, such as unbiasedness, mean square error, consistency, asymptotic distribution, etc. The construction and comparison of estimators are the subjects of the estimation theory. In the context of decision theory, an estimator is a type of decision rule, and its performance may be evaluated through the use of loss functions.

When the word "estimator" is used without a qualifier, it usually refers to point estimation. The estimate in this case is a single point in the parameter space. There also exists another type of estimator: interval estimators, where the estimates are subsets of the parameter space.

The problem of density estimation arises in two applications. Firstly, in estimating the probability density functions of random variables and secondly in estimating the spectral density function of a time series. In these problems the estimates are functions that can be thought of as point estimates in an infinite dimensional space, and there are corresponding interval estimation problems.

## Definition

Suppose a fixed *parameter* [math]\displaystyle{ \theta }[/math] needs to be estimated. Then an "estimator" is a function that maps the sample space to a set of *sample estimates*. An estimator of [math]\displaystyle{ \theta }[/math] is usually denoted by the symbol [math]\displaystyle{ \widehat{\theta} }[/math]. It is often convenient to express the theory using the algebra of random variables: thus if *X* is used to denote a random variable corresponding to the observed data, the estimator (itself treated as a random variable) is symbolised as a function of that random variable, [math]\displaystyle{ \widehat{\theta}(X) }[/math]. The estimate for a particular observed data value [math]\displaystyle{ x }[/math] (i.e. for [math]\displaystyle{ X=x }[/math]) is then [math]\displaystyle{ \widehat{\theta}(x) }[/math], which is a fixed value. Often an abbreviated notation is used in which [math]\displaystyle{ \widehat{\theta} }[/math] is interpreted directly as a random variable, but this can cause confusion.

## Quantified properties

The following definitions and attributes are relevant.^{[3]}

### Error

For a given sample [math]\displaystyle{ x }[/math], the "error" of the estimator [math]\displaystyle{ \widehat{\theta} }[/math] is defined as

- [math]\displaystyle{ e(x)=\widehat{\theta}(x) - \theta, }[/math]

where [math]\displaystyle{ \theta }[/math] is the parameter being estimated. The error, *e*, depends not only on the estimator (the estimation formula or procedure), but also on the sample.

### Mean squared error

The mean squared error of [math]\displaystyle{ \widehat{\theta} }[/math] is defined as the expected value (probability-weighted average, over all samples) of the squared errors; that is,

- [math]\displaystyle{ \operatorname{MSE}(\widehat{\theta}) = \operatorname{E}[(\widehat{\theta}(X) - \theta)^2]. }[/math]

It is used to indicate how far, on average, the collection of estimates are from the single parameter being estimated. Consider the following analogy. Suppose the parameter is the bull's-eye of a target, the estimator is the process of shooting arrows at the target, and the individual arrows are estimates (samples). Then high MSE means the average distance of the arrows from the bull's eye is high, and low MSE means the average distance from the bull's eye is low. The arrows may or may not be clustered. For example, even if all arrows hit the same point, yet grossly miss the target, the MSE is still relatively large. However, if the MSE is relatively low then the arrows are likely more highly clustered (than highly dispersed) around the target.

### Sampling deviation

For a given sample [math]\displaystyle{ x }[/math], the *sampling deviation* of the estimator [math]\displaystyle{ \widehat{\theta} }[/math] is defined as

- [math]\displaystyle{ d(x) =\widehat{\theta}(x) - \operatorname{E}( \widehat{\theta}(X) ) =\widehat{\theta}(x) - \operatorname{E}( \widehat{\theta} ), }[/math]

where [math]\displaystyle{ \operatorname{E}( \widehat{\theta}(X) ) }[/math] is the expected value of the estimator. The sampling deviation, *d*, depends not only on the estimator, but also on the sample.

### Variance

The variance of [math]\displaystyle{ \widehat{\theta} }[/math] is the expected value of the squared sampling deviations; that is, [math]\displaystyle{ \operatorname{Var}(\widehat{\theta}) = \operatorname{E}[(\widehat{\theta} - \operatorname{E}[\widehat{\theta}]) ^2] }[/math]. It is used to indicate how far, on average, the collection of estimates are from the *expected value* of the estimates. (Note the difference between MSE and variance.) If the parameter is the bull's-eye of a target, and the arrows are estimates, then a relatively high variance means the arrows are dispersed, and a relatively low variance means the arrows are clustered. Even if the variance is low, the cluster of arrows may still be far off-target, and even if the variance is high, the diffuse collection of arrows may still be unbiased. Finally, even if all arrows grossly miss the target, if they nevertheless all hit the same point, the variance is zero.

### Bias

The bias of [math]\displaystyle{ \widehat{\theta} }[/math] is defined as [math]\displaystyle{ B(\widehat{\theta}) = \operatorname{E}(\widehat{\theta}) - \theta }[/math]. It is the distance between the average of the collection of estimates, and the single parameter being estimated. The bias of [math]\displaystyle{ \widehat{\theta} }[/math] is a function of the true value of [math]\displaystyle{ \theta }[/math] so saying that the bias of [math]\displaystyle{ \widehat{\theta} }[/math] is [math]\displaystyle{ b }[/math] means that for every [math]\displaystyle{ \theta }[/math] the bias of [math]\displaystyle{ \widehat{\theta} }[/math] is [math]\displaystyle{ b }[/math].

There are two kinds of estimators: biased estimators and unbiased estimators. Whether an estimator is biased or not can be identified by the relationship between [math]\displaystyle{ \operatorname{E}(\widehat{\theta}) - \theta }[/math] and 0:

- If [math]\displaystyle{ \operatorname{E}(\widehat{\theta}) - \theta\neq0 }[/math], [math]\displaystyle{ \widehat{\theta} }[/math] is biased.
- If [math]\displaystyle{ \operatorname{E}(\widehat{\theta}) - \theta=0 }[/math], [math]\displaystyle{ \widehat{\theta} }[/math] is unbiased.

The bias is also the expected value of the error, since [math]\displaystyle{ \operatorname{E}(\widehat{\theta}) - \theta = \operatorname{E}(\widehat{\theta} - \theta ) }[/math]. If the parameter is the bull's eye of a target and the arrows are estimates, then a relatively high absolute value for the bias means the average position of the arrows is off-target, and a relatively low absolute bias means the average position of the arrows is on target. They may be dispersed, or may be clustered. The relationship between bias and variance is analogous to the relationship between accuracy and precision.

The estimator [math]\displaystyle{ \widehat{\theta} }[/math] is an unbiased estimator of [math]\displaystyle{ \theta }[/math] if and only if [math]\displaystyle{ B(\widehat{\theta}) = 0 }[/math]. Bias is a property of the estimator, not of the estimate. Often, people refer to a "biased estimate" or an "unbiased estimate", but they really are talking about an "estimate from a biased estimator", or an "estimate from an unbiased estimator". Also, people often confuse the "error" of a single estimate with the "bias" of an estimator. That the error for one estimate is large, does not mean the estimator is biased. In fact, even if all estimates have astronomical absolute values for their errors, if the expected value of the error is zero, the estimator is unbiased. Also, an estimator's being biased does not preclude the error of an estimate from being zero in a particular instance. The ideal situation is to have an unbiased estimator with low variance, and also try to limit the number of samples where the error is extreme (that is, have few outliers). Yet unbiasedness is not essential. Often, if just a little bias is permitted, then an estimator can be found with lower mean squared error and/or fewer outlier sample estimates.

An alternative to the version of "unbiased" above, is "median-unbiased", where the median of the distribution of estimates agrees with the true value; thus, in the long run half the estimates will be too low and half too high. While this applies immediately only to scalar-valued estimators, it can be extended to any measure of central tendency of a distribution: see median-unbiased estimators.

In a practical problem, [math]\displaystyle{ \widehat{\theta} }[/math] can always have functional relationship with [math]\displaystyle{ \theta }[/math]. For example, A genetic theory states there is a type of leave, starchy green, occur with probability [math]\displaystyle{ p_1=1/4\cdot(\theta + 2) }[/math], with [math]\displaystyle{ 0\lt \theta\lt 1 }[/math]. For [math]\displaystyle{ n }[/math] leaves, the random variable [math]\displaystyle{ N_1 }[/math], the number of starchy green leaves, can be modeled with a [math]\displaystyle{ Bin(n,p_1) }[/math] distribution. The number can be used to express the following estimator for [math]\displaystyle{ \theta }[/math]: [math]\displaystyle{ \widehat{\theta}=4/n\cdot N_1-2 }[/math]. One can show that [math]\displaystyle{ \widehat{\theta} }[/math] is an unbiased estimator for [math]\displaystyle{ \theta }[/math]: [math]\displaystyle{ E[\widehat{\theta}]=E[4/n\cdot N_1-2] }[/math] [math]\displaystyle{ =4/n\cdot E[N_1]-2 }[/math] [math]\displaystyle{ =4/n\cdot np_1-2 }[/math] [math]\displaystyle{ =4\cdot p_1-2 }[/math] [math]\displaystyle{ =4\cdot1/4\cdot(\theta+2)-2 }[/math] [math]\displaystyle{ =\theta+2-2 }[/math] [math]\displaystyle{ =\theta }[/math].

### Unbiased

A desired property for estimators is the unbiased trait where an estimator is shown to have no systematic tendency to produce estimates larger or smaller than the provided probability. Additionally, unbiased estimators with smaller variances are preferred over larger variances because it will be closer to the "true" value of the parameter. The unbiased estimator with the smallest variance is known as the Minimum-variance unbiased estimator(MVUE).

To find if your estimator is unbiased it is easy to follow along the equation [math]\displaystyle{ \operatorname{E}(\widehat{\theta}) - \theta=0 }[/math], [math]\displaystyle{ \widehat{\theta} }[/math]. With estimator *T* with and parameter of interest [math]\displaystyle{ \theta }[/math] solving the previous equation so it is shown as [math]\displaystyle{ E[T] = \theta }[/math] the estimator is unbiased. Looking at the figure to the right despite [math]\displaystyle{ \theta_2 }[/math] being the only unbiased estimator. If the distributions overlapped and were both centered around [math]\displaystyle{ \theta }[/math] then distribution [math]\displaystyle{ \theta_1 }[/math] would actually be the preferred unbiased estimator.

**Expectation**
When looking at quantities in the interest of expectation for the model distribution there is an unbiased estimator which should satisfy the two equations below.

- [math]\displaystyle{ 1. X_n = \tfrac{X_1 + X_2+ ... + X_n}{n} }[/math]
- [math]\displaystyle{ 2. E[\bar{X}_n] = \mu }[/math]

**Variance**
Similarly, when looking at quantities in the interest of variance as the model distribution there is also an unbiased estimator that should satisfy the two equations below.

- [math]\displaystyle{ 1. S^2_n = \tfrac{1}{n-1}\sum_{i = 1}^n (X_i - X_n)^2 }[/math]
- [math]\displaystyle{ 2. E[S^2_n] = \sigma^2 }[/math]

Note we are dividing by *n* - 1 because if we divided with *n* we would obtain an estimator with a negative bias which would thus produce estimates that are too small for [math]\displaystyle{ \sigma^2 }[/math]. It should also be mentioned that even though [math]\displaystyle{ S^2_n }[/math] is unbiased for [math]\displaystyle{ \sigma^2 }[/math] the reverse is not true.^{[4]}

### Relationships among the quantities

- The mean squared error, variance, and bias, are related: [math]\displaystyle{ \operatorname{MSE}(\widehat{\theta}) = \operatorname{Var}(\widehat\theta) + (B(\widehat{\theta}))^2, }[/math] i.e. mean squared error = variance + square of bias. In particular, for an unbiased estimator, the variance equals the mean squared error.
- The standard deviation of an estimator [math]\displaystyle{ \widehat{\theta} }[/math] of [math]\displaystyle{ \theta }[/math] (the square root of the variance), or an estimate of the standard deviation of an estimator [math]\displaystyle{ \widehat{\theta} }[/math] of [math]\displaystyle{ \theta }[/math], is called the
*standard error*of [math]\displaystyle{ \widehat{\theta} }[/math]. - The bias-variance tradeoff will be used in model complexity, over-fitting and under-fitting. It is mainly used in the field of supervised learning and predictive modeling to diagnose the performance of algorithms.

## Sampling Distribution

The sampling distribution can be shown by the estimator [math]\displaystyle{ S = h(X_1,X_2,...,X_n) }[/math]. represented by the random sample :[math]\displaystyle{ X_1,X_2,...,X_n }[/math]. The sampling distribution is equivalent to the probability distribution of the estimator S which can also be represented by the equation:

- [math]\displaystyle{ S = \tfrac{Y}{n} }[/math].

where Y is the number of [math]\displaystyle{ X_i }[/math] equal to zero and *n* is the number of trials.
To understand why the expectation value is dependent on the probability ([math]\displaystyle{ p_0 }[/math]) we need to understand the distribution. For example, in the sampling distribution for each *i* in the random dataset X it can be considered a success when X = 0. This makes Y is equal to the success of X = 0 in *n* trials. With the concept of Y either being a success or not it can be thought of as a binomial distribution with constant probability [math]\displaystyle{ p_0 }[/math]. Therefore, the sampling distribution S can be seen as the distribution [math]\displaystyle{ Bin(n,p_0) }[/math] making S a discrete random variable.
As a result, the expectation for the sampling distribution can be thought of as

- [math]\displaystyle{ E[S] = \tfrac{E[Y]}{n} = \tfrac{np_0}{n} = p_0 }[/math].

proving that the property holds regardless of what the value of [math]\displaystyle{ p_0 }[/math] is. This shows that despite [math]\displaystyle{ p_0 }[/math] values fluctuating between samples estimators can be on target regardless of the differences.^{[4]}

## Behavioral properties

### Consistency

A consistent sequence of estimators is a sequence of estimators that converge in probability to the quantity being estimated as the index (usually the sample size) grows without bound. In other words, increasing the sample size increases the probability of the estimator being close to the population parameter.

Mathematically, a sequence of estimators {*t _{n}*;

*n*≥ 0} is a consistent estimator for parameter

*θ*if and only if, for all

*ε*> 0, no matter how small, we have

- [math]\displaystyle{ \lim_{n\to\infty}\Pr\left\{ \left| t_n-\theta\right|\lt \varepsilon \right\}=1 }[/math].

The consistency defined above may be called weak consistency. The sequence is *strongly consistent*, if it converges almost surely to the true value.

An estimator that converges to a *multiple* of a parameter can be made into a consistent estimator by multiplying the estimator by a scale factor, namely the true value divided by the asymptotic value of the estimator. This occurs frequently in estimation of scale parameters by measures of statistical dispersion.

### Fisher Consistency

An estimator can be considered Fisher Consistent as long as the estimator is the same functional of the empirical distribution function as the true distribution function. Following the formula:

- [math]\displaystyle{ \widehat{\theta} = h(T_n), \theta = h(T_\theta) }[/math]

Where [math]\displaystyle{ T_n }[/math] and [math]\displaystyle{ T_\theta }[/math] is the empirical distribution function and theoretical distribution functions respectively.
An easy example to see if something is fisher consistent is to check the mean consistency and the variance. For example, to check consistency for the mean [math]\displaystyle{ \widehat{\mu} = \bar{X} }[/math] and to check for variance confirm that [math]\displaystyle{ \widehat{\sigma}^2 = SSD/n }[/math].^{[5]}

### Asymptotic normality

An asymptotically normal estimator is a consistent estimator whose distribution around the true parameter *θ* approaches a normal distribution with standard deviation shrinking in proportion to [math]\displaystyle{ 1/\sqrt{n} }[/math] as the sample size *n* grows. Using [math]\displaystyle{ \xrightarrow{D} }[/math] to denote convergence in distribution, *t _{n}* is asymptotically normal if

- [math]\displaystyle{ \sqrt{n}(t_n - \theta) \xrightarrow{D} N(0,V), }[/math]

for some *V*.

In this formulation *V/n* can be called the *asymptotic variance* of the estimator. However, some authors also call *V* the *asymptotic variance*.
Note that convergence will not necessarily have occurred for any finite "n", therefore this value is only an approximation to the true variance of the estimator, while in the limit the asymptotic variance (V/n) is simply zero. To be more specific, the distribution of the estimator *t _{n}* converges weakly to a dirac delta function centered at [math]\displaystyle{ \theta }[/math].

The central limit theorem implies asymptotic normality of the sample mean [math]\displaystyle{ \bar X }[/math] as an estimator of the true mean. More generally, maximum likelihood estimators are asymptotically normal under fairly weak regularity conditions — see the asymptotics section of the maximum likelihood article. However, not all estimators are asymptotically normal; the simplest examples are found when the true value of a parameter lies on the boundary of the allowable parameter region.

### Efficiency

The efficiency of an estimator is used to estimate the quantity of interest in a "minimum error" manner. In reality, there is not an explicit best estimator; there can only be a better estimator. The good or not of the efficiency of an estimator is based on the choice of a particular loss function, and it is reflected by two naturally desirable properties of estimators: to be unbiased [math]\displaystyle{ \operatorname{E}(\widehat{\theta}) - \theta=0 }[/math] and have minimal mean squared error (MSE) [math]\displaystyle{ \operatorname{E}[(\widehat{\theta} - \theta )^2] }[/math]. These cannot in general both be satisfied simultaneously: an unbiased estimator may have a lower mean squared error than any biased estimator (see estimator bias).
A function relates the mean squared error with the estimator bias.^{[6]}

[math]\displaystyle{ \operatorname{E}[(\widehat{\theta} - \theta )^2]=(\operatorname{E}(\widehat{\theta}) - \theta)^2+\operatorname{Var}(\theta)\ }[/math]

The first term represents the mean squared error; the second term represents the square of the estimator bias; and the third term represents the variance of the sample. The quality of the estimator can be identified from the comparison between the variance, the square of the estimator bias, or the MSE. The variance of the good estimator (good efficiency) would be smaller than the variance of the bad estimator (bad efficiency). The square of a estimator bias with a good estimator would be smaller than the estimator bias with a bad estimator. The MSE of a good estimator would be smaller than the MSE of the bad estimator. Suppose there are two estimator, [math]\displaystyle{ \theta_1 }[/math] is the good estimator and [math]\displaystyle{ \theta_2 }[/math] is the bad estimator. The above relationship can be expressed by the following formulas.

[math]\displaystyle{ \operatorname{Var}(\theta_1)\lt \operatorname{Var}(\theta_2) }[/math]

[math]\displaystyle{ |\operatorname{E}({\theta}_1) - \theta|\lt |\operatorname{E}({\theta_2}) - \theta| }[/math]

[math]\displaystyle{ \operatorname{MSE}(\theta_1)\lt \operatorname{MSE}(\theta_2) }[/math]

Besides using formula to identify the efficiency of the estimator, it can also be identified through the graph. If an estimator is efficient, in the frequency vs. value graph, there will be a curve with high frequency at the center and low frequency on the two sides. For example:

If an estimator is not efficient, the frequency vs. value graph, there will be a relatively more gentle curve.

To put it simply, the good estimator has a narrow curve, while the bad estimator has a large curve. Plotting these two curves on one graph with a shared y-axis, the difference becomes more obvious.

Among unbiased estimators, there often exists one with the lowest variance, called the minimum variance unbiased estimator (MVUE). In some cases an unbiased efficient estimator exists, which, in addition to having the lowest variance among unbiased estimators, satisfies the Cramér–Rao bound, which is an absolute lower bound on variance for statistics of a variable.

Concerning such "best unbiased estimators", see also Cramér–Rao bound, Gauss–Markov theorem, Lehmann–Scheffé theorem, Rao–Blackwell theorem.

### Robustness

## See also

- Best linear unbiased estimator (BLUE)
- Invariant estimator
- Kalman filter
- Markov chain Monte Carlo (MCMC)
- Maximum a posteriori (MAP)
- Method of moments, generalized method of moments
- Minimum mean squared error (MMSE)
- Particle filter
- Pitman closeness criterion
- Sensitivity and specificity
- Shrinkage estimator
- Signal processing
- Testimator
- Wiener filter
- Well-behaved statistic

## References

- ↑ Mosteller, F.; Tukey, J. W. (1987). "Data Analysis, including Statistics".
*The Collected Works of John W. Tukey: Philosophy and Principles of Data Analysis 1965–1986*.**4**. CRC Press. pp. 601–720 [p. 633]. ISBN 0-534-05101-4. https://books.google.com/books?id=C1guHWTlVVoC&pg=PA633. - ↑ Kosorok (2008), Section 3.1, pp 35–39.
- ↑ Jaynes (2007), p.172.
- ↑
^{4.0}^{4.1}Dekking, Frederik (15 June 2005).*A Modern Introduction to Probability and Statistics*. Springer. pp. 285–293. ISBN 978-1-85233-896-1. - ↑ Lauritzen, Steffen. "Properties of Estimators". University of Oxford. https://www.stats.ox.ac.uk/~steffen/teaching/bs2siMT04/si2c.pdf.
- ↑ Dekking, Frederik Michel; Kraaikamp, Cornelis; Lopuhaä, Hendrik Paul; Meester, Ludolf Erwin (2005). "A Modern Introduction to Probability and Statistics" (in en-gb).
*Springer Texts in Statistics*. doi:10.1007/1-84628-168-7. ISBN 978-1-85233-896-1. ISSN 1431-875X. https://doi.org/10.1007/1-84628-168-7.

## Further reading

- Hazewinkel, Michiel, ed. (2001), "Statistical estimator",
*Encyclopedia of Mathematics*, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=Main_Page. - Jaynes, E. T. (2007).
*Probability Theory: The logic of science*(5 ed.).*Cambridge University Press*. ISBN 978-0-521-59271-0.. - Kosorok, Michael (2008).
*Introduction to Empirical Processes and Semiparametric Inference*. Springer Series in Statistics. Springer. doi:10.1007/978-0-387-74978-5. ISBN 978-0-387-74978-5. https://www.springer.com/mathematics/probability/book/978-0-387-74977-8. - {{Cite book
- Shao, Jun (1998),
*Mathematical Statistics*, Springer, ISBN 0-387-98674-X

## External links

Original source: https://en.wikipedia.org/wiki/Estimator.
Read more |