Weak Information Geometry: Riemannian Structures from Distributional Inference Functions and Stein Discrepancies
arXiv:2607.11246
2026
Optimization
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper replaces the Fisher metric, which requires a differentiable dominated likelihood, with a family of instrument-dependent Godambe metrics. The transferable asset is the explicit construction G(\theta)=S(\theta)^{\top}V(\theta)^{-1}S(\theta): sensitivity of chosen observables is weighted by their inverse variability, so unstable or redundant directions are automatically downweighted. This suggests a geometry-aware optimizer or adapter that preconditions neural-network updates using task-relevant probes rather than the full score-function Fisher matrix. The construction is especially attractive for heavy-tailed, implicit, or distribution-shifted data where likelihood-based natural-gradient methods are unavailable or poorly conditioned.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Build a low-dimensional neural-network geometry from trainable observables or probes instead of estimating the full Fisher matrix. Precondition the parameter gradient by the inverse variability of the probes and their parameter sensitivity, producing a task-adapted update that can remain usable for implicit models, heavy-tailed data, and parameter-dependent-support distributions.
Useful7/10
Difficulty6/10
Novelty6/10