cs.LGNov 16, 2026

Flow Matching for Sampled-Data Control of Angular Distributions

Authors: Xin Mao, Anqi Dong, Hongteng Xu, Kenan Zhang

Organizations: University of North Carolina at Chapel Hill · ´Ecole polytechnique f´ed´erale de Lausanne (EPFL) and NCCR Automation · Renmin University of China

Abstract

Synchronization and clustering in oscillator networks depend on the joint distribution of the phases. Flow Matching can steer this distribution by learning an angular velocity field from shortest arcs between paired configurations. Each arc is traversed at constant speed, yet the resulting field can vary along its own trajectories. In this article, we study how to control angular transport on the circle and product torus when each controller evaluation selects a rate to hold until the next update. Using the same local velocity samples, Flow Matching learns the instantaneous angular rate and MeanFlow learns its average along the reference trajectory over the control interval. Under direct angular actuation, holding the exact average gives the reference displacement. We relate the displacement error of holding the instantaneous rate and the training residual of MeanFlow to the conditional covariance of the teacher velocities. Experiments with 100 phases show that endpoint pairing affects the comparison. MeanFlow gives smaller one-step errors under minibatch pairing, while permutation alignment reverses the ranking for exchangeable phase clusters.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Mar 16, 2026

Transition Flow Matching

Mainstream flow matching methods typically focus on learning the local velocity field, which inherently requires multiple integration steps during generation. In contrast, Mean Velocity Flow models establish a relationship between the local velocity field and the global mean velocity, enabling the latter to be learned through a mathematically grounded formulation and allowing generation to be transferred to arbitrary future time points. In this work, we propose a new paradigm that directly learns the transition flow. As a global quantity, the transition flow naturally supports generation in a single step or at arbitrary time points. Furthermore, we demonstrate the connection between our approach and Mean Velocity Flow, establishing a unified theoretical perspective. Extensive experiments validate the effectiveness of our method and support our theoretical claims.
May 14, 2026

Lagrangian Flow Matching: A Least-Action Framework for Principled Path Design

Flow matching trains a neural velocity field by regression against a target velocity associated with a prescribed probability path connecting a simple initial distribution to the data distribution. A central design choice is the path itself. Existing constructions, including rectified and optimal-transport-based paths, transport samples along straight lines between coupled endpoints and thus cover only a narrow class of dynamics. We observe that this corresponds to the simplest case of the least-action principle in classical mechanics, in which the kinetic Lagrangian yields free-particle straight-line trajectories. Building on this observation, we propose Lagrangian flow matching, a physics-based framework in which the probability path and velocity field are determined by minimizing the action of a general Lagrangian subject to the continuity equation and the prescribed endpoints. We show that this dynamic problem admits an equivalent static optimal transport (OT) formulation, yielding a family of simulation-free training objectives that recover OT-based flow matching as the kinetic special case and the trigonometric variance-preserving diffusion path as the harmonic-oscillator case. More general Lagrangians give rise to new probability paths and velocity fields, and numerical experiments show that they induce meaningful changes in the learned dynamics while remaining competitive with existing conditional flow matching models.
Sep 28, 2026

Manifold-Stable Flow Matching

Flow matching (FM) learns generative dynamics through velocity regression. Geometric FM variants commonly assume a prior supported on the data manifold, requiring geometric knowledge that is often unavailable. Without such knowledge, low regression error alone does not guarantee manifold adherence. Adherence keeps generated samples within valid configurations and is empirically associated with better task performance. We introduce manifold-stable flow matching (MSFM), which can start from an arbitrary ambient prior, not necessarily supported on the manifold. Using tools from nonlinear dynamics, namely contraction theory, MSFM combines learned tangential transport with prescribed normal contraction. The construction uses analytical projectors for known manifolds and local affine proxies estimated by principal component analysis for unknown data geometry. By implementing contraction theory in both cases of known and unknown manifolds, we guarantee manifold invariance and transverse convergence to the manifold within a desired time window (e.g., one second). We derive a family of compatible probability paths and decompose the training loss into a learnable tangential term and a normal residual. An ellipse experiment attains a mean terminal off-manifold error of order 10−610^{-6}. In Push-T robotic experiments, MSFM raises success from 74%74\% to 82%82\%. In the Robomimic Square task, success increases from 60%60\% to 72%72\%, while rotation-manifold deviation decreases from order 10−210^{-2} to 10−710^{-7}. The MSFM terminal geometric errors are controlled by the chosen numerical tolerance. These results demonstrate stronger geometric adherence and higher observed task performance, supporting prescribed normal contraction as a complement to learned generative transport.