Bias of an Estimator

Suppose a factory quality inspector wants to know the true fraction of defective bulbs. She can only test a sample. Any rule she uses to turn sample data into a guess is an estimator. A natural question arises: if she repeated this sampling procedure many times, would her guesses cluster around the true value? Or would they systematically miss it in one direction? This question — whether an estimator's average behavior over repeated sampling matches the truth — is exactly what the bias of an estimator measures. Bias matters because it separates two very different kinds of error. An estimator can be wildly variable from sample to sample yet still be unbiased. This means its long-run average is correct. Conversely, an estimator can be very stable yet systematically wrong. It may always overshoot or undershoot the parameter it targets. Understanding bias lets statisticians diagnose which of these failure modes is present. They can then choose or correct estimators accordingly. This theme recurs throughout statistical inference, from simple sample means to complex machine learning models. The big picture is this: an estimator is a random variable, since it depends on the random sample. So it has a sampling distribution with its own mean. Bias is simply the discrepancy between that mean and the parameter the estimator is trying to estimate. This is a pre-data, repeated-sampling notion. It says nothing about how close any single estimate is to the truth. It only describes the average tendency of the procedure across hypothetical repetitions. This article gives the precise definition of bias. It proves the classical facts distinguishing biased from unbiased estimators, including the notorious case of the sample variance. It also builds the intuition needed before moving on to Variance and Mean Squared Error and the deeper structural results such as The Rao-Blackwell Theorem.

Key takeaways
  • Bias measures the systematic, average error of an estimator over repeated sampling, not error in a single draw.
  • An estimator θ^\hat\theta is unbiased if E[θ^]=θE[\hat\theta] = \theta for every possible value of θ\theta.
  • The sample mean Xˉ\bar X is always an unbiased estimator of the population mean μ\mu.
  • The naive sample variance (dividing by nn) is biased downward; dividing by n−1n-1 fixes this.
  • Unbiasedness is not automatically "good" — it says nothing about variance, and biased estimators can have smaller total error.
  • Key idea: bias is the difference E[θ^]−θE[\hat\theta] - \theta, a property of the estimator's whole sampling distribution, not of any one sample.

Where this lives today

Bias correction and awareness of systematic estimator error appear throughout applied quantitative work. In survey statistics and econometrics, sample weights and finite-population corrections are designed explicitly to remove bias from estimators of totals and means under complex sampling designs. In machine learning, the bias–variance decomposition of prediction error is a central diagnostic tool for choosing model complexity, regularization strength, and ensemble methods, generalizing the mean-squared-error decomposition seen here. In signal processing and control theory, biased estimators (like shrinkage or ridge estimators) are deliberately introduced to trade a small bias for a large reduction in variance, improving overall estimation accuracy — a strategy formalized later via the The Rao-Blackwell Theorem and related results on efficient estimation. In physics and metrology, calibration procedures for instruments are essentially bias-correction algorithms, ensuring that repeated measurements average to the true physical quantity. And in finance, unbiasedness of volatility or risk estimators (like sample variance of returns) directly affects the correctness of pricing and risk models, making the n−1n-1 correction from this article a matter of real economic consequence.

:::quiz[If Eθ[θ^]=θ+3E_\theta[\hat\theta] = \theta + 3 for all θ\theta, what is the bias of θ^\hat\theta?]

  • 0, since the estimator still moves correctly with θ
  • 3, a constant bias for every θ ✓
  • θ, because the bias depends on the parameter
  • Undefined, because bias only applies to unbiased estimators

Ask the tutor: How does the bias of an estimator interact with its variance to determine overall estimator quality via mean squared error?

DefinitionBias of an Estimator

Let X1,…,XnX_1, \dots, X_n be a random sample from a distribution depending on an unknown parameter θ∈Θ\theta \in \Theta, and let

θ^=θ^(X1,…,Xn)\hat\theta = \hat\theta(X_1,\dots,X_n)

be an estimator of θ\theta (a statistic, i.e. a measurable function of the data not depending on θ\theta). Assume Eθ[θ^]E_\theta[\hat\theta] exists (is finite) for every θ∈Θ\theta \in \Theta. The bias of θ^\hat\theta at θ\theta is

Bias⁡θ(θ^)  =  Eθ[θ^]−θ.\operatorname{Bias}_\theta(\hat\theta) \;=\; E_\theta[\hat\theta] - \theta.

The estimator θ^\hat\theta is called unbiased for θ\theta if

