Fisher–Rao Path Length Overview
- Fisher–Rao Path Length is defined as the intrinsic Riemannian distance between probability distributions, quantifying the minimal statistical path using the Fisher information metric.
- It offers both closed-form and numerical methods for computing geodesics and distances across various models including discrete, exponential, and Gaussian families.
- The metric underpins applications in information geometry and statistical mechanics, aiding in entropy minimization and efficient state transport.
The Fisher–Rao path length is the intrinsic Riemannian length between probability measures or statistical models, induced by the Fisher information metric on the space of densities, probability vectors, or parametric distributions. This length quantifies the minimal “statistical distance” required to traverse a smooth path between two distributions and underpins statistical geometry, information theory, and related fields. The Fisher–Rao metric gives rise to a rich geometric structure on the space of probability measures, with explicit analytic, variational, and dynamical representations, supporting both closed-form and numerical evaluation in various settings.
1. Fisher–Rao Metric on Probability Spaces
The Fisher–Rao metric is defined as the Riemannian metric on the manifold of probability measures or densities. For a strictly positive density on a (possibly infinite-dimensional) domain ,
where are tangent vectors, typically (for the statistical manifold of densities) functions satisfying (Chizat et al., 2015, Bauer et al., 2023, Diósi, 5 Oct 2024).
On the probability simplex of discrete distributions , the Fisher–Rao metric has ambient form
with the constraint enforced on the tangent space (Zhang, 6 Aug 2025).
For parametric statistical models , the Fisher information matrix defines the Fisher–Rao metric: (Mielke, 2 Oct 2025, Nielsen, 15 Mar 2024).
2. Path Length and Geodesic Formulation
Given a curve of distributions , the Fisher–Rao path length over is
(Chizat et al., 2015, Bauer et al., 2023). For parametric models, the length functional becomes
and geodesics are the solution to the Euler–Lagrange equations
where are the Christoffel symbols of the Fisher–Rao metric (Mielke, 2 Oct 2025, Bauer et al., 2023, Nielsen, 15 Mar 2024).
On spherical or simplex models, this leads to geodesics corresponding to constant-speed curves on the sphere; on hyperbolic or exponential-family models, geodesics are related to constant-speed curves in the Poincaré plane or related symmetric spaces (Miyamoto et al., 2023).
3. Closed-Form Geodesics and Distance Formulae
In several prominent cases, the Fisher–Rao geodesic and its length can be given in closed-form. On the space of smooth probability densities on a manifold , the “square-root” mapping embeds the space isometrically onto the unit sphere in : with the unique constant-speed geodesic (Bauer et al., 2023, Chizat et al., 2015). Analogous forms apply on the probability simplex, yielding
(Miyamoto et al., 2023, Zhang, 6 Aug 2025).
For exponential families or scale/location models, the Fisher–Rao path length reduces to classic hyperbolic metrics: for Fisher metric coefficients , which specialize for normal, Laplace, logistic, and Student- families (Miyamoto et al., 2023, Mielke, 2 Oct 2025).
On the manifold of zero-mean Gaussian covariances , the geodesic and distance are
(Wells et al., 2020), see also (Bauer et al., 2023, Nielsen, 2023, Nielsen, 2023).
4. Dynamic and Variational Characterizations
The path length in Fisher–Rao geometry admits variational and dynamic formulations distinct from optimal transport metrics, notably through the “growth equation”: subject to prescribed, and the length given by
(Mielke, 2 Oct 2025). For curves between densities , the Fisher–Rao geodesic is always the geometric mixture
and the constant FR-speed along this curve yields a length proportional to , matching the closed-form solution (Maurais et al., 8 Jan 2024).
5. Computational Methods and Approximations
For nontrivial models without analytic geodesics, the Fisher–Rao path length must be computed numerically. Techniques include piecewise approximation using small-step geodesic distances (locally approximated by the square root of the Jeffreys divergence), shortest-path “Fisher–Manhattan” upper bounds, Calvo–Oller isometric embeddings into higher-dimensional symmetric positive-definite cones, and adaptive subdivisions for multiplicative error guarantees (Nielsen, 2023, Nielsen, 2023, Nielsen, 15 Mar 2024).
In Gaussian and elliptical families, precise lower and upper bounds are derived from SPD-geometry and Birkhoff/Hilbert projective distances, enabling efficient and certified computation even in moderate dimensions (Nielsen, 15 Mar 2024, Nielsen, 2023). The adaptive midpoint-refinement algorithm achieves -factor approximation in time for Gaussians (Nielsen, 2023).
6. Applications and Operational Interpretations
The Fisher–Rao path length quantifies minimal entropy production in near-reversible state transport: in both quantum and classical statistical mechanics, the geodesic length yields the sharp lower bound on total entropy generated when moving a system by infinitesimal sequential equilibrations (Diósi, 5 Oct 2024). The Bhattacharyya (Hellinger) fidelity between initial and final states encodes this irreversibility cost, with the statistical length given by
where is the Bhattacharyya coefficient (Diósi, 5 Oct 2024, Zhang, 6 Aug 2025).
In masked discrete diffusion models, the Fisher–Rao geodesic coincides with the “cosine schedule,” exemplifying the geometric principle that the time-dependent masking parameter traverses the probability path at constant FR speed—minimizing path length in the metric (Zhang, 6 Aug 2025).
Applications include statistical signal discrimination, information geometry in clustering and model selection, Wasserstein–Fisher–Rao interpolations in computational imaging, and sample-efficient gradient flows in variational inference and particle methods (Florin, 20 May 2025, Chizat et al., 2015, Marti et al., 2016, Maurais et al., 8 Jan 2024).
7. Notable Families and Unification
Closed-form Fisher–Rao path lengths are available for a wide class of models, summarized in the following table (see (Miyamoto et al., 2023, Mielke, 2 Oct 2025)): | Model Family | Fisher–Rao Distance Formula | Reference | |-----------------------------|--------------------------------------------------------------------------------|---------------| | Discrete simplex, | | (Miyamoto et al., 2023) | | Exponential, | | (Mielke, 2 Oct 2025) | | Poisson, | | (Miyamoto et al., 2023) | | Gaussian, univariate, | $2\sqrt{2}\arctanh\sqrt{ \frac{ (\mu_2-\mu_1)^2 + 2 (\sigma_2-\sigma_1)^2 }{ (\mu_2-\mu_1)^2 + 2 (\sigma_2+\sigma_1)^2 } }$ | (Miyamoto et al., 2023) | | Zero-mean MVN, | (eigenvalues of ) | (Wells et al., 2020) |
This unification across models highlights the pivotal role of the Fisher–Rao statistical length as the Riemannian geodesic distance in information geometry. Complex cases may require numerical approximation, but for one- and two-parameter models, closed forms are prevalent (Miyamoto et al., 2023, Nielsen, 15 Mar 2024).
In summary, the Fisher–Rao path length provides a canonical notion of statistical distance with deep geometric, variational, and operational significance, with tractable and explicit models at the core of statistical manifold theory (Chizat et al., 2015, Bauer et al., 2023, Mielke, 2 Oct 2025, Diósi, 5 Oct 2024, Miyamoto et al., 2023, Nielsen, 15 Mar 2024).