Foundation Lab

Fisher Information & Information Geometry

Fisher gives the natural metric on probability distributions—not Euclidean distance in parameters

Concept 55 of 100TheoryPhase 10
#55Fisher InfoTheory
key equation
Fij(θ)=E[∂ilog⁡pθ⋅∂jlog⁡pθ]F_{ij}(\theta) = \mathbb{E}\left[\partial_i \log p_\theta \cdot \partial_j \log p_\theta\right]
Reading map and next steps

Selected Foundation Object

Keep the equation fixed; move through the evidence.

Concept 55 of 100Fisher InfoTheory / Phase 10: Mathematical foundations & information geometry
Current question

Distance in parameter space should mean "distinguishability of distributions"—Fisher captures this

Fij(θ)=E[∂ilog⁡pθ⋅∂jlog⁡pθ]F_{ij}(\theta) = \mathbb{E}\left[\partial_i \log p_\theta \cdot \partial_j \log p_\theta\right]
PredictionCommit before tracing the equation.

Ask what should change under a concrete input, then trace that expectation through the equation.

EvidenceCompare the equation and source.

Use the key equation and canonical papers as the available witnesses, without implying that a runnable panel exists.

InvariantName what survives notation changes.

The useful learning product is the reusable mechanism you can carry into another model, paper, or engineering tradeoff.

Next moveContinue through the atlas.

Use prerequisites, dependents, and semantic links to repair the next gap without leaving the object behind.

Why It Matters for Modern Models

  • Fisher gives the natural metric on probability distributions—not Euclidean distance in parameters
  • Explains why KL penalties in RLHF/PPO are geometric constraints, not arbitrary regularization
  • Connects curvature to uncertainty: high Fisher = parameters are well-identified

What Tutorials Skip

What is still poorly explained in textbooks and papers:

  • Distance in parameter space should mean "distinguishability of distributions"—Fisher captures this
  • The Cramér-Rao bound: variance of any estimator ≥ 1/Fisher—more info = tighter estimates
  • Fisher is the Hessian of KL at θ=θ₀, making it a second-order object without needing the loss Hessian

Visualization Status

Core Math (Optional Deep Dive)

If you want intuition first, start with the key equation and cited sources. Come back here for the full walkthrough.

Key Equation
Fij(θ)=E[∂ilog⁡pθ⋅∂jlog⁡pθ]F_{ij}(\theta) = \mathbb{E}\left[\partial_i \log p_\theta \cdot \partial_j \log p_\theta\right]

The Fisher Information Matrix measures how distinguishable distributions are:

Fij(θ)=Ex∼pθ[∂log⁡pθ(x)∂θi∂log⁡pθ(x)∂θj]F_{ij}(\theta) = \mathbb{E}_{x \sim p_\theta}\left[\frac{\partial \log p_\theta(x)}{\partial \theta_i} \frac{\partial \log p_\theta(x)}{\partial \theta_j}\right]

Equivalently (under regularity):

Fij(θ)=−Ex∼pθ[∂2log⁡pθ(x)∂θi∂θj]F_{ij}(\theta) = -\mathbb{E}_{x \sim p_\theta}\left[\frac{\partial^2 \log p_\theta(x)}{\partial \theta_i \partial \theta_j}\right]

KL as local metric: For small parameter changes:

KL(pθ∥pθ+dθ)≈12dθ⊤F(θ)dθ\text{KL}(p_\theta \| p_{\theta + d\theta}) \approx \frac{1}{2} d\theta^\top F(\theta) d\theta

Canonical Papers

Information Geometry and Its Applications

Amari2016Springer
Read paper →

Natural Gradient Works Efficiently in Learning

Amari1998Neural Computation
Read paper →

Connections

Next Moves

Choose the next question to carry this object forward.