~/talk

The Blackwell-Rao Theorem

links:none on file
slides:none on file

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

  1. 0:00Introduction
  2. 0:45BlackwellRao Theorem
  3. 3:55BlackwellRao PhD
  4. 9:38Motivation
  5. 22:39Black Hole Theorem
  6. 27:26Application
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.