Flow matching on homogeneous spaces

• URL: http://arxiv.org/abs/2603.24829v1
• Date: Wed, 25 Mar 2026 21:43:25 GMT
• Title: Flow matching on homogeneous spaces
• Abstract summary: We propose a general framework to extend Flow Matching to homogeneous spaces, i.e. quotients of Lie groups.<n>Our approach reformulates the problem as a flow matching task on the underlying Lie group by lifting the data distributions.
• Score: 0.228438857884398
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a general framework to extend Flow Matching to homogeneous spaces, i.e. quotients of Lie groups. Our approach reformulates the problem as a flow matching task on the underlying Lie group by lifting the data distributions. This strategy avoids the potentially complicated geometry of homogeneous spaces by working directly on Lie groups, which in turn enables us reduce the problem to a Euclidean flow matching task on Lie algebras. In contrast to Riemannian Flow Matching, our method eliminates the need to define and compute premetrics or geodesics, resulting in a simpler, faster, and fully intrinsic framework.

Related papers

• Topological Flow Matching [56.16372813551555]
  Flow matching is a powerful generative modeling framework, valued for its simplicity and strong empirical performance.<n>We introduce topological flow matching, a topology-aware generalization of flow matching.<n>We demonstrate its effectiveness on diverse structured datasets, including brain fMRIs, ocean currents, seismic events, and traffic flows.
  arXiv  Detail & Related papers  (2026-06-14T16:29:33Z)
• A Holistic Method for Superquadric Fitting Using Unsupervised Clustering Analysis [10.759776164959208]
  We present a novel method for fitting superquadrics to point clouds under the contamination of noise and outliers.<n>Our method redefines the problem from a new unsupervised clustering perspective.<n>We provide a theoretical certificate of convergence analysis and demonstrate that the clustering-inspired fitting method can escape local minima.
  arXiv  Detail & Related papers  (2026-05-16T03:20:33Z)
• Flow Matching on Symmetric Spaces [29.28717229244793]
  We reformulate flow matching on symmetric spaces as flow matching on a subspace of the Lie algebra of their isometry group.<n>As an application, we showcase our framework on the real Grassmannians.
  arXiv  Detail & Related papers  (2026-05-05T10:03:12Z)
• Schrödinger Bridge Over A Compact Connected Lie Group [0.13764085113103217]
  This work studies the Schrdinger bridge problem for the kinematic equation on a compact connected Lie group.<n>We develop a coordinate-free formulation of this optimal control problem that respects the underlying geometric structure of the Lie group.<n>Our results are constructive in that they derive a geometric controller that optimally interpolates probability densities supported over the Lie group.
  arXiv  Detail & Related papers  (2026-03-14T17:40:59Z)
• Riemannian Flow Matching for Disentangled Graph Domain Adaptation [51.98961391065951]
  Graph Domain Adaptation (GDA) typically uses adversarial learning to align graph embeddings in Euclidean space.<n>DisRFM is a geometry-aware GDA framework that unifies embedding and flow-based transport.
  arXiv  Detail & Related papers  (2026-01-31T11:05:35Z)
• Diffusion Generative Modeling on Lie Group Representations [6.1729008698381564]
  We introduce a class of score-based diffusion processes that operate directly in the representation space of Lie groups.<n>We prove that our generalized generative processes arise as solutions to a new class of paired differential equations (SDEs)<n>We show that an appropriate choice of Lie group enhances learning efficiency by reducing the effective dimensionality of the trajectory space transformations.
  arXiv  Detail & Related papers  (2025-02-04T17:32:17Z)
• Task Groupings Regularization: Data-Free Meta-Learning with Heterogeneous Pre-trained Models [83.02797560769285]
  Data-Free Meta-Learning (DFML) aims to derive knowledge from a collection of pre-trained models without accessing their original data.<n>Current methods often overlook the heterogeneity among pre-trained models, which leads to performance degradation due to task conflicts.
  arXiv  Detail & Related papers  (2024-05-26T13:11:55Z)
• Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein [56.62376364594194]
  Unsupervised learning aims to capture the underlying structure of potentially large and high-dimensional datasets.<n>In this work, we revisit these approaches under the lens of optimal transport and exhibit relationships with the Gromov-Wasserstein problem.<n>This unveils a new general framework, called distributional reduction, that recovers DR and clustering as special cases and allows addressing them jointly within a single optimization problem.
  arXiv  Detail & Related papers  (2024-02-03T19:00:19Z)
• Riemannian stochastic optimization methods avoid strict saddle points [68.80251170757647]
  We show that policies under study avoid strict saddle points / submanifolds with probability 1. This result provides an important sanity check as it shows that, almost always, the limit state of an algorithm can only be a local minimizer.
  arXiv  Detail & Related papers  (2023-11-04T11:12:24Z)
• Generalized Schrödinger Bridge Matching [54.171931505066]
  Generalized Schr"odinger Bridge (GSB) problem setup is prevalent in many scientific areas both within and without machine learning. We propose Generalized Schr"odinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances. We show that such a generalization can be cast as solving conditional optimal control, for which variational approximations can be used.
  arXiv  Detail & Related papers  (2023-10-03T17:42:11Z)
• The Dynamics of Riemannian Robbins-Monro Algorithms [101.29301565229265]
  We propose a family of Riemannian algorithms generalizing and extending the seminal approximation framework of Robbins and Monro. Compared to their Euclidean counterparts, Riemannian algorithms are much less understood due to lack of a global linear structure on the manifold. We provide a general template of almost sure convergence results that mirrors and extends the existing theory for Euclidean Robbins-Monro schemes.
  arXiv  Detail & Related papers  (2022-06-14T12:30:11Z)
• Decentralized Feature-Distributed Optimization for Generalized Linear Models [19.800898945436384]
  We consider the "all-for-one" decentralized learning problem for generalized linear models. The features of each sample are partitioned among several collaborating agents in a connected network, but only one agent observes the response variables. We apply the Chambolle--Pock primal--dual algorithm to an equivalent saddle-point formulation of the problem.
  arXiv  Detail & Related papers  (2021-10-28T16:42:47Z)
• LieTransformer: Equivariant self-attention for Lie Groups [49.9625160479096]
  Group equivariant neural networks are used as building blocks of group invariant neural networks. We extend the scope of the literature to self-attention, that is emerging as a prominent building block of deep learning models. We propose the LieTransformer, an architecture composed of LieSelfAttention layers that are equivariant to arbitrary Lie groups and their discrete subgroups.
  arXiv  Detail & Related papers  (2020-12-20T11:02:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.