Bias⁡θ(θ^)=0for all θ∈Θ,\operatorname{Bias}_\theta(\hat\theta) = 0 \quad \text{for all } \theta \in \Theta,

that is, Eθ[θ^]=θE_\theta[\hat\theta] = \theta for every admissible value of the parameter. If Bias⁡θ(θ^)≠0\operatorname{Bias}_\theta(\hat\theta) \neq 0 for some θ\theta, the estimator is called biased, and Bias⁡θ(θ^)\operatorname{Bias}_\theta(\hat\theta) quantifies the systematic over- or under-estimation at that θ\theta. More generally, if τ(θ)\tau(\theta) is some function of θ\theta being estimated (not necessarily θ\theta itself), an estimator T=T(X1,…,Xn)T = T(X_1,\dots,X_n) is unbiased for τ(θ)\tau(\theta) if Eθ[T]=τ(θ)E_\theta[T] = \tau(\theta) for all θ\theta.

Intuition

Think of an estimator as an archer shooting at a target repeatedly, where the bullseye is the true parameter θ\theta. Each sample gives one arrow; the sampling distribution of θ^\hat\theta describes where arrows tend to land across many repetitions of "draw a fresh sample, compute θ^\hat\theta." Bias asks only about the center of mass of all those arrow positions: is it exactly on the bullseye, or offset to one side? An unbiased archer might still scatter arrows widely (high variance) but their average landing point is dead-center. A biased archer might group arrows tightly (low variance) but consistently to the upper-left of the bullseye. This is a subtle but crucial point: bias is a statement about E[θ^]E[\hat\theta], computed by averaging over the hypothetical repeated sampling, not a statement about how far a particular computed estimate is from θ\theta. You never observe θ\theta, so you can never directly check whether one estimate was "biased" — bias is a property of the estimation procedure, verified mathematically or via simulation, not of a single number.

Figure
Sampling distributions of a biased vs. an unbiased estimator, target parameter θ = 5
value of estimator θ = 5 unbiased: E[θ̂]=5 biased: E[θ̂]=6.5 6.5

The mean is unbiased, the naive variance is not

TheoremUnbiasedness of the sample mean and of the sample variance S2S^2

Let X1,…,XnX_1, \dots, X_n (n≥2n \ge 2) be independent and identically distributed random variables with unknown finite mean μ=E[Xi]\mu = E[X_i] and finite variance σ2=Var⁡(Xi)<∞\sigma^2 = \operatorname{Var}(X_i) < \infty. Define the sample mean

Xˉ=1n∑i=1nXi,\bar X = \frac{1}{n}\sum_{i=1}^n X_i,

and the sample variance

S2=1n−1∑i=1n(Xi−Xˉ)2.S^2 = \frac{1}{n-1}\sum_{i=1}^n (X_i - \bar X)^2.

Then: 1. Xˉ\bar X is an unbiased estimator of μ\mu: E[Xˉ]=μE[\bar X] = \mu. 2. S2S^2 is an unbiased estimator of σ2\sigma^2: E[S2]=σ2E[S^2] = \sigma^2. 3. In contrast, the "naive" variance estimator σ^n2=1n∑i=1n(Xi−Xˉ)2\hat\sigma^2_n = \frac{1}{n}\sum_{i=1}^n (X_i-\bar X)^2 is biased, with

E[σ^n2]=n−1nσ2=σ2−σ2n,E[\hat\sigma^2_n] = \frac{n-1}{n}\sigma^2 = \sigma^2 - \frac{\sigma^2}{n},

so it systematically underestimates σ2\sigma^2 by a factor of σ2n>0\frac{\sigma^2}{n} > 0.

Proof

We prove each part using direct expectation calculations, the technique of expanding sums of squares and using linearity of expectation together with independence.

Part 1. By linearity of expectation,

E[Xˉ]=E[1n∑i=1nXi]=1n∑i=1nE[Xi]=1n⋅nμ=μ.E[\bar X] = E\left[\frac{1}{n}\sum_{i=1}^n X_i\right] = \frac{1}{n}\sum_{i=1}^n E[X_i] = \frac{1}{n}\cdot n\mu = \mu.

This uses only linearity, which requires no independence assumption at all — only that each XiX_i has mean μ\mu.

Preliminary identity. We first compute E[∑i=1n(Xi−Xˉ)2]E\left[\sum_{i=1}^n (X_i - \bar X)^2\right]. Write Xi−Xˉ=(Xi−μ)−(Xˉ−μ)X_i - \bar X = (X_i - \mu) - (\bar X - \mu). Then

