Qm

Derive the MSE-optimal variance divisor

For nn independent normal draws, consider estimating the variance by σ^2=ci(XiXˉ)2=cSS\hat\sigma^2 = c\sum_i (X_i - \bar X)^2 = c\,\text{SS} for a constant cc.

Using E[SS]=(n1)σ2\mathbb{E}[\text{SS}] = (n-1)\sigma^2 and Var(SS)=2(n1)σ4\text{Var}(\text{SS}) = 2(n-1)\sigma^4, find the cc that minimizes MSE and show it corresponds to dividing by n+1n+1.

Your answer

Solving needs a free account

Answers, streaks and solutions unlock when you are signed in. Reading the question and the hint stays free.

Discussion

Sign in to join the discussion · reading is open to everyone

💡 Discussion rules

  1. No full solutions here. Hints and approaches only.
  2. Complexity, edge cases and intuition are the point.
  3. Interview experiences are welcome. Respect your NDAs.

Loading discussion…

Learn the concepts

The theory behind this question.

Related questions

Which divisor gives the lowest-error variance estimate?Best variance divisor for a five-point sampleThe error of the unbiased variance estimatorHow much does n+1 beat n-1 on variance-estimate error?Blend an unbiased noisy forecast with a biased sharp one
All questions →