Total Variation Rates for Riemannian Flow Matching

Riemannian flow matching (RFM) extends flow-based generative modeling to data supported on manifolds by learning a time-dependent tangent vector field whose flow-ODE transports a simple base distribution to the data law. We develop a nonasymptotic Total Variation (TV) convergence analysis for RFM samplers that use a learned vector field together with Euler discretization on manifolds. Our key technical ingredient is a differential inequality governing the evolution of TV between two manifold ODE flows, which expresses the time-derivative of TV through the divergence of the vector-field mismatch and the score of the reference flow; controlling these terms requires establishing new bounds that explicitly account for parallel transport and curvature. Under smoothness assumptions on the population and learned flow-matching field, together with mean-square approximation guarantees for the learned field, we obtain explicit bounds of the form $\mathrm{TV}\le C_{\mathrm{Lip}}h+C_{\epsilon }\epsilon$, cleanly separating numerical discretization and learning errors. Here, $h$ is the step-size and $\epsilon$ is the target accuracy. Instantiations yield explicit polynomial iteration complexities on the hypersphere $S^d$, and on the Hadamard manifolds (for e.g., SPD manifolds) under mild moment conditions.