On the Role of Strain and Vorticity in Numerical Integration Error for Flow Matching

• URL: http://arxiv.org/abs/2605.06680v1
• Date: Wed, 22 Apr 2026 21:34:37 GMT
• Title: On the Role of Strain and Vorticity in Numerical Integration Error for Flow Matching
• Abstract summary: Flow matching generates data by integrating a learned velocity field.<n>We analyze which properties of the velocity field govern integration error by decomposing the velocity Jacobian into its symmetric part S.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Flow matching generates data by integrating a learned velocity field, where the number of integration steps (NFE) directly determines inference cost. We analyze which properties of the velocity field govern integration error by decomposing the velocity Jacobian into its symmetric part S (strain rate) and antisymmetric part Omega (vorticity). We prove that strain and vorticity play different roles: strain controls exponential error amplification through the logarithmic norm, while vorticity contributes only linearly to the local truncation error. We further show that the optimal transport velocity field is irrotational and has zero material derivative, implying second-order Euler accuracy; for exact displacement interpolation, the associated Lagrangian particle dynamics are integrated exactly by Euler. Motivated by this analysis, we study weighted Jacobian regularization with strain weight alpha and vorticity weight beta. Experiments on 2D synthetic data confirm the main theoretical predictions, showing up to 2.7x lower integration error at NFE=5. Preliminary CIFAR-10 experiments show consistent trends, with a lightweight fine-tuning procedure improving FID by 14 percent at NFE=10 while preserving high-NFE quality.

Related papers

• \ extbf{PLATO}: \emph{Preintegration Learning from Accurate Trajectory Observations} for Neural Inertial Odometry [13.055293475825872]
  This paper introduces textbfPLATO:emphPreintegration Learning from Accurate Trajectory Observations.<n>It is a likelihood-based framework that leverages accurate trajectory observations to jointly learn IMU bias dynamics.<n>A tailored double-adjoint scheme couples a discrete invariant-error adjoint with a continuous-time adjoint for the bias NODE, enabling memory-efficient likelihood optimization.
  arXiv  Detail & Related papers  (2026-09-06T07:55:28Z)
• K-GMRF: Kinetic Gauss-Markov Random Field for First-Principles Covariance Tracking on Lie Groups [8.489406212619164]
  We propose K-GMRF, an online, training-free framework for covariance tracking.<n>Our method interprets observations as torques driving a latent angular velocity, propagated via a structure-preserving symplectic integrator.<n>We theoretically prove that this second-order dynamics achieves zero steady-state error under constant rotation.
  arXiv  Detail & Related papers  (2026-03-20T03:16:36Z)
• Physics-informed neural particle flow for the Bayesian update step [0.8220217498103312]
  We propose a physics-informed neural particle flow, which is an amortized inference framework.<n>By embedding a governing partial differential equation (PDE) into the loss function, we train a neural network to approximate the transport velocity field.<n>We demonstrate that the neural parameterization acts as an implicit regularizer, mitigating the stiffness inherent to analytic flows.
  arXiv  Detail & Related papers  (2026-02-26T15:10:45Z)
• Extracting quantum field theory dynamics from an approximate ground state [0.0]
  We develop a linear-programming method to extract information from static ground-state correlators in quantum field theory.<n>We test the method on the $1+1$-dimensional $4$ model, using a variational approximation to the vacuum.<n>The resulting mass gaps agree with renormalized Hamiltonian truncation and Borel-resummed perturbation theory.
  arXiv  Detail & Related papers  (2025-12-22T17:25:24Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• Diffusion Models are Molecular Dynamics Simulators [0.0]
  We prove that a denoising diffusion sampler equipped with a sequential bias across the batch dimension is exactly an Euler-Maruyama integrator for overdamped Langevin dynamics.<n>Each reverse denoising step, with its associated spring stiffness, can be interpreted as one step of a differential equation with an effective time step set jointly by the noise schedule and that stiffness.<n>The learned score then plays the role of the gradient of a learned energy, yielding a precise correspondence between diffusion sampling and Langevin time evolution.
  arXiv  Detail & Related papers  (2025-11-21T19:48:32Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• On the Wasserstein Convergence and Straightness of Rectified Flow [54.580605276017096]
  Rectified Flow (RF) is a generative model that aims to learn straight flow trajectories from noise to data.<n>We provide a theoretical analysis of the Wasserstein distance between the sampling distribution of RF and the target distribution.<n>We present general conditions guaranteeing uniqueness and straightness of 1-RF, which is in line with previous empirical findings.
  arXiv  Detail & Related papers  (2024-10-19T02:36:11Z)
• Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems [78.96969465641024]
  We extend mean-field Langevin dynamics to minimax optimization over probability distributions for the first time with symmetric and provably convergent updates. We also study time and particle discretization regimes and prove a new uniform-in-time propagation of chaos result.
  arXiv  Detail & Related papers  (2023-12-02T13:01:29Z)
• Learning Discretized Neural Networks under Ricci Flow [48.47315844022283]
  We study Discretized Neural Networks (DNNs) composed of low-precision weights and activations.<n>DNNs suffer from either infinite or zero gradients due to the non-differentiable discrete function during training.
  arXiv  Detail & Related papers  (2023-02-07T10:51:53Z)
• Convex Analysis of the Mean Field Langevin Dynamics [49.66486092259375]
  convergence rate analysis of the mean field Langevin dynamics is presented. $p_q$ associated with the dynamics allows us to develop a convergence theory parallel to classical results in convex optimization.
  arXiv  Detail & Related papers  (2022-01-25T17:13:56Z)
• Neural Control Variates [71.42768823631918]
  We show that a set of neural networks can face the challenge of finding a good approximation of the integrand. We derive a theoretically optimal, variance-minimizing loss function, and propose an alternative, composite loss for stable online training in practice. Specifically, we show that the learned light-field approximation is of sufficient quality for high-order bounces, allowing us to omit the error correction and thereby dramatically reduce the noise at the cost of negligible visible bias.
  arXiv  Detail & Related papers  (2020-06-02T11:17:55Z)

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.