∑i=1n(Xi−Xˉ)2=∑i=1n[(Xi−μ)−(Xˉ−μ)]2=∑i=1n(Xi−μ)2−2(Xˉ−μ)∑i=1n(Xi−μ)+n(Xˉ−μ)2.\sum_{i=1}^n (X_i-\bar X)^2 = \sum_{i=1}^n \big[(X_i-\mu) - (\bar X - \mu)\big]^2 = \sum_{i=1}^n (X_i-\mu)^2 - 2(\bar X-\mu)\sum_{i=1}^n (X_i - \mu) + n(\bar X - \mu)^2.

Since ∑i=1n(Xi−μ)=n(Xˉ−μ)\sum_{i=1}^n (X_i - \mu) = n(\bar X - \mu), the middle term is −2n(Xˉ−μ)2-2n(\bar X-\mu)^2, so the whole expression simplifies to

∑i=1n(Xi−Xˉ)2=∑i=1n(Xi−μ)2−n(Xˉ−μ)2.\sum_{i=1}^n (X_i-\bar X)^2 = \sum_{i=1}^n (X_i - \mu)^2 - n(\bar X - \mu)^2.

Taking expectations and using the definitions Var⁡(Xi)=E[(Xi−μ)2]=σ2\operatorname{Var}(X_i) = E[(X_i-\mu)^2] = \sigma^2 and Var⁡(Xˉ)=E[(Xˉ−μ)2]\operatorname{Var}(\bar X) = E[(\bar X - \mu)^2],

E[∑i=1n(Xi−Xˉ)2]=∑i=1nE[(Xi−μ)2]−n E[(Xˉ−μ)2]=nσ2−nVar⁡(Xˉ).E\left[\sum_{i=1}^n (X_i-\bar X)^2\right] = \sum_{i=1}^n E[(X_i-\mu)^2] - n\,E[(\bar X-\mu)^2] = n\sigma^2 - n\operatorname{Var}(\bar X).

Now compute Var⁡(Xˉ)\operatorname{Var}(\bar X) using independence of the XiX_i (this is the only place independence is used):

Var⁡(Xˉ)=Var⁡(1n∑i=1nXi)=1n2∑i=1nVar⁡(Xi)=1n2⋅nσ2=σ2n,\operatorname{Var}(\bar X) = \operatorname{Var}\left(\frac{1}{n}\sum_{i=1}^n X_i\right) = \frac{1}{n^2}\sum_{i=1}^n \operatorname{Var}(X_i) = \frac{1}{n^2}\cdot n\sigma^2 = \frac{\sigma^2}{n},

where the middle equality holds because variance of a sum of independent random variables equals the sum of variances (cross-covariance terms vanish). Substituting back,

E[∑i=1n(Xi−Xˉ)2]=nσ2−n⋅σ2n=nσ2−σ2=(n−1)σ2.E\left[\sum_{i=1}^n (X_i-\bar X)^2\right] = n\sigma^2 - n\cdot \frac{\sigma^2}{n} = n\sigma^2 - \sigma^2 = (n-1)\sigma^2.

Part 2. Divide both sides by n−1n-1:

E[S2]=E[1n−1∑i=1n(Xi−Xˉ)2]=1n−1⋅(n−1)σ2=σ2.E[S^2] = E\left[\frac{1}{n-1}\sum_{i=1}^n (X_i-\bar X)^2\right] = \frac{1}{n-1}\cdot (n-1)\sigma^2 = \sigma^2.

Hence S2S^2 is an unbiased estimator of σ2\sigma^2, valid for every distribution with finite variance, regardless of n≥2n \ge 2.

Part 3. Since σ^n2=n−1nS2\hat\sigma_n^2 = \frac{n-1}{n}S^2, we get directly

E[σ^n2]=n−1nE[S2]=n−1nσ2,E[\hat\sigma_n^2] = \frac{n-1}{n}E[S^2] = \frac{n-1}{n}\sigma^2,

which is strictly less than σ2\sigma^2 whenever σ2>0\sigma^2 > 0 and nn is finite. So

Bias⁡(σ^n2)=E[σ^n2]−σ2=−σ2n≠0,\operatorname{Bias}(\hat\sigma_n^2) = E[\hat\sigma_n^2] - \sigma^2 = -\frac{\sigma^2}{n} \neq 0,

proving σ^n2\hat\sigma_n^2 is biased, with the bias vanishing only in the limit n→∞n \to \infty (asymptotic unbiasedness). ■\blacksquare

