ODE-free Neural Flow Matching for One-Step Generative Modeling

• URL: http://arxiv.org/abs/2604.06413v1
• Date: Tue, 07 Apr 2026 19:49:57 GMT
• Title: ODE-free Neural Flow Matching for One-Step Generative Modeling
• Abstract summary: Diffusion and flow matching models generate samples by learning time-dependent vector fields whose integration transports noise to data.<n>We propose Optimal Transport Neural Flow Matching (OT-NFM), an ODE-free generative framework that parameterizes the flow map with neural flows.<n>We show that naive flow-map training suffers from mean collapse, where inconsistent noise-data pairings drive all outputs toward the data mean.
• Score: 4.319549155064877
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Diffusion and flow matching models generate samples by learning time-dependent vector fields whose integration transports noise to data, requiring tens to hundreds of network evaluations at inference. We instead learn the transport map directly. We propose Optimal Transport Neural Flow Matching (OT-NFM), an ODE-free generative framework that parameterizes the flow map with neural flows, enabling true one-step generation with a single forward pass. We show that naive flow-map training suffers from mean collapse, where inconsistent noise-data pairings drive all outputs toward the data mean. We prove that consistent coupling is necessary for non-degenerate learning and address this using optimal transport pairings with scalable minibatch and online coupling strategies. Experiments on synthetic benchmarks and image generation tasks (MNIST and CIFAR-10) demonstrate competitive sample quality while reducing inference to a single network evaluation.

Related papers

• Optimal Transport Flow Matching by Design [26.301026025241374]
  Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.<n>We reformulate the problem by treating the prior as a design choice rather than a fixed input.<n>Our method reduces trajectory curvature by more than $2times$ compared to existing flow matching methods.
  arXiv  Detail & Related papers  (2026-06-02T18:00:05Z)
• One-Step Generative Modeling via Wasserstein Gradient Flows [56.266175641614986]
  W-Flow is a framework for training a generator that transforms samples from a simple reference distribution into samples from a target data distribution in a single step.<n>We set a new state of the art for one-step ImageNet 256$times$256 generation, achieving 1.29 FID, with improved mode coverage and domain transfer.
  arXiv  Detail & Related papers  (2026-05-12T08:29:44Z)
• 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)
• The Coupling Within: Flow Matching via Distilled Normalizing Flows [45.3372883861006]
  A crucial ingredient in flow training is the choice of coupling measure for sampling noise/data pairs.<n>We propose Normalized Flow Matching, a new method that distills the quasi-deterministic coupling of pretrained NF models to train student flow models.
  arXiv  Detail & Related papers  (2026-03-09T23:07:36Z)
• 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)
• Guided Flows for Generative Modeling and Decision Making [55.42634941614435]
  We show that Guided Flows significantly improves the sample quality in conditional image generation and zero-shot text synthesis-to-speech. Notably, we are first to apply flow models for plan generation in the offline reinforcement learning setting ax speedup in compared to diffusion models.
  arXiv  Detail & Related papers  (2023-11-22T15:07:59Z)
• Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimization [87.21285093582446]
  Diffusion Generative Flow Samplers (DGFS) is a sampling-based framework where the learning process can be tractably broken down into short partial trajectory segments. Our method takes inspiration from the theory developed for generative flow networks (GFlowNets)
  arXiv  Detail & Related papers  (2023-10-04T09:39:05Z)
• Bayesian Flow Networks [4.197165999892042]
  This paper introduces Bayesian Flow Networks (BFNs), a new class of generative model in which the parameters of a set of independent distributions are modified with Bayesian inference.<n>Starting from a simple prior and iteratively updating the two distributions yields a generative procedure similar to the reverse process of diffusion models.<n>BFNs achieve competitive log-likelihoods for image modelling on dynamically binarized MNIST and CIFAR-10, and outperform all known discrete diffusion models on the text8 character-level language modelling task.
  arXiv  Detail & Related papers  (2023-08-14T09:56:35Z)
• Multisample Flow Matching: Straightening Flows with Minibatch Couplings [38.82598694134521]
  Simulation-free methods for training continuous-time generative models construct probability paths that go between noise distributions and individual data samples. We propose Multisample Flow Matching, a more general framework that uses non-trivial couplings between data and noise samples. We show that our proposed methods improve sample consistency on downsampled ImageNet data sets, and lead to better low-cost sample generation.
  arXiv  Detail & Related papers  (2023-04-28T11:33:08Z)
• Flow Matching for Generative Modeling [44.66897082688762]
  Flow Matching is a simulation-free approach for training Continuous Normalizing Flows (CNFs) We find that employing FM with diffusion paths results in a more robust and stable alternative for training diffusion models. Training CNFs using Flow Matching on ImageNet leads to state-of-the-art performance in terms of both likelihood and sample quality.
  arXiv  Detail & Related papers  (2022-10-06T08:32:20Z)
• 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.