aiqbench analysis
Cartan flow matching advances generative modeling by extending flow matching techniques to Riemannian symmetric spaces, leveraging Lie algebra structures to linearize interpolation on complex manifolds like Grassmannians. This approach eliminates the computational burden of constructing geodesic paths while maintaining theoretical rigor for applications in geometry-aware AI tasks. It represents a significant methodological shift for researchers working with non-Euclidean data distributions.
Cartan flow matching
arXiv:2605.03588v2 Announce Type: replace-cross Abstract: We introduce Cartan flow matching, a general framework for training flow matching models on Riemannian symmetric spaces, i.e. Riemannian manifolds with the property that at any point there exists a geodesic symmetry. This is a large class of manifolds that includes the sphere, hyperbolic space and Grassmannians. We exploit their algebraic structure to reformulate flow matching on symmetric spaces as flow matching on a subspace of the Lie algebra of their isometry group, thus linearizing the problem and avoiding the need to construct geodesic interpolation paths on the manifold. As an application, we showcase our framework on the real Grassmannians $ \operatorname{SO}(n) / \operatorname{SO}(k) \times \operatorname{SO}(n-k) $.
Abstract:We introduce Cartan flow matching, a general framework for training flow matching models on Riemannian symmetric spaces, i.e. Riemannian manifolds with the property that at any point there exists a geodesic symmetry. This is a large class of manifolds that includes the sphere, hyperbolic space and Grassmannians. We exploit their algebraic structure to reformulate flow matching on symmetric spaces as flow matching on a subspace of the Lie algebra of their isometry group, thus linearizing the problem and avoiding the need to construct geodesic interpolation paths on the manifold. As an application, we showcase our framework on the real Grassmannians $ \operatorname{SO}(n) / \operatorname{SO}(k) \times \operatorname{SO}(n-k) $.
Major revision. Fixed a mistake in section 4. 14 pages, 1 figure
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2605.03588 [cs.LG]
(or arXiv:2605.03588v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2605.03588 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 214 words
Related coverage
Topological Flow Matching
arXiv · Jun 16, 2026
Physics-Guided Flow Matching for CT Image Reconstruction
arXiv · Sep 1, 2026
Reinforcement Learning via Fixed-point Flow Matching
arXiv · Oct 12, 2026
Improving Function Space Flow Matching with Kernel Optimal Transport
arXiv · Sep 30, 2026