A Few-Step Generative Model on Cumulative Flow Maps

• URL: http://arxiv.org/abs/2605.03623v1
• Date: Tue, 05 May 2026 10:51:40 GMT
• Title: A Few-Step Generative Model on Cumulative Flow Maps
• Abstract summary: We propose a unified, few-step generative modeling framework based on emphcumulative flow maps for long-range transport in probability space.<n>At its core is a cumulative-flow abstraction that connects local, instantaneous, updates with finite-time transport.<n>We demonstrate its effectiveness across diverse tasks, including image generation, geometric distribution modeling, joint prediction, and SDF generation.
• Score: 25.03991490159211
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a unified, few-step generative modeling framework based on \emph{cumulative flow maps} for long-range transport in probability space, inspired by flow-map techniques for physical transport and dynamics. At its core is a cumulative-flow abstraction that connects local, instantaneous updates with finite-time transport, enabling generative models to reason about global state transitions. This perspective yields a unified few-step framework built on cumulative transport and \revise{cumulative} parameterization that applies broadly to existing diffusion- and flow-based models without being tied to a specific prediction \revise{instantiation}. Our formulation supports few-step and even one-step generation while preserving synthesis quality, requiring only minimal changes to time embeddings and training objectives, and no increase in model capacity. We demonstrate its effectiveness across diverse tasks, including image generation, geometric distribution modeling, joint prediction, and SDF generation, with reduced inference cost.

Related papers

• Discrete Beckmann Transport Models for One-Step Language Modeling and Reasoning [1.6566972365776105]
  We introduce Discrete Beckmann Transport Models (DBTM)<n>DBTM is built on a time-independent flow whose autonomous transport map provably carries any point in the ambient space to a fixed point in a single step.<n>On language modeling and reasoning tasks, DBTM enables one- and few-step generation that improves quality and accuracy over discrete diffusion and continuous flow baselines.
  arXiv  Detail & Related papers  (2026-09-14T17:19:47Z)
• One-Step Flow Matching for Generative Modeling of Path-Dependent Physical Fields [0.6445605125467574]
  Flow matching (FM) model based on a transformer backbone for high-resolution path-dependent stress field generation.<n>The proposed model operates within the latent space of a variational autoencoder (VAE) and formulates the simulation of plastic fields as a video synthesis task.
  arXiv  Detail & Related papers  (2026-06-22T01:45:59Z)
• Drift Flow Matching [69.16550765154163]
  We propose Drift Flow Matching, a framework that connects drifting generative modeling with flow-based iterative generation.<n>DFM preserves the efficiency of direct transport maps while enabling generation to be refined through multiple inference steps.
  arXiv  Detail & Related papers  (2026-05-17T03:58:01Z)
• 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)
• Y-shaped Generative Flows [23.602025081791187]
  We introduce Y-shaped generative flows, which move probability mass together along shared pathways before branching to target-specific endpoints.<n>On synthetic, image, and biology datasets, Y-flows recover hierarchy-aware structure, improve distributional metrics over strong flow-based baselines, and reach targets with fewer integration steps.
  arXiv  Detail & Related papers  (2025-10-13T21:33:37Z)
• Transport Based Mean Flows for Generative Modeling [19.973366424307077]
  Flow-matching generative models have emerged as a powerful paradigm for continuous data generation.<n>These models suffer from slow inference due to the requirement of numerous sequential sampling steps.<n>Recent work has sought to accelerate inference by reducing the number of sampling steps.
  arXiv  Detail & Related papers  (2025-09-26T17:12:19Z)
• Transition Models: Rethinking the Generative Learning Objective [68.16330673177207]
  We introduce a continuous-time dynamics equation that analytically defines state transitions across any finite time interval.<n>This leads to a novel generative paradigm, Transition Models (TiM), which adapt to arbitrary-step transitions.<n>TiM achieves state-of-the-art performance, surpassing leading models such as SD3.5 (8B parameters) and FLUX.1 (12B parameters) across all evaluated step counts.
  arXiv  Detail & Related papers  (2025-09-04T17:05:59Z)
• Align Your Flow: Scaling Continuous-Time Flow Map Distillation [63.927438959502226]
  Flow maps connect any two noise levels in a single step and remain effective across all step counts.<n>We extensively validate our flow map models, called Align Your Flow, on challenging image generation benchmarks.<n>We show text-to-image flow map models that outperform all existing non-adversarially trained few-step samplers in text-conditioned synthesis.
  arXiv  Detail & Related papers  (2025-06-17T15:06:07Z)
• FlowMo: Variance-Based Flow Guidance for Coherent Motion in Video Generation [51.110607281391154]
  FlowMo is a training-free guidance method for enhancing motion coherence in text-to-video models.<n>It estimates motion coherence by measuring the patch-wise variance across the temporal dimension and guides the model to reduce this variance dynamically during sampling.
  arXiv  Detail & Related papers  (2025-06-01T19:55:33Z)
• Minibatch Optimal Transport and Perplexity Bound Estimation in Discrete Flow Matching [0.0]
  Outperforming autoregressive models on categorical data distributions, such as textual data, remains challenging for continuous diffusion and flow models. We propose a dynamic-optimal-transport-like minimization objective for discrete flows with convex interpolants. Unlike continuous flows, wherein the instantaneous change of variables enables density estimation, discrete models lack a similar mechanism due to the inherent non-determinism and discontinuity of their paths.
  arXiv  Detail & Related papers  (2024-11-01T17:35:09Z)
• Generative Modeling with Phase Stochastic Bridges [49.4474628881673]
  Diffusion models (DMs) represent state-of-the-art generative models for continuous inputs. We introduce a novel generative modeling framework grounded in textbfphase space dynamics Our framework demonstrates the capability to generate realistic data points at an early stage of dynamics propagation.
  arXiv  Detail & Related papers  (2023-10-11T18:38:28Z)
• Data-driven low-dimensional dynamic model of Kolmogorov flow [0.0]
  Reduced order models (ROMs) that capture flow dynamics are of interest for decreasing computational costs for simulation. This work presents a data-driven framework for minimal-dimensional models that effectively capture the dynamics and properties of the flow. We apply this to Kolmogorov flow in a regime consisting of chaotic and intermittent behavior.
  arXiv  Detail & Related papers  (2022-10-29T23:05:39Z)

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.