One-Step Generative Modeling via Unbalanced Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Drifting models enable one-step generation by amortizing distribution transport into training, but this efficiency places greater demands on the transport field estimated at each update. In large-scale training, the field is computed from finite mini-batches of generated and real samples, which provide only imperfect approximations to the underlying distributions. Balanced optimal transport enforces exact mass matching within every mini-batch, making the estimated field sensitive to the particular composition of the real-data batch. We find that generated and real samples should be treated asymmetrically: letting the mass assigned to real samples adapt while keeping every generated sample fully transported improves generation across six feature-space metrics in controlled ablations, and is more robust to the relaxation strength than relaxing both marginals simultaneously, which falls below balanced transport under stronger relaxation. Motivated by this observation, we propose Unbalanced Optimal Transport Gradient Flow (UOT-GF), which keeps the generated-sample marginal fixed and relaxes only the real-data marginal. Under identical settings at DiT-B/2 on ImageNet-256, UOT-GF improves Fr'echet Inception Distance (FID) from 1.53 to 1.46 over the balanced W-Flow baseline; scaling the same recipe yields 1.34 and 1.22 FID at L/2 and XL/2, the best FID among the one-step models we compare. We further derive the induced UOT transport force, establish a kinetic Vlasov--Fokker--Planck formulation whose overdamped zero-temperature limit recovers the drifting dynamics, and characterize non-target stationary states together with sufficient conditions for convergence.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 82 of its 99 references that are in the map. First posted on arXiv 26 Sep 2026.
Builds on
82 of 99 references.
References · 82
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,185
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2023Consistency Modelscited by 1,778
38 more
- 2024Visual Autoregressive Modeling: Scalable Image Generation via Next-Scale Predictioncited by 1,005
- 2019Improved Precision and Recall Metric for Assessing Generative Modelscited by 925
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
- 2024SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformerscited by 707
- 2024Representation Alignment for Generation: Training Diffusion Transformers Is Easier Than You Thinkcited by 666
- 2024Autoregressive Image Generation without Vector Quantizationcited by 644
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
- 2025Mean Flows for One-step Generative Modelingcited by 524
- 2020Reliable Fidelity and Diversity Metrics for Generative Modelscited by 425
- 2025Reconstruction vs. Generation: Taming Optimization Dilemma in Latent Diffusion Modelscited by 376
- 2024One Step Diffusion via Shortcut Modelscited by 373
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2024Simplifying, Stabilizing and Scaling Continuous-Time Consistency Modelscited by 276
- 2025Diffusion Transformers with Representation Autoencoderscited by 275
- 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplingscited by 267
- 2025REPA-E: Unlocking VAE for End-to-End Tuning with Latent Diffusion Transformerscited by 212
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2023Diffusion Schr"odinger Bridge Matchingcited by 151
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
- 2019Maximum Mean Discrepancy Gradient Flowcited by 123
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
- 2022Neural Optimal Transportcited by 123
- 2018Improving GANs Using Optimal Transportcited by 122
- 2025Improved Mean Flows: On the Challenges of Fastforward Generative Modelscited by 102
- 2025DDT: Decoupled Diffusion Transformercited by 100
- 2026Generative Modeling via Driftingcited by 98
- 2019Wasserstein-2 Generative Networkscited by 96
- 2025Representation Entanglement for Generation: Training Diffusion Transformers Is Much Easier Than You Thinkcited by 95
- 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 91
- 2020From ImageNet to Image Classification: Contextualizing Progress on Benchmarkscited by 90
- 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 83
- 2021Generative Modeling with Optimal Transport Mapscited by 80
- 2024FlowAR: Scale-wise Autoregressive Image Generation Meets Flow Matchingcited by 77
- 2021Large-Scale Wasserstein Gradient Flowscited by 76
- 2025PixNerd: Pixel Neural Field Diffusioncited by 75
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
50 most cited of 82 All 82 (JSON)
Built on by
Not cited yet.