Riemannian MeanFlow for One-Step Generation on Manifolds

Zichen Zhong, Haoliang Sun, Yukun Zhao, Yongshun Gong, Yilong Yin
3/11/2026
cs.LG

No official code found. Best implementation: haolsun/Riemannian_MeanFlow (3 stars, last commit 2026-05-01).

Abstract

Flow Matching enables simulation-free training of generative models on Riemannian manifolds, yet sampling typically still relies on numerically integrating a probability-flow ODE. We propose Riemannian MeanFlow (RMF), extending MeanFlow to manifold-valued generation where velocities lie in location-dependent tangent spaces. RMF defines an average-velocity field via parallel transport and derives a Riemannian MeanFlow identity that links average and instantaneous velocities for intrinsic supervision. We make this identity practical in a log-map tangent representation, avoiding trajectory simulation and heavy geometric computations. For stable optimization, we decompose the RMF objective into two terms and apply conflict-aware multi-task learning to mitigate gradient interference. RMF also supports conditional generation via classifier-free guidance. Experiments on spheres, tori, and SO(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.

View on arXivView PDF

Code Implementations(1)

Accepted ICML 2026 Paper: “Riemannian MeanFlow for One-Step Generation on Manifolds”

30PythonMay 1, 20265 months ago

Similar Papers

Cite this paper

@article{zhong2026riemannian,
  title  = {Riemannian MeanFlow for One-Step Generation on Manifolds},
  author = {Zichen Zhong and Haoliang Sun and Yukun Zhao and Yongshun Gong and Yilong Yin},
  year   = {2026},
  eprint = {2603.10718},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.10718v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.10718.svg)](https://codeofpaper.com/paper/2603.10718)

Discussion