Unbalanced W-Flow: Unbalanced Wasserstein Drifting under Finite-Batch Marginal Fluctuations
Not on the map. Why?
Abstract (arXiv)
Teacher-free one-step generative models such as W-Flow learn directly from distributional objectives, with the Sinkhorn divergence providing the strongest empirical performance among the energies studied in W-Flow. However, Sinkhorn divergence is based on balanced optimal transport, whose exact marginal constraints can induce undesirable transport under finite minibatch fluctuations. We introduce UW-Flow, which replaces the balanced Sinkhorn energy with a debiased unbalanced Sinkhorn divergence and derives the corresponding Wasserstein velocity. The resulting dynamics retain W-Flow's cross-minus-self structure, recover the balanced limit, and preserve target identifiability under suitable assumptions. We further characterize the finite-batch velocity error of balanced and unbalanced transport by comparing each minibatch field with its population counterpart. Our analysis identifies conditions under which marginal relaxation yields smaller minibatch-to-population velocity error, and shows that for separated matched modes, balanced sensitivity grows with inter-mode separation while the corresponding Unbalanced Optimal Transport (UOT) sensitivity remains controlled by local transport geometry. Controlled experiments on fixed-support and continuous two-mode distributions support these predictions. On MNIST, CIFAR-10, and ImageNet-100, UW-Flow improves generation under matched training budgets, with the largest gains in unconditional generation and consistent improvements in the class-conditional setting.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 34 references that are in the map. First posted on arXiv 13 Oct 2026.
Builds on
25 of 34 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2016Improved Techniques for Training GANscited by 2,970
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2019Contrastive Multiview Codingcited by 1,301
- 2019Improved Precision and Recall Metric for Assessing Generative Modelscited by 944
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
- 2017Learning Generative Models with Sinkhorn Divergencescited by 314
- 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplingscited by 278
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 139
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 125
- 2026Generative Modeling via Driftingcited by 116
13 more
- 2025Inductive Moment Matchingcited by 113
- 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 87
- 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 87
- 2021Generative Modeling with Optimal Transport Mapscited by 82
- 2019Sinkhorn Divergences for Unbalanced Optimal Transportcited by 55
- 2018Scalable Unbalanced Optimal Transport using Generative Adversarial Networkscited by 42
- 2021Improving Mini-batch Optimal Transport via Partial Transportationcited by 41
- 2023Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transportcited by 41
- 2023Unbalancedness in Neural Monge Maps Improves Unpaired Domain Translationcited by 33
- 2026One-Step Generative Modeling via Wasserstein Gradient Flowscited by 24
- 2024Scalable Wasserstein Gradient Flow for Generative Modeling through Unbalanced Optimal Transportcited by 23
- 2021On Transportation of Mini-batches: A Hierarchical Approachcited by 16
- 2024Neural Sinkhorn Gradient Flowcited by 9
Built on by
Not cited yet.