∎

Worked examples

Example 1 (Estimating the maximum of a uniform distribution — an asymmetric, non-obvious case). Let X1,…,XnX_1, \dots, X_n be i.i.d. Uniform(0,θ)\mathrm{Uniform}(0,\theta) with unknown θ>0\theta > 0, and consider the natural estimator θ^=X(n)=max⁡(X1,…,Xn)\hat\theta = X_{(n)} = \max(X_1,\dots,X_n), the sample maximum. First find the density of X(n)X_{(n)}. The CDF of XiX_i is F(x)=x/θF(x) = x/\theta for 0≤x≤θ0 \le x \le \theta. By independence, the CDF of the maximum is

F(n)(x)=P(X(n)≤x)=P(X1≤x,…,Xn≤x)=(xθ)n,0≤x≤θ.F_{(n)}(x) = P(X_{(n)} \le x) = P(X_1 \le x, \dots, X_n \le x) = \left(\frac{x}{\theta}\right)^n, \qquad 0 \le x \le \theta.

Differentiating, the density is f(n)(x)=nxn−1θnf_{(n)}(x) = \frac{n x^{n-1}}{\theta^n} on (0,θ)(0,\theta). Then

E[X(n)]=∫0θx⋅nxn−1θn dx=nθn∫0θxn dx=nθn⋅θn+1n+1=nn+1θ.E[X_{(n)}] = \int_0^\theta x \cdot \frac{n x^{n-1}}{\theta^n}\,dx = \frac{n}{\theta^n}\int_0^\theta x^n\,dx = \frac{n}{\theta^n}\cdot \frac{\theta^{n+1}}{n+1} = \frac{n}{n+1}\theta.

So

Bias⁡(X(n))=nn+1θ−θ=−θn+1≠0,\operatorname{Bias}(X_{(n)}) = \frac{n}{n+1}\theta - \theta = -\frac{\theta}{n+1} \neq 0,

and X(n)X_{(n)} systematically underestimates θ\theta — it can never exceed θ\theta, so this is intuitively unsurprising, but the theorem quantifies exactly how much on average. To correct this, define

θ^∗=n+1nX(n).\hat\theta^{*} = \frac{n+1}{n}X_{(n)}.

Then E[θ^∗]=n+1n⋅nn+1θ=θE[\hat\theta^*] = \frac{n+1}{n}\cdot\frac{n}{n+1}\theta = \theta, so θ^∗\hat\theta^* is unbiased. Concretely, with n=4n = 4 observations and observed maximum x(4)=7.2x_{(4)} = 7.2, the biased estimate is 7.27.2 while the bias-corrected estimate is 54(7.2)=9.0\frac{5}{4}(7.2) = 9.0 — a substantial correction reflecting that with only 4 draws, the maximum tends to fall well short of θ\theta.

Example 2 (Estimating p2p^2 for a Bernoulli proportion — bias of a nonlinear function of an unbiased estimator). Let X1,…,XnX_1,\dots,X_n be i.i.d. Bernoulli(p)\mathrm{Bernoulli}(p), and suppose we want to estimate τ(p)=p2\tau(p) = p^2 (e.g. the probability two independent components both work, if pp is the reliability of one component). The sample proportion p^=Xˉ\hat p = \bar X is unbiased for pp: E[p^]=pE[\hat p] = p. A tempting estimator for p2p^2 is p^2\hat p^2. Is it unbiased for p2p^2? Recall the identity Var⁡(p^)=E[p^2]−(E[p^])2\operatorname{Var}(\hat p) = E[\hat p^2] - (E[\hat p])^2, so

E[p^2]=Var⁡(p^)+p2=p(1−p)n+p2,E[\hat p^2] = \operatorname{Var}(\hat p) + p^2 = \frac{p(1-p)}{n} + p^2,

using Var⁡(p^)=Var⁡(Xˉ)=σ2/n=p(1−p)/n\operatorname{Var}(\hat p) = \operatorname{Var}(\bar X) = \sigma^2/n = p(1-p)/n for Bernoulli(p)(p) (since σ2=p(1−p)\sigma^2 = p(1-p)). Thus

Bias⁡(p^2)=E[p^2]−p2=p(1−p)n>0whenever 0<p<1.\operatorname{Bias}(\hat p^2) = E[\hat p^2] - p^2 = \frac{p(1-p)}{n} > 0 \quad \text{whenever } 0 < p < 1.

