Related papers: Flow matching on homogeneous spaces
Generalized Lagrangian mean theories are used to analyze the interactions between mean flows and fluctuations, where the decomposition is based on a Lagrangian description of the flow. A systematic geometric framework was recently developed…
We establish kinetic Hamiltonian flows in density space embedded with the $L^2$-Wasserstein metric tensor. We derive the Euler-Lagrange equation in density space, which introduces the associated Hamiltonian flows. We demonstrate that many…
We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be represented as a sparse combination of gradient and curl…
Embodied trajectories, such as the executable motion sequences of robotic manipulators, underwater vehicles, and mobile robots, are a fundamental output of embodied AI. Modern generative models often treat them as a dense, monolithic signal…
In many applications, one encounters signals that lie on manifolds rather than a Euclidean space. In particular, covariance matrices are examples of ubiquitous mathematical objects that have a non Euclidean structure. The application of…
Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…
Finite-density calculations in lattice field theory are typically plagued by sign problems. A promising way to ameliorate this issue is the holomorphic flow equations that deform the manifold of integration for the path integral to…
Lagrangian averaging plays an important role in the analysis of wave--mean-flow interactions and other multiscale fluid phenomena. The numerical computation of Lagrangian means, e.g. from simulation data, is however challenging. Typical…
Generative models based on dynamical equations such as flows and diffusions offer exceptional sample quality, but require computationally expensive numerical integration during inference. The advent of consistency models has enabled…
We present a symmetry-based framework for equilibrium statistical mechanics that formulates a single Lie group combining conventional spacetime symmetries with a recently identified phase-space gauge-shifting invariance [Muller et al.,…
We present a framework for modeling complex, high-dimensional distributions on convex polytopes by leveraging recent advances in discrete and continuous normalizing flows on Riemannian manifolds. We show that any full-dimensional polytope…
Riemannian diffusion models draw inspiration from standard Euclidean space diffusion models to learn distributions on general manifolds. Unfortunately, the additional geometric complexity renders the diffusion transition term inexpressible…
Learning probabilistic surrogates for partial differential equations remains challenging in data-scarce regimes: neural operators require large amounts of high-fidelity data, while generative approaches typically sacrifice resolution…
Diffusion-based unsupervised image registration has been explored for cardiac cine MR, but expensive multi-step inference limits practical use. We propose FlowReg, a flow-matching framework in displacement field space that achieves strong…
In this paper we study a version of the Hermitian curvature flow (HCF). We focus on complex homogeneous manifolds equipped with induced metrics. We prove that this finite-dimensional space of metrics is invariant under the HCF and write…
The scarcity of labeled data is a long-standing challenge for many machine learning tasks. We propose our gradient flow method to leverage the existing dataset (i.e., source) to generate new samples that are close to the dataset of interest…
Ergodic coverage effectively generates exploratory behaviors for embodied agents by aligning the spatial distribution of the agent's trajectory with a target distribution, where the difference between these two distributions is measured by…
In this paper, we present Laplacian multiscale flow matching (LapFlow), a novel framework that enhances flow matching by leveraging multi-scale representations for image generative modeling. Our approach decomposes images into Laplacian…
Latent flow matching for image generation usually transports Gaussian noise to variational autoencoder latents along linear paths. Both endpoints, however, concentrate in thin spherical shells, and a Euclidean chord leaves those shells even…
We present a formulation of flow matching as variational inference, which we refer to as variational flow matching (VFM). Based on this formulation we develop CatFlow, a flow matching method for categorical data. CatFlow is easy to…