NETMaths

Estimation

1. Sufficiency, completeness, UMVUE, Cramér–Rao

Exam focus: Factorisation gives sufficiency; Lehmann–Scheffé turns a complete sufficient statistic plus unbiasedness into the UMVUE. Cramér–Rao gives a bound that is often not attained.

Lec-12 Sufficiency

NPTEL · Statistical Inference

The factorisation theorem.

Lec-14 Minimal Sufficiency, Completeness

NPTEL · Statistical Inference

Lec-15 UMVU Estimation, Ancillarity

NPTEL · Statistical Inference

Rao–Blackwell and Lehmann–Scheffé — the UMVUE machine.

Lec-09 Lower Bounds for Variance - II

NPTEL · Statistical Inference

Cramér–Rao, including when the regularity conditions fail.

2. MLE and method of moments

Exam focus: MLE is invariant and asymptotically efficient but can be biased and need not be unique; moment estimators are easy but usually inefficient.

Lec-04 Finding Estimators - I

NPTEL · Statistical Inference

Method of moments and maximum likelihood side by side.

Lec-07 Properties of MLEs

NPTEL · Statistical Inference

Invariance, consistency, asymptotic normality — and the failures.

Lec-18 Bayes and Minimax Estimation - I

NPTEL · Statistical Inference

Bayes estimators; posterior mean under squared error loss.