- Source: Bias of an estimator
In statistics, the bias of an estimator (or bias function) is the difference between this estimator's expected value and the true value of the parameter being estimated. An estimator or decision rule with zero bias is called unbiased. In statistics, "bias" is an objective property of an estimator. Bias is a distinct concept from consistency: consistent estimators converge in probability to the true value of the parameter, but may be biased or unbiased (see bias versus consistency for more).
All else being equal, an unbiased estimator is preferable to a biased estimator, although in practice, biased estimators (with generally small bias) are frequently used. When a biased estimator is used, bounds of the bias are calculated. A biased estimator may be used for various reasons: because an unbiased estimator does not exist without further assumptions about a population; because an estimator is difficult to compute (as in unbiased estimation of standard deviation); because a biased estimator may be unbiased with respect to different measures of central tendency; because a biased estimator gives a lower value of some loss function (particularly mean squared error) compared with unbiased estimators (notably in shrinkage estimators); or because in some cases being unbiased is too strong a condition, and the only unbiased estimators are not useful.
Bias can also be measured with respect to the median, rather than the mean (expected value), in which case one distinguishes median-unbiased from the usual mean-unbiasedness property.
Mean-unbiasedness is not preserved under non-linear transformations, though median-unbiasedness is (see § Effect of transformations); for example, the sample variance is a biased estimator for the population variance. These are all illustrated below.
An unbiased estimator for a parameter need not always exist. For example, there is no unbiased estimator for the reciprocal of the parameter of a binomial random variable.
Definition
Suppose we have a statistical model, parameterized by a real number θ, giving rise to a probability distribution for observed data,
P
θ
(
x
)
=
P
(
x
∣
θ
)
{\displaystyle P_{\theta }(x)=P(x\mid \theta )}
, and a statistic
θ
^
{\displaystyle {\hat {\theta }}}
which serves as an estimator of θ based on any observed data
x
{\displaystyle x}
. That is, we assume that our data follows some unknown distribution
P
(
x
∣
θ
)
{\displaystyle P(x\mid \theta )}
(where θ is a fixed, unknown constant that is part of this distribution), and then we construct some estimator
θ
^
{\displaystyle {\hat {\theta }}}
that maps observed data to values that we hope are close to θ. The bias of
θ
^
{\displaystyle {\hat {\theta }}}
relative to
θ
{\displaystyle \theta }
is defined as
Bias
(
θ
^
,
θ
)
=
Bias
θ
[
θ
^
]
=
E
x
∣
θ
[
θ
^
]
−
θ
=
E
x
∣
θ
[
θ
^
−
θ
]
,
{\displaystyle \operatorname {Bias} ({\hat {\theta }},\theta )=\operatorname {Bias} _{\theta }[\,{\hat {\theta }}\,]=\operatorname {E} _{x\mid \theta }[\,{\hat {\theta }}\,]-\theta =\operatorname {E} _{x\mid \theta }[\,{\hat {\theta }}-\theta \,],}
where
E
x
∣
θ
{\displaystyle \operatorname {E} _{x\mid \theta }}
denotes expected value over the distribution
P
(
x
∣
θ
)
{\displaystyle P(x\mid \theta )}
(i.e., averaging over all possible observations
x
{\displaystyle x}
). The second equation follows since θ is measurable with respect to the conditional distribution
P
(
x
∣
θ
)
{\displaystyle P(x\mid \theta )}
.
An estimator is said to be unbiased if its bias is equal to zero for all values of parameter θ, or equivalently, if the expected value of the estimator matches that of the parameter. Unbiasedness is not guaranteed to carry over. For example, if
θ
^
{\displaystyle {\hat {\theta }}}
is an unbiased estimator for parameter θ, it is not guaranteed that g(
θ
^
{\displaystyle {\hat {\theta }}}
) is an unbiased estimator for g(θ).
In a simulation experiment concerning the properties of an estimator, the bias of the estimator may be assessed using the mean signed difference.
Examples
= Sample variance
=The sample variance of a random variable demonstrates two aspects of estimator bias: firstly, the naive estimator is biased, which can be corrected by a scale factor; second, the unbiased estimator is not optimal in terms of mean squared error (MSE), which can be minimized by using a different scale factor, resulting in a biased estimator with lower MSE than the unbiased estimator. Concretely, the naive estimator sums the squared deviations and divides by n, which is biased. Dividing instead by n − 1 yields an unbiased estimator. Conversely, MSE can be minimized by dividing by a different number (depending on distribution), but this results in a biased estimator. This number is always larger than n − 1, so this is known as a shrinkage estimator, as it "shrinks" the unbiased estimator towards zero; for the normal distribution the optimal value is n + 1.
Suppose X1, ..., Xn are independent and identically distributed (i.i.d.) random variables with expectation μ and variance σ2. If the sample mean and uncorrected sample variance are defined as
X
¯
=
1
n
∑
i
=
1
n
X
i
S
2
=
1
n
∑
i
=
1
n
(
X
i
−
X
¯
)
2
{\displaystyle {\overline {X}}\,={\frac {1}{n}}\sum _{i=1}^{n}X_{i}\qquad S^{2}={\frac {1}{n}}\sum _{i=1}^{n}{\big (}X_{i}-{\overline {X}}\,{\big )}^{2}\qquad }
then S2 is a biased estimator of σ2, because
E
[
S
2
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
X
¯
)
2
]
=
E
[
1
n
∑
i
=
1
n
(
(
X
i
−
μ
)
−
(
X
¯
−
μ
)
)
2
]
=
E
[
1
n
∑
i
=
1
n
(
(
X
i
−
μ
)
2
−
2
(
X
¯
−
μ
)
(
X
i
−
μ
)
+
(
X
¯
−
μ
)
2
)
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
−
2
n
(
X
¯
−
μ
)
∑
i
=
1
n
(
X
i
−
μ
)
+
1
n
(
X
¯
−
μ
)
2
∑
i
=
1
n
1
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
−
2
n
(
X
¯
−
μ
)
∑
i
=
1
n
(
X
i
−
μ
)
+
1
n
(
X
¯
−
μ
)
2
⋅
n
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
−
2
n
(
X
¯
−
μ
)
∑
i
=
1
n
(
X
i
−
μ
)
+
(
X
¯
−
μ
)
2
]
{\displaystyle {\begin{aligned}\operatorname {E} [S^{2}]&=\operatorname {E} \left[{\frac {1}{n}}\sum _{i=1}^{n}{\big (}X_{i}-{\overline {X}}{\big )}^{2}\right]=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}{\bigg (}(X_{i}-\mu )-({\overline {X}}-\mu ){\bigg )}^{2}{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}{\bigg (}(X_{i}-\mu )^{2}-2({\overline {X}}-\mu )(X_{i}-\mu )+({\overline {X}}-\mu )^{2}{\bigg )}{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}-{\frac {2}{n}}({\overline {X}}-\mu )\sum _{i=1}^{n}(X_{i}-\mu )+{\frac {1}{n}}({\overline {X}}-\mu )^{2}\sum _{i=1}^{n}1{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}-{\frac {2}{n}}({\overline {X}}-\mu )\sum _{i=1}^{n}(X_{i}-\mu )+{\frac {1}{n}}({\overline {X}}-\mu )^{2}\cdot n{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}-{\frac {2}{n}}({\overline {X}}-\mu )\sum _{i=1}^{n}(X_{i}-\mu )+({\overline {X}}-\mu )^{2}{\bigg ]}\\[8pt]\end{aligned}}}
To continue, we note that by subtracting
μ
{\displaystyle \mu }
from both sides of
X
¯
=
1
n
∑
i
=
1
n
X
i
{\displaystyle {\overline {X}}={\frac {1}{n}}\sum _{i=1}^{n}X_{i}}
, we get
X
¯
−
μ
=
1
n
∑
i
=
1
n
X
i
−
μ
=
1
n
∑
i
=
1
n
X
i
−
1
n
∑
i
=
1
n
μ
=
1
n
∑
i
=
1
n
(
X
i
−
μ
)
.
{\displaystyle {\begin{aligned}{\overline {X}}-\mu ={\frac {1}{n}}\sum _{i=1}^{n}X_{i}-\mu ={\frac {1}{n}}\sum _{i=1}^{n}X_{i}-{\frac {1}{n}}\sum _{i=1}^{n}\mu \ ={\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu ).\\[8pt]\end{aligned}}}
Meaning, (by cross-multiplication)
n
⋅
(
X
¯
−
μ
)
=
∑
i
=
1
n
(
X
i
−
μ
)
{\displaystyle n\cdot ({\overline {X}}-\mu )=\sum _{i=1}^{n}(X_{i}-\mu )}
. Then, the previous becomes:
E
[
S
2
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
−
2
n
(
X
¯
−
μ
)
∑
i
=
1
n
(
X
i
−
μ
)
+
(
X
¯
−
μ
)
2
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
−
2
n
(
X
¯
−
μ
)
⋅
n
⋅
(
X
¯
−
μ
)
+
(
X
¯
−
μ
)
2
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
−
2
(
X
¯
−
μ
)
2
+
(
X
¯
−
μ
)
2
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
−
(
X
¯
−
μ
)
2
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
]
−
E
[
(
X
¯
−
μ
)
2
]
=
σ
2
−
E
[
(
X
¯
−
μ
)
2
]
=
(
1
−
1
n
)
σ
2
<
σ
2
.
{\displaystyle {\begin{aligned}\operatorname {E} [S^{2}]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}-{\frac {2}{n}}({\overline {X}}-\mu )\sum _{i=1}^{n}(X_{i}-\mu )+({\overline {X}}-\mu )^{2}{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}-{\frac {2}{n}}({\overline {X}}-\mu )\cdot n\cdot ({\overline {X}}-\mu )+({\overline {X}}-\mu )^{2}{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}-2({\overline {X}}-\mu )^{2}+({\overline {X}}-\mu )^{2}{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}-({\overline {X}}-\mu )^{2}{\bigg ]}\\[8pt]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}{\bigg ]}-\operatorname {E} {\bigg [}({\overline {X}}-\mu )^{2}{\bigg ]}\\[8pt]&=\sigma ^{2}-\operatorname {E} {\bigg [}({\overline {X}}-\mu )^{2}{\bigg ]}=\left(1-{\frac {1}{n}}\right)\sigma ^{2}<\sigma ^{2}.\end{aligned}}}
This can be seen by noting the following formula, which follows from the Bienaymé formula, for the term in the inequality for the expectation of the uncorrected sample variance above:
E
[
(
X
¯
−
μ
)
2
]
=
1
n
σ
2
{\displaystyle \operatorname {E} {\big [}({\overline {X}}-\mu )^{2}{\big ]}={\frac {1}{n}}\sigma ^{2}}
.
In other words, the expected value of the uncorrected sample variance does not equal the population variance σ2, unless multiplied by a normalization factor. The sample mean, on the other hand, is an unbiased estimator of the population mean μ.
Note that the usual definition of sample variance is
S
2
=
1
n
−
1
∑
i
=
1
n
(
X
i
−
X
¯
)
2
{\displaystyle S^{2}={\frac {1}{n-1}}\sum _{i=1}^{n}(X_{i}-{\overline {X}}\,)^{2}}
, and this is an unbiased estimator of the population variance.
Algebraically speaking,
E
[
S
2
]
{\displaystyle \operatorname {E} [S^{2}]}
is unbiased because:
E
[
S
2
]
=
E
[
1
n
−
1
∑
i
=
1
n
(
X
i
−
X
¯
)
2
]
=
n
n
−
1
E
[
1
n
∑
i
=
1
n
(
X
i
−
X
¯
)
2
]
=
n
n
−
1
(
1
−
1
n
)
σ
2
=
σ
2
,
{\displaystyle {\begin{aligned}\operatorname {E} [S^{2}]&=\operatorname {E} \left[{\frac {1}{n-1}}\sum _{i=1}^{n}{\big (}X_{i}-{\overline {X}}{\big )}^{2}\right]={\frac {n}{n-1}}\operatorname {E} \left[{\frac {1}{n}}\sum _{i=1}^{n}{\big (}X_{i}-{\overline {X}}{\big )}^{2}\right]\\[8pt]&={\frac {n}{n-1}}\left(1-{\frac {1}{n}}\right)\sigma ^{2}=\sigma ^{2},\\[8pt]\end{aligned}}}
where the transition to the second line uses the result derived above for the biased estimator. Thus
E
[
S
2
]
=
σ
2
{\displaystyle \operatorname {E} [S^{2}]=\sigma ^{2}}
, and therefore
S
2
=
1
n
−
1
∑
i
=
1
n
(
X
i
−
X
¯
)
2
{\displaystyle S^{2}={\frac {1}{n-1}}\sum _{i=1}^{n}(X_{i}-{\overline {X}}\,)^{2}}
is an unbiased estimator of the population variance, σ2. The ratio between the biased (uncorrected) and unbiased estimates of the variance is known as Bessel's correction.
The reason that an uncorrected sample variance, S2, is biased stems from the fact that the sample mean is an ordinary least squares (OLS) estimator for μ:
X
¯
{\displaystyle {\overline {X}}}
is the number that makes the sum
∑
i
=
1
n
(
X
i
−
X
¯
)
2
{\displaystyle \sum _{i=1}^{n}(X_{i}-{\overline {X}})^{2}}
as small as possible. That is, when any other number is plugged into this sum, the sum can only increase. In particular, the choice
μ
≠
X
¯
{\displaystyle \mu \neq {\overline {X}}}
gives,
1
n
∑
i
=
1
n
(
X
i
−
X
¯
)
2
<
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
,
{\displaystyle {\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-{\overline {X}})^{2}<{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2},}
and then
E
[
S
2
]
=
E
[
1
n
∑
i
=
1
n
(
X
i
−
X
¯
)
2
]
<
E
[
1
n
∑
i
=
1
n
(
X
i
−
μ
)
2
]
=
σ
2
.
{\displaystyle {\begin{aligned}\operatorname {E} [S^{2}]&=\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-{\overline {X}})^{2}{\bigg ]}<\operatorname {E} {\bigg [}{\frac {1}{n}}\sum _{i=1}^{n}(X_{i}-\mu )^{2}{\bigg ]}=\sigma ^{2}.\end{aligned}}}
The above discussion can be understood in geometric terms: the vector
C
→
=
(
X
1
−
μ
,
…
,
X
n
−
μ
)
{\displaystyle {\vec {C}}=(X_{1}-\mu ,\ldots ,X_{n}-\mu )}
can be decomposed into the "mean part" and "variance part" by projecting to the direction of
u
→
=
(
1
,
…
,
1
)
{\displaystyle {\vec {u}}=(1,\ldots ,1)}
and to that direction's orthogonal complement hyperplane. One gets
A
→
=
(
X
¯
−
μ
,
…
,
X
¯
−
μ
)
{\displaystyle {\vec {A}}=({\overline {X}}-\mu ,\ldots ,{\overline {X}}-\mu )}
for the part along
u
→
{\displaystyle {\vec {u}}}
and
B
→
=
(
X
1
−
X
¯
,
…
,
X
n
−
X
¯
)
{\displaystyle {\vec {B}}=(X_{1}-{\overline {X}},\ldots ,X_{n}-{\overline {X}})}
for the complementary part. Since this is an orthogonal decomposition, Pythagorean theorem says
|
C
→
|
2
=
|
A
→
|
2
+
|
B
→
|
2
{\displaystyle |{\vec {C}}|^{2}=|{\vec {A}}|^{2}+|{\vec {B}}|^{2}}
, and taking expectations we get
n
σ
2
=
n
E
[
(
X
¯
−
μ
)
2
]
+
n
E
[
S
2
]
{\displaystyle n\sigma ^{2}=n\operatorname {E} \left[({\overline {X}}-\mu )^{2}\right]+n\operatorname {E} [S^{2}]}
, as above (but times
n
{\displaystyle n}
).
If the distribution of
C
→
{\displaystyle {\vec {C}}}
is rotationally symmetric, as in the case when
X
i
{\displaystyle X_{i}}
are sampled from a Gaussian, then on average, the dimension along
u
→
{\displaystyle {\vec {u}}}
contributes to
|
C
→
|
2
{\displaystyle |{\vec {C}}|^{2}}
equally as the
n
−
1
{\displaystyle n-1}
directions perpendicular to
u
→
{\displaystyle {\vec {u}}}
, so that
E
[
(
X
¯
−
μ
)
2
]
=
σ
2
n
{\displaystyle \operatorname {E} \left[({\overline {X}}-\mu )^{2}\right]={\frac {\sigma ^{2}}{n}}}
and
E
[
S
2
]
=
(
n
−
1
)
σ
2
n
{\displaystyle \operatorname {E} [S^{2}]={\frac {(n-1)\sigma ^{2}}{n}}}
. This is in fact true in general, as explained above.
= Estimating a Poisson probability
=A far more extreme case of a biased estimator being better than any unbiased estimator arises from the Poisson distribution. Suppose that X has a Poisson distribution with expectation λ. Suppose it is desired to estimate
P
(
X
=
0
)
2
=
e
−
2
λ
{\displaystyle \operatorname {P} (X=0)^{2}=e^{-2\lambda }\quad }
with a sample of size 1. (For example, when incoming calls at a telephone switchboard are modeled as a Poisson process, and λ is the average number of calls per minute, then e−2λ is the probability that no calls arrive in the next two minutes.)
Since the expectation of an unbiased estimator δ(X) is equal to the estimand, i.e.
E
(
δ
(
X
)
)
=
∑
x
=
0
∞
δ
(
x
)
λ
x
e
−
λ
x
!
=
e
−
2
λ
,
{\displaystyle \operatorname {E} (\delta (X))=\sum _{x=0}^{\infty }\delta (x){\frac {\lambda ^{x}e^{-\lambda }}{x!}}=e^{-2\lambda },}
the only function of the data constituting an unbiased estimator is
δ
(
x
)
=
(
−
1
)
x
.
{\displaystyle \delta (x)=(-1)^{x}.\,}
To see this, note that when decomposing e−λ from the above expression for expectation, the sum that is left is a Taylor series expansion of e−λ as well, yielding e−λe−λ = e−2λ (see Characterizations of the exponential function).
If the observed value of X is 100, then the estimate is 1, although the true value of the quantity being estimated is very likely to be near 0, which is the opposite extreme. And, if X is observed to be 101, then the estimate is even more absurd: It is −1, although the quantity being estimated must be positive.
The (biased) maximum likelihood estimator
e
−
2
X
{\displaystyle e^{-2{X}}\quad }
is far better than this unbiased estimator. Not only is its value always positive but it is also more accurate in the sense that its mean squared error
e
−
4
λ
−
2
e
λ
(
1
/
e
2
−
3
)
+
e
λ
(
1
/
e
4
−
1
)
{\displaystyle e^{-4\lambda }-2e^{\lambda (1/e^{2}-3)}+e^{\lambda (1/e^{4}-1)}\,}
is smaller; compare the unbiased estimator's MSE of
1
−
e
−
4
λ
.
{\displaystyle 1-e^{-4\lambda }.\,}
The MSEs are functions of the true value λ. The bias of the maximum-likelihood estimator is:
e
−
2
λ
−
e
λ
(
1
/
e
2
−
1
)
.
{\displaystyle e^{-2\lambda }-e^{\lambda (1/e^{2}-1)}.\,}
= Maximum of a discrete uniform distribution
=The bias of maximum-likelihood estimators can be substantial. Consider a case where n tickets numbered from 1 to n are placed in a box and one is selected at random, giving a value X. If n is unknown, then the maximum-likelihood estimator of n is X, even though the expectation of X given n is only (n + 1)/2; we can be certain only that n is at least X and is probably more. In this case, the natural unbiased estimator is 2X − 1.
Median-unbiased estimators
The theory of median-unbiased estimators was revived by George W. Brown in 1947:
An estimate of a one-dimensional parameter θ will be said to be median-unbiased, if, for fixed θ, the median of the distribution of the estimate is at the value θ; i.e., the estimate underestimates just as often as it overestimates. This requirement seems for most purposes to accomplish as much as the mean-unbiased requirement and has the additional property that it is invariant under one-to-one transformation.
Further properties of median-unbiased estimators have been noted by Lehmann, Birnbaum, van der Vaart and Pfanzagl. In particular, median-unbiased estimators exist in cases where mean-unbiased and maximum-likelihood estimators do not exist. They are invariant under one-to-one transformations.
There are methods of construction median-unbiased estimators for probability distributions that have monotone likelihood-functions, such as one-parameter exponential families, to ensure that they are optimal (in a sense analogous to minimum-variance property considered for mean-unbiased estimators). One such procedure is an analogue of the Rao–Blackwell procedure for mean-unbiased estimators: The procedure holds for a smaller class of probability distributions than does the Rao–Blackwell procedure for mean-unbiased estimation but for a larger class of loss-functions.
Bias with respect to other loss functions
Any minimum-variance mean-unbiased estimator minimizes the risk (expected loss) with respect to the squared-error loss function (among mean-unbiased estimators), as observed by Gauss. A minimum-average absolute deviation median-unbiased estimator minimizes the risk with respect to the absolute loss function (among median-unbiased estimators), as observed by Laplace. Other loss functions are used in statistics, particularly in robust statistics.
Effect of transformations
For univariate parameters, median-unbiased estimators remain median-unbiased under transformations that preserve order (or reverse order).
Note that, when a transformation is applied to a mean-unbiased estimator, the result need not be a mean-unbiased estimator of its corresponding population statistic. By Jensen's inequality, a convex function as transformation will introduce positive bias, while a concave function will introduce negative bias, and a function of mixed convexity may introduce bias in either direction, depending on the specific function and distribution. That is, for a non-linear function f and a mean-unbiased estimator U of a parameter p, the composite estimator f(U) need not be a mean-unbiased estimator of f(p). For example, the square root of the unbiased estimator of the population variance is not a mean-unbiased estimator of the population standard deviation: the square root of the unbiased sample variance, the corrected sample standard deviation, is biased. The bias depends both on the sampling distribution of the estimator and on the transform, and can be quite involved to calculate – see unbiased estimation of standard deviation for a discussion in this case.
Bias, variance and mean squared error
While bias quantifies the average difference to be expected between an estimator and an underlying parameter, an estimator based on a finite sample can additionally be expected to differ from the parameter due to the randomness in the sample.
An estimator that minimises the bias will not necessarily minimise the mean square error.
One measure which is used to try to reflect both types of difference is the mean square error,
MSE
(
θ
^
)
=
E
[
(
θ
^
−
θ
)
2
]
.
{\displaystyle \operatorname {MSE} ({\hat {\theta }})=\operatorname {E} {\big [}({\hat {\theta }}-\theta )^{2}{\big ]}.}
This can be shown to be equal to the square of the bias, plus the variance:
MSE
(
θ
^
)
=
(
E
[
θ
^
]
−
θ
)
2
+
E
[
(
θ
^
−
E
[
θ
^
]
)
2
]
=
(
Bias
(
θ
^
,
θ
)
)
2
+
Var
(
θ
^
)
{\displaystyle {\begin{aligned}\operatorname {MSE} ({\hat {\theta }})=&(\operatorname {E} [{\hat {\theta }}]-\theta )^{2}+\operatorname {E} [\,({\hat {\theta }}-\operatorname {E} [\,{\hat {\theta }}\,])^{2}\,]\\=&(\operatorname {Bias} ({\hat {\theta }},\theta ))^{2}+\operatorname {Var} ({\hat {\theta }})\end{aligned}}}
When the parameter is a vector, an analogous decomposition applies:
MSE
(
θ
^
)
=
trace
(
Cov
(
θ
^
)
)
+
‖
Bias
(
θ
^
,
θ
)
‖
2
{\displaystyle \operatorname {MSE} ({\hat {\theta }})=\operatorname {trace} (\operatorname {Cov} ({\hat {\theta }}))+\left\Vert \operatorname {Bias} ({\hat {\theta }},\theta )\right\Vert ^{2}}
where
trace
(
Cov
(
θ
^
)
)
{\displaystyle \operatorname {trace} (\operatorname {Cov} ({\hat {\theta }}))}
is the trace (diagonal sum) of the covariance matrix of the estimator and
‖
Bias
(
θ
^
,
θ
)
‖
2
{\displaystyle \left\Vert \operatorname {Bias} ({\hat {\theta }},\theta )\right\Vert ^{2}}
is the square vector norm.
= Example: Estimation of population variance
=For example, suppose an estimator of the form
T
2
=
c
∑
i
=
1
n
(
X
i
−
X
¯
)
2
=
c
n
S
2
{\displaystyle T^{2}=c\sum _{i=1}^{n}\left(X_{i}-{\overline {X}}\,\right)^{2}=cnS^{2}}
is sought for the population variance as above, but this time to minimise the MSE:
MSE
=
E
[
(
T
2
−
σ
2
)
2
]
=
(
E
[
T
2
−
σ
2
]
)
2
+
Var
(
T
2
)
{\displaystyle {\begin{aligned}\operatorname {MSE} =&\operatorname {E} \left[(T^{2}-\sigma ^{2})^{2}\right]\\=&\left(\operatorname {E} \left[T^{2}-\sigma ^{2}\right]\right)^{2}+\operatorname {Var} (T^{2})\end{aligned}}}
If the variables X1 ... Xn follow a normal distribution, then nS2/σ2 has a chi-squared distribution with n − 1 degrees of freedom, giving:
E
[
n
S
2
]
=
(
n
−
1
)
σ
2
and
Var
(
n
S
2
)
=
2
(
n
−
1
)
σ
4
.
{\displaystyle \operatorname {E} [nS^{2}]=(n-1)\sigma ^{2}{\text{ and }}\operatorname {Var} (nS^{2})=2(n-1)\sigma ^{4}.}
and so
MSE
=
(
c
(
n
−
1
)
−
1
)
2
σ
4
+
2
c
2
(
n
−
1
)
σ
4
{\displaystyle \operatorname {MSE} =(c(n-1)-1)^{2}\sigma ^{4}+2c^{2}(n-1)\sigma ^{4}}
With a little algebra it can be confirmed that it is c = 1/(n + 1) which minimises this combined loss function, rather than c = 1/(n − 1) which minimises just the square of the bias.
More generally it is only in restricted classes of problems that there will be an estimator that minimises the MSE independently of the parameter values.
However it is very common that there may be perceived to be a bias–variance tradeoff, such that a small increase in bias can be traded for a larger decrease in variance, resulting in a more desirable estimator overall.
Bayesian view
Most bayesians are rather unconcerned about unbiasedness (at least in the formal sampling-theory sense above) of their estimates. For example, Gelman and coauthors (1995) write: "From a Bayesian perspective, the principle of unbiasedness is reasonable in the limit of large samples, but otherwise it is potentially misleading."
Fundamentally, the difference between the Bayesian approach and the sampling-theory approach above is that in the sampling-theory approach the parameter is taken as fixed, and then probability distributions of a statistic are considered, based on the predicted sampling distribution of the data. For a Bayesian, however, it is the data which are known, and fixed, and it is the unknown parameter for which an attempt is made to construct a probability distribution, using Bayes' theorem:
p
(
θ
∣
D
,
I
)
∝
p
(
θ
∣
I
)
p
(
D
∣
θ
,
I
)
{\displaystyle p(\theta \mid D,I)\propto p(\theta \mid I)p(D\mid \theta ,I)}
Here the second term, the likelihood of the data given the unknown parameter value θ, depends just on the data obtained and the modelling of the data generation process. However a Bayesian calculation also includes the first term, the prior probability for θ, which takes account of everything the analyst may know or suspect about θ before the data comes in. This information plays no part in the sampling-theory approach; indeed any attempt to include it would be considered "bias" away from what was pointed to purely by the data. To the extent that Bayesian calculations include prior information, it is therefore essentially inevitable that their results will not be "unbiased" in sampling theory terms.
But the results of a Bayesian approach can differ from the sampling theory approach even if the Bayesian tries to adopt an "uninformative" prior.
For example, consider again the estimation of an unknown population variance σ2 of a Normal distribution with unknown mean, where it is desired to optimise c in the expected loss function
ExpectedLoss
=
E
[
(
c
n
S
2
−
σ
2
)
2
]
=
E
[
σ
4
(
c
n
S
2
σ
2
−
1
)
2
]
{\displaystyle \operatorname {ExpectedLoss} =\operatorname {E} \left[\left(cnS^{2}-\sigma ^{2}\right)^{2}\right]=\operatorname {E} \left[\sigma ^{4}\left(cn{\tfrac {S^{2}}{\sigma ^{2}}}-1\right)^{2}\right]}
A standard choice of uninformative prior for this problem is the Jeffreys prior,
p
(
σ
2
)
∝
1
/
σ
2
{\displaystyle \scriptstyle {p(\sigma ^{2})\;\propto \;1/\sigma ^{2}}}
, which is equivalent to adopting a rescaling-invariant flat prior for ln(σ2).
One consequence of adopting this prior is that S2/σ2 remains a pivotal quantity, i.e. the probability distribution of S2/σ2 depends only on S2/σ2, independent of the value of S2 or σ2:
p
(
S
2
σ
2
∣
S
2
)
=
p
(
S
2
σ
2
∣
σ
2
)
=
g
(
S
2
σ
2
)
{\displaystyle p\left({\tfrac {S^{2}}{\sigma ^{2}}}\mid S^{2}\right)=p\left({\tfrac {S^{2}}{\sigma ^{2}}}\mid \sigma ^{2}\right)=g\left({\tfrac {S^{2}}{\sigma ^{2}}}\right)}
However, while
E
p
(
S
2
∣
σ
2
)
[
σ
4
(
c
n
S
2
σ
2
−
1
)
2
]
=
σ
4
E
p
(
S
2
∣
σ
2
)
[
(
c
n
S
2
σ
2
−
1
)
2
]
{\displaystyle \operatorname {E} _{p(S^{2}\mid \sigma ^{2})}\left[\sigma ^{4}\left(cn{\tfrac {S^{2}}{\sigma ^{2}}}-1\right)^{2}\right]=\sigma ^{4}\operatorname {E} _{p(S^{2}\mid \sigma ^{2})}\left[\left(cn{\tfrac {S^{2}}{\sigma ^{2}}}-1\right)^{2}\right]}
in contrast
E
p
(
σ
2
∣
S
2
)
[
σ
4
(
c
n
S
2
σ
2
−
1
)
2
]
≠
σ
4
E
p
(
σ
2
∣
S
2
)
[
(
c
n
S
2
σ
2
−
1
)
2
]
{\displaystyle \operatorname {E} _{p(\sigma ^{2}\mid S^{2})}\left[\sigma ^{4}\left(cn{\tfrac {S^{2}}{\sigma ^{2}}}-1\right)^{2}\right]\neq \sigma ^{4}\operatorname {E} _{p(\sigma ^{2}\mid S^{2})}\left[\left(cn{\tfrac {S^{2}}{\sigma ^{2}}}-1\right)^{2}\right]}
— when the expectation is taken over the probability distribution of σ2 given S2, as it is in the Bayesian case, rather than S2 given σ2, one can no longer take σ4 as a constant and factor it out. The consequence of this is that, compared to the sampling-theory calculation, the Bayesian calculation puts more weight on larger values of σ2, properly taking into account (as the sampling-theory calculation cannot) that under this squared-loss function the consequence of underestimating large values of σ2 is more costly in squared-loss terms than that of overestimating small values of σ2.
The worked-out Bayesian calculation gives a scaled inverse chi-squared distribution with n − 1 degrees of freedom for the posterior probability distribution of σ2. The expected loss is minimised when cnS2 = <σ2>; this occurs when c = 1/(n − 3).
Even with an uninformative prior, therefore, a Bayesian calculation may not give the same expected-loss minimising result as the corresponding sampling-theory calculation.
See also
Notes
References
Brown, George W. "On Small-Sample Estimation." The Annals of Mathematical Statistics, vol. 18, no. 4 (Dec., 1947), pp. 582–585. JSTOR 2236236.
Lehmann, E. L. (December 1951). "A General Concept of Unbiasedness". The Annals of Mathematical Statistics. 22 (4): 587–592. JSTOR 2236928.
Birnbaum, Allan (March 1961). "A Unified Theory of Estimation, I". The Annals of Mathematical Statistics. 32 (1): 112–135.{{cite journal}}: CS1 maint: date and year (link)
Van der Vaart, H. R. (June 1961). "Some Extensions of the Idea of Bias". The Annals of Mathematical Statistics. 32 (2): 436–447.{{cite journal}}: CS1 maint: date and year (link)
Pfanzagl, Johann (1994). Parametric Statistical Theory. Walter de Gruyter.
Stuart, Alan; Ord, Keith; Arnold, Steven [F.] (2010). Classical Inference and the Linear Model. Kendall's Advanced Theory of Statistics. Vol. 2A. Wiley. ISBN 978-0-4706-8924-0..
Voinov, Vassily [G.]; Nikulin, Mikhail [S.] (1993). Unbiased estimators and their applications. Vol. 1: Univariate case. Dordrect: Kluwer Academic Publishers. ISBN 0-7923-2382-3.
Voinov, Vassily [G.]; Nikulin, Mikhail [S.] (1996). Unbiased estimators and their applications. Vol. 2: Multivariate case. Dordrect: Kluwer Academic Publishers. ISBN 0-7923-3939-8.
Klebanov, Lev [B.]; Rachev, Svetlozar [T.]; Fabozzi, Frank [J.] (2009). Robust and Non-Robust Models in Statistics. New York: Nova Scientific Publishers. ISBN 978-1-60741-768-2.
External links
"Unbiased estimator", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
Kata Kunci Pencarian:
- Bhramar Mukherjee
- Parameter
- Efek pengacau
- Bias of an estimator
- Estimator
- Bias (statistics)
- Jackknife resampling
- Consistent estimator
- Mean squared error
- Bias–variance tradeoff
- Minimum-variance unbiased estimator
- Bias (disambiguation)
- Bessel's correction
