The Blackwell-Rao Theorem
summary
The Rao‑Blackwell theorem claims that replacing an estimator by its conditional expectation given a sufficient statistic strictly lowers mean‑square error (and any convex loss); proof uses Fisher‑Neyman factorization, Jensen and the law of total expectation. Example: for Bernoulli T = sum xi the MLE S/n is biased, S/(n−1) unbiased, and S/(n+1) attains smaller MSE. Application: perturb sufficient statistics (e.g. the X'X matrix) for differential privacy — noise matters for small n but vanishes as sample size grows.
AI-written summary · about