So p^2\hat p^2 overestimates p2p^2 on average — a concrete instance of the general fact that a nonlinear (here, convex) transformation of an unbiased estimator is typically biased (a consequence of Jensen's inequality, since g(x)=x2g(x)=x^2 is strictly convex). For example, with n=10n = 10 and p=0.3p = 0.3: the true value is p2=0.09p^2 = 0.09, while E[p^2]=0.3×0.710+0.09=0.021+0.09=0.111E[\hat p^2] = \frac{0.3 \times 0.7}{10} + 0.09 = 0.021 + 0.09 = 0.111, a relative overestimation of about 23%. An unbiased estimator of p2p^2 instead is p^2−p^(1−p^)n−1\hat p^2 - \frac{\hat p(1-\hat p)}{n-1} (the standard bias-corrected estimator), which can be verified to have expectation exactly p2p^2.

CounterexampleWhy "unbiased" requires every θ∈Θ\theta \in \Theta, not just one

The definition demands Eθ[θ^]=θE_\theta[\hat\theta] = \theta for all θ\theta in the parameter space, not merely for some particular convenient value. Dropping this "for all θ\theta" quantifier and replacing it with "for some θ\theta" produces a vacuous and misleading notion. To see why this matters, consider estimating μ\mu, the mean of a Normal(μ,1)\mathrm{Normal}(\mu,1) population, from a single observation X1X_1, and let Θ=R\Theta = \mathbb{R}. Define the estimator

μ^≡7(the constant estimator, ignoring the data entirely).\hat\mu \equiv 7 \quad \text{(the constant estimator, ignoring the data entirely)}.

Then Eθ[μ^]=7E_\theta[\hat\mu] = 7 for every θ\theta. Under the weakened ("for some θ\theta") reading, this estimator would qualify as "unbiased" simply because it satisfies Eθ[μ^]=θE_\theta[\hat\mu]=\theta at the single point θ=7\theta = 7. Yet this estimator is obviously useless: it returns 77 no matter what the data show, completely ignoring the sample, and is wildly wrong whenever the true μ≠7\mu \ne 7. This shows that unbiasedness is only a meaningful, non-vacuous property when required to hold uniformly over the whole parameter space Θ\Theta. The correct definition — Eθ[θ^]=θE_\theta[\hat\theta]=\theta for all θ∈Θ\theta \in \Theta — correctly excludes μ^≡7\hat\mu \equiv 7, since Eθ[μ^]=7≠θE_\theta[\hat\mu] = 7 \ne \theta for any θ≠7\theta \ne 7, and this constant estimator is (correctly) classified as heavily biased everywhere except one point.

Scope, edge cases & common traps

SituationWhat to check
Estimator is a nonlinear function of an unbiased estimator (e.g. p^2\hat p^2, σ^\hat\sigma from S2S^2)Generally biased; use Jensen's inequality to predict the direction for convex/concave gg
Small sample size nnBias of estimators like σ^n2\hat\sigma_n^2 or X(n)X_{(n)} can be large relative to θ\theta; always check finite-sample bias, not just asymptotic behavior
Eθ[θ^]E_\theta[\hat\theta] fails to exist (e.g. Cauchy-type models)Bias is undefined; the whole framework requires Eθ[θ^]E_\theta[\hat\theta] finite for all θ\theta
Comparing two unbiased estimatorsBias alone cannot compare them — need Variance and Mean Squared Error to judge overall quality
Believing "unbiased implies good"False in general: a biased estimator can have much smaller mean squared error, especially when its variance is small

The mathematician behind it

Origins · 1 minRonald Aylmer Fisher and how this was discovered
RA
Ronald Aylmer Fisher
1890–1962 · Foundations of modern statistical inference, Cambridge/Rothamsted/UCL

Fisher developed much of the conceptual vocabulary of point estimation — including systematic study of bias, efficiency, sufficiency, and the method of maximum likelihood — while working on agricultural experiments at Rothamsted Experimental Station. His insistence on precisely quantifying the systematic and random components of estimation error laid the groundwork for the modern separation of bias from variance, a distinction that remains central to statistics and machine learning a century later.

History
- 1908 — William Sealy Gosset ("Student") studies small-sample estimation of variance, implicitly confronting bias in the denominator-nn estimator.
- 1922 — Fisher's paper "On the Mathematical Foundations of Theoretical Statistics" formalizes estimation theory, introducing concepts of consistency, efficiency, and sufficiency alongside bias.
- 1925 — Fisher's Statistical Methods for Research Workers popularizes the n−1n-1 divisor for sample variance, cementing the unbiased convention in applied statistics.
- 1934 — Aitken and others refine linear unbiased estimation theory, anticipating the Gauss–Markov framework for regression.
- 1947 — Rao and Blackwell (independently, close in time) prove what becomes The Rao-Blackwell Theorem, showing how to improve unbiased estimators using sufficiency.
What exactly does "bias" mean if I only ever collect one sample in real life?

Bias is a property of the estimation procedure, defined via its behavior across the hypothetical population of all samples you could have drawn, not a property of the one number you compute. Formally, Bias⁡θ(θ^)=Eθ[θ^]−θ\operatorname{Bias}_\theta(\hat\theta) = E_\theta[\hat\theta] - \theta averages over the sampling distribution of θ^\hat\theta, which requires imagining (or simulating) repeated sampling under the same true θ\theta. Even though you only see one estimate in practice, the mathematical guarantee "if this procedure were repeated indefinitely, it would average out correctly" is exactly what justifies trusting the single estimate you do get, especially when combined with knowledge of the estimator's variance.

Is an unbiased estimator always better than a biased one?

No — bias is only one component of total estimation error. The mean squared error decomposes as E[(θ^−θ)2]=Var⁡(θ^)+Bias⁡(θ^)2E[(\hat\theta-\theta)^2] = \operatorname{Var}(\hat\theta) + \operatorname{Bias}(\hat\theta)^2, so a biased estimator with much smaller variance can have strictly smaller total error than an unbiased one with large variance. This trade-off is the heart of the bias–variance framework studied in Variance and Mean Squared Error, and it motivates deliberately biased techniques such as ridge regression and shrinkage estimators, which sacrifice a small amount of bias for large reductions in variance.

Why do we divide by n−1n-1 instead of nn in the sample variance formula?

Dividing by nn produces an estimator whose expectation is n−1nσ2\frac{n-1}{n}\sigma^2, strictly less than σ2\sigma^2, because the sample mean Xˉ\bar X is by construction the value that minimizes ∑i(Xi−c)2\sum_i (X_i - c)^2 over choices of cc, making the observed spread around Xˉ\bar X smaller than the spread around the true unknown μ\mu. Dividing by n−1n-1 exactly compensates for this "self-centering" effect, as proven in the central theorem above, yielding E[S2]=σ2E[S^2] = \sigma^2 for every distribution with finite variance. This is known as Bessel's correction.

Can an estimator be biased for small nn but unbiased in the limit?

Yes — this is called asymptotic unbiasedness. The naive variance estimator σ^n2\hat\sigma_n^2 has bias −σ2/n-\sigma^2/n, which is nonzero for every finite nn but converges to 00 as n→∞n \to \infty. Asymptotic unbiasedness is weaker than exact unbiasedness: it only guarantees the systematic error vanishes in the large-sample limit, and says nothing about how large the bias might be for the specific, finite sample size actually available, which is often the practically relevant regime.

Does bias depend on the true value of the parameter?

In general, yes. The quantity Bias⁡θ(θ^)=Eθ[θ^]−θ\operatorname{Bias}_\theta(\hat\theta) = E_\theta[\hat\theta]-\theta is a function of θ\theta, and an estimator can be unbiased at some parameter values and biased at others. The formal definition of "unbiased estimator" requires the bias to be zero uniformly, i.e. for every θ\theta in the parameter space Θ\Theta, as illustrated by the counterexample of the constant estimator, which is "correct" only at one isolated point but is not called unbiased.

How is bias related to the Rao-Blackwell theorem?

The The Rao-Blackwell Theorem shows that, given any unbiased estimator, conditioning it on a sufficient statistic produces a new estimator that is still unbiased for the same parameter but has variance no larger than the original. This means bias itself is preserved (kept at zero) while variance can only improve, making Rao-Blackwellization a systematic way to refine unbiased estimators without reintroducing bias — a natural next step after understanding what bias means and why removing it, on its own, is not the whole story of a good estimator.

What is the difference between bias and estimation error?

Estimation error, θ^−θ\hat\theta - \theta, is a random variable that varies from sample to sample and can be positive or negative even for a perfectly unbiased estimator. Bias, Eθ[θ^]−θE_\theta[\hat\theta]-\theta, is the expected value of that error, a fixed (non-random) number for each θ\theta that captures only the systematic component. An unbiased estimator can still produce large individual errors on any given sample; it only guarantees that these errors average to zero over repeated sampling, leaving variance to govern the typical magnitude of a single error.

Before this

Where this leads