Week 8.1: Properties of Estimators

582 words
3 min read
Python Week 1: the first filter for runtime behavior
Visual companion
Python
Type and operator map

Python Week 1: the first filter for runtime behavior

View
Revision summary

What this note is really saying

Short form

# Week 8.1: Properties of Estimators > **Prerequisites:** MME ([Week 7.1: Point Estimation — Method of Moments (MME)](/notes/01-foundation-bsma1004-stats-2-week07-20-point-estimation-mme)), MLE ([Week 7.2: Maximum Likelihood Estimation (MLE)](/notes/01-foundation-bsma1004-stats-2-week07-21-point-estimation-mle)) > *...

Week 8.1: Properties of Estimators

Prerequisites: MME (Week 7.1: Point Estimation — Method of Moments (MME)), MLE (Week 7.2: Maximum Likelihood Estimation (MLE)) Cross-links: BSMA3012 (Linear Stat Models) — estimator evaluation Core question: What makes a "good" estimator?

1. Intuition: Evaluating Our Guesses

An estimator θ^n\hat{\theta}_n is a function of the sample — a random variable. We evaluate estimators by three criteria:
  1. Bias: Is it correct on average? Bias(θ^)=E[θ^]−θ\text{Bias}(\hat{\theta}) = \mathbb{E}[\hat{\theta}] - \theta.
  2. Variance: How much does it fluctuate? Var⁡(θ^)\operatorname{Var}(\hat{\theta}).
  3. Consistency: Does it converge to the truth as n→∞n \to \infty?

2. Bias and Unbiasedness

Definition (Bias) Bias(θ^)=E[θ^]−θ\text{Bias}(\hat{\theta}) = \mathbb{E}[\hat{\theta}] - \theta. θ^\hat{\theta} is unbiased if Bias(θ^)=0\text{Bias}(\hat{\theta}) = 0, i.e., E[θ^]=θ\mathbb{E}[\hat{\theta}] = \theta. Examples:
  • Xˉ\bar{X} is unbiased for μ\mu: E[Xˉ]=μ\mathbb{E}[\bar{X}] = \mu.
  • S2=1n−1∑(Xi−Xˉ)2S^2 = \frac{1}{n-1}\sum (X_i-\bar{X})^2 is unbiased for σ2\sigma^2.
  • σ^MLE2=1n∑(Xi−Xˉ)2\hat{\sigma}^2_{\text{MLE}} = \frac{1}{n}\sum (X_i-\bar{X})^2 is biased: E[σ^MLE2]=n−1nσ2\mathbb{E}[\hat{\sigma}^2_{\text{MLE}}] = \frac{n-1}{n}\sigma^2. Bias correction: Multiply MLE variance by nn−1\frac{n}{n-1} to get unbiased estimate.

3. Variance and MSE

Definition (Mean Squared Error)
>MSE(θ^)=E[(θ^−θ)2]=Var⁡(θ^)+[Bias(θ^)]2.>> \text{MSE}(\hat{\theta}) = \mathbb{E}[(\hat{\theta} - \theta)^2] = \operatorname{Var}(\hat{\theta}) + [\text{Bias}(\hat{\theta})]^2. >
Trade-off: Sometimes a biased estimator with lower variance can have smaller MSE than an unbiased estimator with high variance.

4. Consistency

Definition (Consistency) θ^n\hat{\theta}_n is consistent if θ^n→pθ\hat{\theta}_n \xrightarrow{p} \theta as n→∞n \to \infty (converges in probability). Sufficient condition: If Bias(θ^n)→0\text{Bias}(\hat{\theta}_n) \to 0 and Var⁡(θ^n)→0\operatorname{Var}(\hat{\theta}_n) \to 0, then θ^n\hat{\theta}_n is consistent (by Chebyshev). Examples:
  • Xˉ\bar{X} is consistent for μ\mu (by LLN).
  • MLEs are generally consistent under regularity conditions.

