arXiv Machine Learning

Expanding Flow Maps

arXiv:2607. 21585v1 Announce Type: new Abstract: Flow-based generative models have enabled remarkable progress in fast and controllable generation across continuous and discrete state spaces, yet existing parameterizations are constrained to fixed dimensions or fixed sequence lengths.

arXiv Machine Learning
Sep 15

Discrete Beckmann Transport Models for One-Step Language Modeling and Reasoning

Discrete Beckmann Transport Models (DBTM) are introduced as a new type of discrete diffusion and flow model that can generate language in a single step by mapping any point to a fixed point on the simplex vertices. Unlike previous approaches, DBTM eliminates the need for a pretrained teacher model and time conditioning by minimizing a conservation equation directly from data. The model can be partially trained and iterated until convergence, and it can be extended to a partial‑context interpolant that refines outputs with additional function evaluations. Experiments on language modeling and reasoning tasks show that DBTM achieves higher quality and accuracy than existing discrete diffusion and continuous flow baselines.

By Sophia Tang, Shiyi Wang
arXiv Machine Learning
Jun 9

Midpoint Generative Models

arXiv:2605. 29920v2 Announce Type: replace Abstract: We introduce Midpoint Generative Models (MGM), a principled framework for training one-step generative models.

By Daniil Shlenskii, Nikita Gushchin, Lev Novitskiy, Dmitry V. Dylov, Alexander Korotin
arXiv AI
2d ago

Discrete Wasserstein Flows for One-Step Generative Modeling

The paper presents a new one‑step generative modeling framework for finite state spaces, leveraging discrete Wasserstein geometry to define a target‑relative KL gradient flow over a reversible Markov kernel. The authors implement this flow at the particle level using Markov jumps and encode the resulting transport updates into a latent‑conditioned generator, enabling one‑step inference after training. Experiments on a controlled setting confirm KL dissipation, consistency between particle dynamics and probability flow, and accurate numerical scaling, while a finite‑capacity neural generator successfully tracks the exact transport targets.

By Alessandro Micheli, Andrea Zerio, Samir Bhatt
arXiv Machine Learning
Jun 16

Branching Flows: Discrete, Continuous, and Manifold Flow Matching with Splits and Deletions

arXiv:2511. 09465v4 Announce Type: replace-cross Abstract: Diffusion and flow matching approaches to generative modeling have shown promise in domains where the state space is continuous, such as image generation or protein folding & design, and discrete, exemplified by diffusion large language models.

By Lukas Billera, Hedwig Nora Nordlinder, Jack Collier Ryder, Anton Oresten, Aron St{\aa}lmarck, Theodor Mosetti Bj\"ork, Ben Murrell