Isokinetic Flow Matching for Pathwise Straightening of Generative Flows

• URL: http://arxiv.org/abs/2604.04491v1
• Date: Mon, 06 Apr 2026 07:32:02 GMT
• Title: Isokinetic Flow Matching for Pathwise Straightening of Generative Flows
• Abstract summary: Flow Matching (FM) constructs linear conditional probability paths, but the learned marginal velocity field exhibits strong curvature due to trajectory superposition.<n>We introduce Isokinetic Flow Matching (Iso-FM), a lightweight, Jacobian-free dynamical regularizer that directly penalizes pathwise acceleration.<n> operating as a pure plug-and-play addition to single-stage FM training, Iso-FM dramatically improves few-step generation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Flow Matching (FM) constructs linear conditional probability paths, but the learned marginal velocity field inevitably exhibits strong curvature due to trajectory superposition. This curvature severely inflates numerical truncation errors, bottlenecking few-step sampling. To overcome this, we introduce Isokinetic Flow Matching (Iso-FM), a lightweight, Jacobian-free dynamical regularizer that directly penalizes pathwise acceleration. By using a self-guided finite-difference approximation of the material derivative Dv/Dt, Iso-FM enforces local velocity consistency without requiring auxiliary encoders or expensive second-order autodifferentiation. Operating as a pure plug-and-play addition to single-stage FM training, Iso-FM dramatically improves few-step generation. On CIFAR-10 (DiT-S/2), Iso-FM slashes conditional non-OT FID at 2 steps from 78.82 to 27.13 - a 2.9x relative efficiency gain - and reaches a best-observed FID at 4 steps of 10.23. These results firmly establish acceleration regularization as a principled, compute-efficient mechanism for fast generative sampling.

Related papers

• High-Fidelity One-Step Generative Visuomotor Policy via Recursive Correction, Frequency Consistency, and Contrastive Flow Matching [3.5570904967011505]
  Generative models such as diffusion and flow matching have advanced robotic visuomotor policies by modeling multimodal action distributions.<n>Existing one-step acceleration methods compress the whole generation process into a single large update, leading to spatial deviation, frequency distortion, and mode averaging.<n>This paper proposes a high-fidelity one-step generative visuomotor policy framework that addresses these issues with three complementary mechanisms.
  arXiv  Detail & Related papers  (2026-07-04T13:12:38Z)
• DriveAnchor: Progressive Anchor-based Flow Learning for Autonomous Driving Planning [6.848508447210393]
  DriveAnchor is a framework for autonomous driving planning.<n>It achieves behavioral diversity, controllability, and safety in a composable pipeline.<n>It reduces near-range collision rates by 89% and improves mean reward by 32% without degradation in imitation accuracy.
  arXiv  Detail & Related papers  (2026-05-30T04:17:59Z)
• Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schrödinger Samplers [68.9946633641494]
  Flow matching and Schrdinger bridges define probability, yet their inference grids are usually or inherited from one-endpoint diffusion.<n>We derive a conditional-marginal entropy-rate objective for bridge-aware discretization, separating endpoint-conditioned bridge geometry from marginal flow evolution.<n>On EDM/CIFAR-10, the entropic time-discretization gives the best tested five-step FID (186.3 pm 4.0 versus 200.5 pm 2.9 for linear and 238.0 pm 5.3 for cosine)
  arXiv  Detail & Related papers  (2026-05-15T16:11:10Z)
• Riemannian MeanFlow for One-Step Generation on Manifolds [54.09734511705173]
  Flow Matching enables simulation-free training of generative models.<n>MeanFlow can be extended to manifold-valued generation where velocities lie in location-dependent tangent spaces.<n>Experiments on spheres, tori, and SO(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
  arXiv  Detail & Related papers  (2026-03-11T12:41:46Z)
• 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)
• Path-Guided Flow Matching for Dataset Distillation [9.761850986508895]
  We propose the first flow matching-based framework for generative distillation, which enables fast deterministic synthesis by solving an ODE in a few steps.<n>We develop a continuous path-to-prototype guidance algorithm for ODE-consistent path control, which allows trajectories to reliably land on assigned prototypes.
  arXiv  Detail & Related papers  (2026-02-05T12:52:32Z)
• MeanFlow Transformers with Representation Autoencoders [71.45823902973349]
  MeanFlow (MF) is a diffusion-motivated generative model that enables efficient few-step generation by learning long jumps directly from noise to data.<n>We develop an efficient training and sampling scheme for MF in the latent space of a Representation Autoencoder (RAE)<n>We achieve a 1-step FID of 2.03, outperforming vanilla MF's 3.43, while reducing sampling GFLOPS by 38% and total training cost by 83% on ImageNet 256.
  arXiv  Detail & Related papers  (2025-11-17T06:17:08Z)
• OAT-FM: Optimal Acceleration Transport for Improved Flow Matching [31.693019737039496]
  Flow Matching (FM) aims to learn velocity fields from noise to data.<n>We bridge FM and the recent theory of Optimal Acceleration Transport (OAT)<n>We develop an improved FM method called OAT-FM and explore its benefits in both theory and practice.
  arXiv  Detail & Related papers  (2025-09-29T15:36:27Z)
• Flow Diverse and Efficient: Learning Momentum Flow Matching via Stochastic Velocity Field Sampling [23.57202605415588]
  The rectified flow (RF) has emerged as the new state-of-the-art among flow-based diffusion models.<n>We present Discretized-RF, a new family of rectified flow models.<n>We introduce noise on the velocity $bm v$ of the sub-path to change its direction to improve the diversity and multi-scale noise modeling abilities.
  arXiv  Detail & Related papers  (2025-06-10T13:44:49Z)
• Local Flow Matching Generative Models [19.859984725284896]
  Flow Matching (FM) is a simulation-free method for learning a continuous and invertible flow to interpolate between two distributions.<n>We introduce a stepwise FM model called Local Flow Matching (LFM), which consecutively learns a sequence of FM sub-models.<n>We empirically demonstrate improved training efficiency and competitive generative performance of LFM compared to FM.
  arXiv  Detail & Related papers  (2024-10-03T14:53:10Z)
• Consistency Flow Matching: Defining Straight Flows with Velocity Consistency [97.28511135503176]
  We introduce Consistency Flow Matching (Consistency-FM), a novel FM method that explicitly enforces self-consistency in the velocity field. Preliminary experiments demonstrate that our Consistency-FM significantly improves training efficiency by converging 4.4x faster than consistency models.
  arXiv  Detail & Related papers  (2024-07-02T16:15:37Z)
• 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)
• Improving and generalizing flow-based generative models with minibatch optimal transport [90.01613198337833]
  We introduce the generalized conditional flow matching (CFM) technique for continuous normalizing flows (CNFs) CFM features a stable regression objective like that used to train the flow in diffusion models but enjoys the efficient inference of deterministic flow models. A variant of our objective is optimal transport CFM (OT-CFM), which creates simpler flows that are more stable to train and lead to faster inference.
  arXiv  Detail & Related papers  (2023-02-01T14:47:17Z)

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.