arXiv Machine Learning By Lei Luo, Yingzhen Zhang, Jian Yang

Self-Consistent Generative Paths via Admissible Random Variational Transport

Read the original on arXiv Machine Learning →

arXiv:2606. 08953v1 Announce Type: new Abstract: Modern generative models often define an entire probability path from a simple prior to the data law, rather than only an endpoint map.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 30

Robustness and Structure Preservation in Flow-Based Generative Models via Wasserstein Path-Space Divergences

arXiv:2410. 01244v2 Announce Type: replace-cross Abstract: We introduce a novel Wasserstein-1 ($W_1$) path-space divergence for stochastic and deterministic dynamics and establish a Wasserstein Uncertainty Propagation (WUP) theorem that bounds the $W_1$ distance between terminal distributions by the proposed divergence, equivalently characterized by a weighted $L^2$ discrepancy between the underlying drifts and the $W_1$ distance between their initial measures.

By Ziyu Chen, Markos A. Katsoulakis, Benjamin J. Zhang
arXiv Machine Learning
Jun 2

Consistent Diffusion Language Models

arXiv:2605. 00161v2 Announce Type: replace Abstract: Diffusion language models (DLMs) are an attractive alternative to autoregressive models because they promise sublinear-time, parallel generation, yet practical gains remain elusive as high-quality samples still demand hundreds of refinement steps.

By Hasan Amin, Yuan Gao, Yaser Souri, Subhojit Som, Ming Yin, Rajiv Khanna, Xia Song
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
Hugging Face Trending Papers
Jun 29

The Fundamental Limits of Valid Transport Map Estimation

Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map. In applications like generative modeling, the transport cost itself is irrelevant, and this makes it natural to target maps which are more tractable from either a statistical or computational standpoint.