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

• URL: http://arxiv.org/abs/2605.15419v2
• Date: Tue, 19 May 2026 21:00:08 GMT
• Title: Lagrangian Flow Matching: A Least-Action Framework for Principled Path Design
• Abstract summary: Flow matching trains a neural velocity field by regression against a target velocity associated with a prescribed probability path.<n>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.
• Score: 14.77320535984857
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Limit Points of Reflow with Minibatch Optimal Transport [5.12067518301035]
  Rectified flows are generative models that learn a time-dependent vector field steering a probability curve between two probability distributions.<n>We study the behavior of this iteration and characterize its limit points.<n>Such $N$-cyclically monotone couplings enjoy favorable structural and stability properties such as rectifiability and straightness.
  arXiv  Detail & Related papers  (2026-08-07T09:51:33Z)
• 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)
• Generative optimal transport via forward-backward HJB matching [0.23332469289621782]
  Controlling the evolution of a many-body system from a disordered reference state to a structured target ensemble, arises naturally in non-equilibrium statistical mechanics and control.<n>We present a framework that provides a physically interpretable description of transport in terms of path-space free energy, risk-sensitive control, and spatial cost geometry.<n>Our results establish a unifying connection between optimal control, Schrdinger bridge theory, and non-equilibrium statistical mechanics.
  arXiv  Detail & Related papers  (2026-04-09T03:31:25Z)
• FlowConsist: Make Your Flow Consistent with Real Trajectory [99.22869983378062]
  We argue that current fast-flow training paradigms suffer from two fundamental issues.<n> conditional velocities constructed from randomly paired noise-data samples introduce systematic trajectory drift.<n>We propose FlowConsist, a training framework designed to enforce trajectory consistency in fast flows.
  arXiv  Detail & Related papers  (2026-02-06T03:24:23Z)
• Curly Flow Matching for Learning Non-gradient Field Dynamics [49.480209466896035]
  We introduce Curly Flow Matching (Curly-FM), a novel approach to learning non-gradient field dynamics.<n>Curly-FM is capable of learning non-gradient field dynamics by designing and solving a Schr"odinger bridge problem.<n>Curly-FM can learn trajectories that better match both the reference process and population marginals.
  arXiv  Detail & Related papers  (2025-10-30T16:11:39Z)
• An Eulerian Perspective on Straight-Line Sampling [0.0]
  We study dynamic measure transport for generative modeling, specifically, flows induced by processes that bridge a specified source and target distribution.<n>We ask emphwhich processes produce straight-line flows -- i.e., flows whose pointwise acceleration vanishes and thus are exactly integrable with a first-order method?<n>We provide a concise PDE characterization of straightness as a balance between conditional acceleration and the divergence of a weighted covariance (Reynolds) tensor.
  arXiv  Detail & Related papers  (2025-10-13T17:33:58Z)
• On the Relation between Rectified Flows and Optimal Transport [6.493334597338973]
  Rectified flow matching aims to straighten the learned transport paths, yielding more direct flows between distributions.<n>Recent claims suggest that rectified flows, when constrained such that the learned velocity field is a gradient, can yield solutions to optimal transport problems.<n>We present several counterexamples that invalidate earlier equivalence results in the literature, and we argue that enforcing a gradient constraint on rectified flows is, in general, not a reliable method for computing optimal transport maps.
  arXiv  Detail & Related papers  (2025-05-26T09:01:53Z)
• Flow Matching: Markov Kernels, Stochastic Processes and Transport Plans [1.9766522384767222]
  Flow matching techniques can be used to solve inverse problems.<n>We show how flow matching can be used for solving inverse problems.<n>We briefly address continuous normalizing flows and score matching techniques.
  arXiv  Detail & Related papers  (2025-01-28T10:28:17Z)
• Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
  We tackle the task of sampling from a probability density as transporting a tractable density function to the target. We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions. PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
  arXiv  Detail & Related papers  (2024-07-10T17:39:50Z)
• Optimal Flow Matching: Learning Straight Trajectories in Just One Step [89.37027530300617]
  We develop and theoretically justify the novel textbf Optimal Flow Matching (OFM) approach. It allows recovering the straight OT displacement for the quadratic transport in just one FM step. The main idea of our approach is the employment of vector field for FM which are parameterized by convex functions.
  arXiv  Detail & Related papers  (2024-03-19T19:44:54Z)
• Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
  We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
  arXiv  Detail & Related papers  (2022-06-29T22:19:03Z)

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.