Skip to content
Preprint

A Lagrangian View of Flow Matching

Aug 2026 · 0 citations · 11 references
Computer Science Physics

TL;DR

This paper analyzes the local Taylor expansion of a continuous denoiser to motivate a strict invariance condition required for optimal, singlestep generation: the conservation of target identity, and demonstrates that solving this condition via the Method of Characteristics analytically yields the straight-line trajectories of Flow Matching.

Abstract

Modern explicit-time generative models, such as Flow Matching [Lipman et al., 2023] and Rectified Flow [Liu et al., 2023], are typically derived top-down via Optimal Transport and the continuity equation. This standard Eulerian approach focuses on the macroscopic transport of probability mass. In this paper, we present an alternative, bottom-up mechanical derivation grounded in a Lagrangian (particle-centric) perspective. By analyzing the local Taylor expansion of a continuous denoiser, we motivate a strict invariance condition required for optimal, singlestep generation: the conservation of target identity. Enforcing this condition yields a governing quasi-linear advection Partial Differential Equation (PDE). We demonstrate that solving this PDE via the Method of Characteristics analytically yields the straight-line trajectories of Flow Matching. This geometric perspective isolates the Jacobian of the denoiser as the primary source of trajectory curvature, providing a direct mathematical explanation for why straight-line flows enable massive step sizes, and why empirical models require distillation to flatten intersecting characteristics.

View source

Similar papers

#machine learning Preprint Sep 2026

CAT-Flow: Curvature-Adaptive sTeps for Flow Matching

Two lightweight, training-free algorithms are proposed, CAT-OV and CAT-OT that adapt step-sizes at inference time based on a novel connection between Flow Matching sampling and gradient flow that outperform existing step-size heuristics in image quality metrics across four text- to-image Flow Matching models.

Qinchan Li, Pedro Cisneros-Velarde, Ke-Ru Fu et al. · 1 citation
Preprint Aug 2026

Weighted Laplacian Flow: A Deterministic Particle Flow with Exponential Convergence

We introduce weighted Laplacian flow (WLF), a deterministic particle-flow framework for sampling from a target distribution known only up to normalization. The proposed method evolves the logarithmic density ratio through a transport equation and determines the particle velocity from a target-weighted Poisson problem,...

Wei-Ye Gan, Tang-Jun Wang, Zuo-Qiang Shi · 0 citations
#machine learning Preprint Sep 2026

A Variational Optimal Transport Operator on Incompressible Flow

We present the Variational Incompressible Optimal Transport (VIOT) operator, a generative neural operator for amortized incompressible density transport. Given a new source-target density pair, VIOT predicts a divergence-free velocity field and generates the full transport trajectory by feed-forward inference, replacin...

Jin-Jin He, Shenyifan Lu, Si-Nan Wang et al. · 0 citations
Preprint Oct 2026

Fluid Mixing and Incompressible Optimal Transport

The problem of incompressible fluid mixing is long-studied, yet many questions remain open. This paper aims to address the question ``what do efficient flow fields for mixing look like, and how do they behave?''Inspired by the dynamic and geometric approach to optimal mass transport, we formulate a version of the fluid...

Max Emerick, John Igraszek, Bassam Bamieh · 0 citations
#machine learning Preprint Oct 2026

Smoother Flow Matching via Contrastive Trajectory Repulsion

Trajectory crossing remains a critical bottleneck in Flow Matching (FM), and previous works typically view these crossings from a theoretical optimization perspective causing velocity averaging. They attempt to address it indirectly by post-hoc distillation or endpoint coupling, without explicitly regulating the interm...

Zi-Qi Jiang, Zhen-Qi He, Long Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.