Score function, Fisher Information, Cramer-Rao Lower Bound and Efficiency¶
Score Function¶
Definition
The score function is the derivative of the log-likelihood \(\ell'(\theta)\).
Fisher Information¶
The fisher information, denoted as \(I(\theta)\) is the variance of the score.
Derivation of Fisher
Start with the fact that any density integrates to 1
Take the derivative of both sides
Notice that \(\frac{d}{dx}\ell(\theta) = \frac{d}{dx}\log p(x|\theta) = \frac{p'(x|\theta)}{p(x|\theta)}\), so we have that
We'll take the derivative of both sides again
Which is what we set as our fisher info.
Intuition of Fisher Information
On average the score is zero - this is the slope of the likelihood function at the true value \(\theta\). The FI measures the average curvature of the likelihood function at the true parameter value. If this function is really curved at \(\theta\), then it is easier to distinguish the maximum of the likelihood, thus there is more "information".
Cramer-Rao Lower Bound¶
Mean Squared Error
\(MSE = \mathbb{E}_{\theta}[(\hat{\theta}(X_{1}, \dots, X_{n}) - \theta)^{2}]\).
The MSE can be decomposed into variance + squared-bias. We want estimators that are optimal in the sense of minimizing the MSE. If we have an unbiased estimator, minimizing MSE is equivalent to minimizing variance.
Thus, we have a term called the Minimum Variance Unbiased Estimator, which is the best estimator in terms of the MSE within the class of unbiased estimators.
Cramer-Rao Lower Bound
If I have an unbiased estimator \(\hat{\theta}(X_{1}, \dots, X_{n})\) for \(g(\theta)\). That is, \(\mathbb{E}[\hat{\theta}] = g(\theta)\), then
where \(I(\theta)\) is the Fisher Info for a single observation.
An unbiased estimator is said to be efficient if it attains the CR lower bound.