The Fisher Information That Knows Its Own Curvature
Let be a one-parameter family of distributions with score function .
The Fisher information is defined as .
Prove the following elegant identity:
That is, Fisher information equals the negative expected curvature of the log-likelihood.
Assume all regularity conditions hold so that differentiation and integration can be exchanged freely.
After proving the identity, explain intuitively: why does more curvature (sharper log-likelihood) mean more information about ?
Answer: Fisher Information Curvature Identity
Key Idea / Intuition
The identity comes from differentiating the constraint twice with respect to . The first derivative gives the well-known fact that the score has mean zero; the second derivative reveals that the variance of the score (Fisher information) equals the negative expected second derivative of the log-likelihood. Intuitively, a sharper (more curved) log-likelihood means the data can pin down more precisely — the peak is narrower, so small changes in cause large changes in probability, meaning the data carries more information.
Formal Proof / Solution
Step 1: The score has mean zero.
Start from the normalisation identity:
Differentiate both sides with respect to :
Write , so: \mathbb{E}_\theta[s(\theta)] = \int s(\theta)\, p_\theta(x)\,dx = 0. \tag{1}
Step 2: Differentiate the score-mean equation.
Differentiate (1) again with respect to :
Apply the product rule inside the integral:
The first integral is .
For the second integral, substitute :
Step 3: Combine.
Putting it together:
Intuitive explanation of the curvature interpretation:
Think of the log-likelihood as a landscape with a peak near the true . The second derivative measures how sharply the log-likelihood curves downward at the peak:
- If is steeply curved (large negative second derivative), the peak is narrow: even a small deviation in produces a very different log-probability. The data strongly discriminates between nearby parameter values → high Fisher information.
- If is flat (small second derivative), many values of explain the data almost equally well → the data is uninformative about → low Fisher information.
This is precisely what the Cramér–Rao bound captures: , so high information forces low variance for any unbiased estimator.
Source: The Elements of Statistical Learning (Hastie, Tibshirani, Friedman), standard statistical theory