mlsanityData to 7 Oct 2026

Discrete Wasserstein Flows for One-Step Generative Modeling

arXiv 2610.01355 ↗First posted 1 Oct 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce a new framework for one-step generative modelling on finite state spaces. To extend drifting beyond continuous domains, we use discrete Wasserstein geometry to define a target-relative KL gradient flow over the transitions of a reversible Markov kernel. We realize this probability flow at the particle level through Markov jumps and amortize the resulting transport updates into a latent-conditioned generator, so that the iterative dynamics are required only during training while inference remains one-step. In a controlled setting where the underlying distributions and transport dynamics can be computed exactly, we verify KL dissipation, consistency between the particle dynamics and the probability flow, and the predicted numerical scaling. We further show that a finite-capacity neural generator can track these exact transport targets while retaining one-step generation. These results validate the basic construction and provide a foundation for scaling Discrete Drifting to structured discrete data.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 13 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

7 of 13 references.

References · 7

  1. 2023Discrete Diffusion Modeling by Estimating the Ratios of the Data Distributioncited by 712
  2. 2022A Continuous Time Framework for Discrete Denoising Modelscited by 437
  3. 2026Generative Modeling via Driftingcited by 98
  4. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 91
  5. 2022Discrete Langevin Sampler via Wasserstein Gradient Flowcited by 23
  6. 2024Learning diffusion at lightspeedcited by 21
  7. 2026Learning Discrete Diffusion of Graphs via Free-Energy Gradient Flowscited by 1

Built on by

Not cited yet.