Quick reminder of the three "scorecards" we test against, all defined on the parent page:
Here θ^ is our guessing rule (a random variable), θ is the true unknown number, E[⋅] means "average over all possible samples", and Var(⋅) means "how much the guess wobbles sample to sample".
The picture above is the mental model for the whole page: a dartboard. Bias = how far the cloud's centre sits from the bullseye. Variance = how spread out the cloud is. MSE = average squared distance of a dart from the bullseye — it feels both.
The estimator is the rule/random variable Xˉ=n1∑Xi — it exists before you see data and has a whole distribution.
The estimate is the single number 12.4 — the output after plugging real data in.
Analogy: the estimator is the recipe; the estimate is the cake you baked today.
Recall Solution L1.2
Bias =E[θ^]−θ=n3. Since this is not zero for finite n, the estimator is biased.
But n3→0 as n→∞, so it is asymptotically unbiased — the systematic error shrinks with more data.
By linearity of expectation (it passes through sums and constants):
E[μ^]=0.3E[X1]+0.7E[X2]=0.3μ+0.7μ=(0.3+0.7)μ=μ.
Unbiased ✓ — because the weights sum to 1. That is the whole rule for a weighted average of same-mean variables.
Recall Solution L2.2
Var(Xˉ)=nσ2=25100=4,standard error=4=2.
Notice: quadruple n and the standard error only halves — the n law of diminishing returns. (See Law of Large Numbers for why Var(Xˉ)→0.)
Recall Solution L2.3
Mean Xˉ=32+4+6=4. Squared deviations: (2−4)2=4, (4−4)2=0, (6−4)2=4; sum =8.
s2=n−18=28=4,σ^2=n8=38≈2.667.
The biased one is smaller — exactly the "shrink" the n−1 correction undoes.
For independent variables, Var(∑wiXi)=∑wi2σ2.
Var(μ^A)=(4⋅161)σ2=41σ2=0.25σ2.Var(μ^B)=(41+3⋅361)σ2=(41+121)σ2=31σ2≈0.333σ2.
Since 0.25<0.333, μ^A is more efficient. Relative efficiency of A to B:
Var(μ^A)Var(μ^B)=1/41/3=34≈1.333.Lesson: for equal-variance data, equal weights (1/n each) minimise variance — that's why Xˉ is the winner.
Recall Solution L3.2
Using MSE=Var+Bias2:
MSE1=5+22=9,MSE2=8+0=8.
The unbiased rival wins here (8<9) — but note the biased one could have won if its variance were low enough. This is the Bias–Variance Tradeoff in one line: a little bias is worth it only if it buys enough variance reduction.
Recall Solution L3.3
MSE(θ^n)=n9+(n4)2=n9+n216n→∞0.
Since MSE→0, by the sufficient condition (Chebyshev) θ^nPθ: consistent. Both the wobble and the off-centre part vanish.
Unbiased:E[X1]=μ. ✓
Consistency check via variance:Var(μ^)=Var(X1)=σ2 for everyn — it never shrinks. The estimate wobbles by σ2 no matter how much data you collect, because you throw all the extra data away.
So MSE=σ2→0, and P(∣X1−μ∣>ε) stays fixed. Not consistent.
This proves unbiased ⇒ consistent: they measure different things.
Recall Solution L4.2
(a) Bias(M)=E[M]−θ=n+1nθ−θ=−n+11θ. It always underestimates — the sample max can never exceed the true ceiling θ.
(b) Multiply by the reciprocal of the shrink factor: θ^unb=nn+1M. Then E[nn+1M]=nn+1⋅n+1nθ=θ. ✓
(c) For n=4: factor =nn+1=45=1.25.
Recall Solution L4.3
Var(Xˉ)Var(median)=σ2/n2πσ2/n=2π≈1.571.
The mean is more efficient by a factor of π/2≈1.571: the median wastes about 36% of the information (it only reaches ≈64% efficiency, since 2/π≈0.637). For Normal data the mean is the efficient choice; the median only pays off when tails are heavy.
Minimise Var(μ^)=σ2∑wi2 subject to ∑wi=1.
Why squares again? Independence ⇒ variance adds the wi2. Minimising ∑wi2 under a fixed sum is a classic:
Write wi=n1+di with ∑di=0 (deviations from equal weights). Then
∑wi2=∑(n1+di)2=∑n21+n2=0∑di+∑di2=n1+∑di2.
Since ∑di2≥0 with equality iff every di=0, the minimum is at wi=n1. ∎
Minimum variance =σ2/n — the value Xˉ achieves. Any deviation from equal weights strictly increases variance.
Recall Solution L5.2
(a) For n i.i.d. points the information adds: In(λ)=nI1(λ)=λn. So
Var(λ^)≥In(λ)1=nλ.
(b) For Poisson, Var(Xi)=λ, hence Var(Xˉ)=nλ. This equals the bound, and Xˉ is unbiased (E[Xˉ]=λ). Therefore Xˉ is the efficient (variance-attaining) estimator of λ. ∎
Sanity of I1=1/λ:lnf=−λ+xlnλ−lnx!, so ∂λlnf=−1+x/λ; its variance is Var(x)/λ2=λ/λ2=1/λ. ✓
Recall Solution L5.3
E[θ^c]=cθ, so Bias=cθ−θ=(c−1)θ, and Var(θ^c)=c2v.
MSE(c)=c2v+(c−1)2θ2.
Differentiate and set to 0: dcd=2cv+2(c−1)θ2=0⇒c(v+θ2)=θ2, so
c⋆=θ2+vθ2<1.Why less than 1? A touch of shrinkage trades a little bias for a bigger cut in variance — the Bias–Variance Tradeoff made quantitative. Example: θ2=4, v=1 gives c⋆=4/5=0.8, and MSE(0.8)=0.82⋅1+(0.8−1)2⋅4=0.64+0.16=0.8<v=1. The unbiased choice c=1 gives MSE =1, so shrinkage strictly wins.
Recall One-line summary of the ladder
Recognition of terms ::: L1 — estimator vs estimate, spotting bias.
Plugging into formulas ::: L2 — Var(Xˉ)=σ2/n, s2 with n−1.
Comparing and decomposing ::: L3 — relative efficiency, MSE = Var + Bias2.
Combining ideas ::: L4 — unbiased = consistent, unbiasing the Uniform max.
Proving and designing ::: L5 — optimal weights, Cramér–Rao attainment, MSE-optimal shrinkage.