Riemannian MeanFlow for One-Step Generation on Manifolds

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Zhong, Zichen, Sun, Haoliang, Zhao, Yukun, Gong, Yongshun, Yin, Yilong
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916031590563840
author Zhong, Zichen
Sun, Haoliang
Zhao, Yukun
Gong, Yongshun
Yin, Yilong
author_facet Zhong, Zichen
Sun, Haoliang
Zhao, Yukun
Gong, Yongshun
Yin, Yilong
contents 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, SO(3), and SE(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
format Preprint
id arxiv_https___arxiv_org_abs_2603_10718
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Riemannian MeanFlow for One-Step Generation on Manifolds
Zhong, Zichen
Sun, Haoliang
Zhao, Yukun
Gong, Yongshun
Yin, Yilong
Machine Learning
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, SO(3), and SE(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
title Riemannian MeanFlow for One-Step Generation on Manifolds
topic Machine Learning
url https://arxiv.org/abs/2603.10718