Ask what should change under a concrete input, then trace that expectation through the equation.
Foundation Lab
Fisher Information & Information Geometry
Fisher gives the natural metric on probability distributions—not Euclidean distance in parameters
Selected Foundation Object
Keep the equation fixed; move through the evidence.
Distance in parameter space should mean "distinguishability of distributions"—Fisher captures this
Use the key equation and canonical papers as the available witnesses, without implying that a runnable panel exists.
The useful learning product is the reusable mechanism you can carry into another model, paper, or engineering tradeoff.
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.
The Fisher Information Matrix measures how distinguishable distributions are:
Equivalently (under regularity):
KL as local metric: For small parameter changes: