Discrete Wasserstein Flows for One-Step Generative Modeling

arXiv:2610.01355v1 Announce Type: cross Abstract: 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.

Related

• Branching Flows: Discrete, Continuous, and Manifold Flow Matching with Splits and Deletions
• Discrete MeanFlow: One-Step Generation via Conditional Transition Kernels
• ELF: Embedded Language Flows
• From Baselines to Transport Geodesics: Axiomatic Attribution via Optimal Generative Flows

Source: arXiv cs.AI | 2026-10-02