🧮 Brain Teaser

The Fisher Information That Knows Its Own Curvature

Let X∼pθ(x)X \sim p_\theta(x) be a one-parameter family of distributions with score function s(θ)=∂∂θlog⁡pθ(X)s(\theta) = \frac{\partial}{\partial \theta} \log p_\theta(X).

The Fisher information is defined as I(θ)=Eθ[s(θ)2]I(\theta) = \mathbb{E}_\theta[s(\theta)^2].

Prove the following elegant identity:

I(θ)=−Eθ ⁣[∂2∂θ2log⁡pθ(X)]I(\theta) = -\mathbb{E}_\theta\!\left[\frac{\partial^2}{\partial \theta^2} \log p_\theta(X)\right]

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 θ\theta?

Fisher informationscore functionlog-likelihoodCramér-Raostatistics

Answer: Fisher Information Curvature Identity

Key Idea / Intuition

The identity comes from differentiating the constraint ∫pθ(x) dx=1\int p_\theta(x)\,dx = 1 twice with respect to θ\theta. 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 θ\theta more precisely — the peak is narrower, so small changes in θ\theta 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: ∫pθ(x) dx=1.\int p_\theta(x)\,dx = 1.

Differentiate both sides with respect to θ\theta: ∂∂θ∫pθ(x) dx=∫∂pθ(x)∂θ dx=0.\frac{\partial}{\partial\theta}\int p_\theta(x)\,dx = \int \frac{\partial p_\theta(x)}{\partial\theta}\,dx = 0.

Write ∂pθ∂θ=pθ⋅∂log⁡pθ∂θ=pθ⋅s(θ)\frac{\partial p_\theta}{\partial\theta} = p_\theta \cdot \frac{\partial \log p_\theta}{\partial\theta} = p_\theta \cdot s(\theta), 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 θ\theta: ∂∂θ∫∂log⁡pθ∂θ pθ(x) dx=0.\frac{\partial}{\partial\theta}\int \frac{\partial \log p_\theta}{\partial\theta}\, p_\theta(x)\,dx = 0.

Apply the product rule inside the integral: ∫∂2log⁡pθ∂θ2 pθ dx+∫∂log⁡pθ∂θ⋅∂pθ∂θ dx=0.\int \frac{\partial^2 \log p_\theta}{\partial\theta^2}\, p_\theta\,dx + \int \frac{\partial \log p_\theta}{\partial\theta}\cdot\frac{\partial p_\theta}{\partial\theta}\,dx = 0.

The first integral is Eθ ⁣[∂2log⁡pθ∂θ2]\mathbb{E}_\theta\!\left[\frac{\partial^2 \log p_\theta}{\partial\theta^2}\right].

For the second integral, substitute ∂pθ∂θ=pθ⋅s(θ)\frac{\partial p_\theta}{\partial\theta} = p_\theta\cdot s(\theta): ∫(∂log⁡pθ∂θ)2pθ dx=Eθ[s(θ)2]=I(θ).\int \left(\frac{\partial \log p_\theta}{\partial\theta}\right)^2 p_\theta\,dx = \mathbb{E}_\theta[s(\theta)^2] = I(\theta).

Step 3: Combine.

Putting it together: Eθ ⁣[∂2log⁡pθ∂θ2]+I(θ)=0,\mathbb{E}_\theta\!\left[\frac{\partial^2 \log p_\theta}{\partial\theta^2}\right] + I(\theta) = 0,

I(θ)=−Eθ ⁣[∂2log⁡pθ∂θ2].\boxed{I(\theta) = -\mathbb{E}_\theta\!\left[\frac{\partial^2 \log p_\theta}{\partial\theta^2}\right].}


Intuitive explanation of the curvature interpretation:

Think of the log-likelihood ℓ(θ;X)=log⁡pθ(X)\ell(\theta; X) = \log p_\theta(X) as a landscape with a peak near the true θ\theta. The second derivative measures how sharply the log-likelihood curves downward at the peak:

  • If ℓ(θ)\ell(\theta) is steeply curved (large negative second derivative), the peak is narrow: even a small deviation in θ\theta produces a very different log-probability. The data strongly discriminates between nearby parameter values → high Fisher information.
  • If ℓ(θ)\ell(\theta) is flat (small second derivative), many values of θ\theta explain the data almost equally well → the data is uninformative about θ\theta → low Fisher information.

This is precisely what the Cramér–Rao bound captures: Var(θ^)≥1/I(θ)\mathrm{Var}(\hat\theta) \geq 1/I(\theta), so high information forces low variance for any unbiased estimator.

Source: The Elements of Statistical Learning (Hastie, Tibshirani, Friedman), standard statistical theory

Type: ML/StatsSource: The Elements of Statistical Learning (Hastie, Tibshirani, Friedman), standard statistical theoryEdit on GitHub ↗