5. Efficiency

Definition (Efficiency) θ^1\hat{\theta}_1 is more efficient than θ^2\hat{\theta}_2 if Var⁡(θ^1)<Var⁡(θ^2)\operatorname{Var}(\hat{\theta}_1) < \operatorname{Var}(\hat{\theta}_2) (both unbiased). Cramér-Rao Lower Bound (CRLB): For unbiased estimators:
Var⁡(θ^)≥1n⋅I(θ),\operatorname{Var}(\hat{\theta}) \geq \frac{1}{n \cdot I(\theta)},
where I(θ)=E[(∂ln⁡f(X;θ)∂θ)2]I(\theta) = \mathbb{E}\left[ \left( \frac{\partial \ln f(X;\theta)}{\partial \theta} \right)^2 \right] is the Fisher Information. An estimator achieving the CRLB is called efficient (MVUE — Minimum Variance Unbiased Estimator).

6. Summary Table

PropertyDefinitionWhy It Matters
UnbiasednessE[θ^]=θ\mathbb{E}[\hat{\theta}] = \thetaNo systematic error
Consistencyθ^n→pθ\hat{\theta}_n \xrightarrow{p} \thetaImproves with more data
EfficiencyMinimum variance among unbiasedMost precise
MSEVar⁡+Bias2\operatorname{Var} + \text{Bias}^2Overall accuracy

7. Practice Questions

Q1 (Easy)

Is S2=1n−1∑(Xi−Xˉ)2S^2 = \frac{1}{n-1}\sum (X_i-\bar{X})^2 unbiased for σ2\sigma^2?
Full Solution
Yes. E[S2]=σ2\mathbb{E}[S^2] = \sigma^2. This is why we divide by n−1n-1 — to correct the bias of the MLE.

Q2 (Medium)

Show that Xˉ\bar{X} is consistent for μ\mu when σ2<∞\sigma^2 < \infty.
Full Solution
E[Xˉ]=μ\mathbb{E}[\bar{X}] = \mu (unbiased), Var⁡(Xˉ)=σ2/n→0\operatorname{Var}(\bar{X}) = \sigma^2/n \to 0 as n→∞n \to \infty.
By Chebyshev: P(∣Xˉ−μ∣≥ϵ)≤σ2nϵ2→0\mathbb{P}(|\bar{X} - \mu| \geq \epsilon) \leq \frac{\sigma^2}{n\epsilon^2} \to 0. So Xˉ→pμ\bar{X} \xrightarrow{p} \mu.

Q3 (Hard)

For Xi∼Uniform(0,θ)X_i \sim \text{Uniform}(0,\theta), show that the MLE θ^=X(n)\hat{\theta} = X_{(n)} is biased. Find an unbiased version.
Full Solution
CDF of max: FX(n)(x)=(x/θ)nF_{X_{(n)}}(x) = (x/\theta)^n, 0≤x≤θ0 \leq x \leq \theta.
PDF: fX(n)(x)=nxn−1/θnf_{X_{(n)}}(x) = n x^{n-1}/\theta^n.
E[X(n)]=∫0θx⋅nxn−1/θn dx=nθn⋅θn+1n+1=nn+1θ\mathbb{E}[X_{(n)}] = \int_0^\theta x \cdot n x^{n-1}/\theta^n \, dx = \frac{n}{\theta^n} \cdot \frac{\theta^{n+1}}{n+1} = \frac{n}{n+1}\theta.
So Bias=nn+1θ−θ=−θn+1\text{Bias} = \frac{n}{n+1}\theta - \theta = -\frac{\theta}{n+1} (negatively biased).
Unbiased estimator: θ^unbiased=n+1nX(n)\hat{\theta}_{\text{unbiased}} = \frac{n+1}{n} X_{(n)}.

Document outline

Keep your place and jump directly to a heading.

Table of contents

No note selected

Open a chapter to see its outline, backlinks, and sources here.