Riemannian Gaussian Variational Flow Matching
- RG-VFM is a generative modeling framework that extends Variational Flow Matching to data on Riemannian manifolds using Riemannian Gaussian distributions.
- It leverages closed-form geodesic and log/exp maps to perform manifold-aware learning, enabling efficient endpoint prediction along geodesics.
- Empirical evaluations on spherical data demonstrate that RG-VFM better preserves geometric properties and checkerboard contrast compared to Euclidean methods.
Riemannian Gaussian Variational Flow Matching (RG-VFM) is a generative modeling framework that extends the principle of Variational Flow Matching (VFM) to data residing on Riemannian manifolds. It achieves this by utilizing Riemannian Gaussian distributions as variational families and matching endpoint predictions along geodesics in spaces where the geometric structure is non-Euclidean. RG-VFM is designed for manifolds with closed-form geodesic and log/exp map computations—exemplified by spheres, hyperbolic spaces, and flat tori—allowing manifold-aware learning while maintaining computational tractability (Zaghen et al., 18 Feb 2025).
1. Riemannian Gaussian Distributions
Given a complete Riemannian manifold with metric , geodesic distance , and volume form , the Riemannian Gaussian (RG) centered at with scale is defined as
where the normalizing constant
ensures unit mass. In Euclidean space, this recovers the standard isotropic Gaussian. If is homogeneous, is independent of 0. This property is essential for parameterizing densities and performing variational inference on structured manifolds (Zaghen et al., 18 Feb 2025).
2. RG-VFM: Variational Objective and Training
RG-VFM generalizes Euclidean VFM to manifolds by introducing joint densities 1, interpolating between a base 2 and a target 3. The variational flow matching objective is
4
with the variational posterior
5
where 6 is the predicted geodesic endpoint.
Assuming (a) 7 is homogeneous and (b) closed-form geodesics are available, the RG-VFM loss reduces (up to an additive constant, absorbing 8) to
9
where 0 denotes the Riemannian logarithm map at 1 and 2 is the norm induced by the metric on the tangent space (Zaghen et al., 18 Feb 2025).
RG-VFM recovers the underlying velocity field 3 for the Riemannian continuity equation
4
by averaging the conditional geodesic velocities: 5 connecting endpoint-based training to continuous-time flows over 6.
3. Comparison with Riemannian Flow Matching (RFM)
In contrast to RG-VFM, Riemannian Flow Matching (RFM) learns a vector field directly on 7 by minimizing
8
Key differences include:
- Objective: RFM matches instantaneous velocity fields at each 9, whereas RG-VFM matches predicted endpoints.
- Parameterization: RG-VFM is variational: it learns the geodesic endpoint 0 (and optionally the scale 1), reconstructing the velocity field indirectly.
- Geometric requirements: Both methods utilize geodesic log maps. RG-VFM requires these only at predicted endpoints, while RFM requires them at all training points.
- Support of base distribution: RG-VFM can leverage a base 2 in 3 (yielding the RG-VFM4 variant) with linear off-manifold interpolation. RFM requires 5 to be supported on 6 and geodesic-based interpolation throughout [(Zaghen et al., 18 Feb 2025), Chen & Lipman 2024].
4. Manifolds, Metrics, and Geodesics in Practice
RG-VFM is applicable to homogeneous manifolds with computable closed-form geodesics and log/exp maps, such as:
| Manifold | Geodesic Distance | Logarithm Map |
|---|---|---|
| Sphere 7 | 8 | 9 |
| Hyperbolic space 0 (Poincaré ball) | 1 | Closed form via Möbius transforms |
| Flat torus 2 | Modulo Euclidean norm | Standard log map mod 3 |
The explicit availability of exponential and logarithm maps in these geometries underpins both training and generative sampling (Zaghen et al., 18 Feb 2025).
5. Training and Sampling Procedures
Training follows a stochastic gradient approach:
- Sample 4.
- Sample 5 (the target).
- Interpolate:
- If 6: 7 via uniform geodesic interpolation, 8, with 9.
- If 0: 1.
- Compute Loss: 2.
- Update: 3.
Sampling from the learned model proceeds by solving the ODE: 4 with any suitable ODE solver (e.g., RK4), yielding samples 5 (Zaghen et al., 18 Feb 2025).
6. Empirical Evaluation: Spherical Checkerboard
In the checkerboard experiment, data are embedded on 6 via: 7 The following methods are compared:
- CFM (Conditional Flow Matching)
- VFM (Euclidean)
- RFM (Riemannian)
- RG-VFM8
- RG-VFM9
Evaluation metrics:
- Norm deviation: 0 deviation from 1 (ideal on 1).
- Visual quality: Checker patch concentration.
Key results:
- Euclidean methods yield points off 2 (standard deviation of 3).
- Geometric methods maintain 4 (std 5).
- Variational methods (VFM and RG-VFM) better preserve checker contrast than CFM/RFM.
- RG-VFM6 and RG-VFM7 achieve the closest qualitative match to the geometric checkerboard target (Zaghen et al., 18 Feb 2025).
7. Limitations and Open Problems
Several constraints shape the current scope and challenge potential extensions:
- Applicability is restricted to homogeneous manifolds with closed-form log/exp maps; general learned manifolds are excluded.
- Constant normalizer and fixed scale parameter 8 are assumed; extending to nonhomogeneous or anisotropic Gaussians is nontrivial.
- Off-manifold sampling in RG-VFM9 via Euclidean linear interpolation may behave unpredictably on high-curvature manifolds.
- Extension to manifolds with boundaries, singularities, or non-global geodesics is an open question.
- Non-Gaussian variational families (e.g., von Mises–Fisher on spheres) may further improve modeling on compact manifolds.
Further developments may involve addressing these limitations, especially integration with flexible non-Gaussian families and arbitrary manifold topologies (Zaghen et al., 18 Feb 2025).