A Biconvex Formulation for Stable Transport of Mixture Models with a Unique Solution
Not on the map. Why?
Abstract (arXiv)
Optimal transport (OT) provides a principled framework for mapping between probability distributions. Despite extensive progress, applying OT to large-scale data remains computationally demanding, and the resulting pointwise transport plans are often difficult to interpret. We introduce Optimal Mixture Transport (OMT), a scalable framework that shifts the transport paradigm from individual samples to mixtures of subpopulations, reformulating the transport problem as a strictly biconvex optimization with a unique global minimizer. We further establish theoretical guarantees on the stability of the OMT map, showing that bounded perturbations of the underlying distributions lead to bounded changes in the transport plan. By formulating subpopulations as exponential-family distributions, OMT decouples computational complexity from the sample size, scaling solely with the number of mixture components. We demonstrate the effectiveness and practicality of OMT on a wide range of synthetic benchmarks and real-world datasets, including image data and large-scale single-cell RNA sequencing measurements.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 35 of its 62 references that are in the map. First posted on arXiv 1 Jun 2026.
Builds on
35 of 62 references.
References · 35
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
- 2023Diffusion Schr"odinger Bridge Matchingcited by 151
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
- 2022Neural Optimal Transportcited by 123
- 2018Unsupervised Alignment of Embeddings with Wasserstein Procrustescited by 96
23 more
- 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 96
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
- 2023Stochastic interpolants with data-dependent couplingscited by 94
- 2021Generative Modeling with Optimal Transport Mapscited by 80
- 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
- 2021Low-Rank Sinkhorn Factorizationcited by 66
- 2021Minibatch optimal transport distances; analysis and applicationscited by 62
- 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 59
- 2022Entropic Neural Optimal Transport via Diffusion Processescited by 49
- 2024Light and Optimal Schr"odinger Bridge Matchingcited by 45
- 2023Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transportcited by 39
- 2022On amortizing convex conjugates for optimal transportcited by 30
- 2022Low-rank Optimal Transport: Approximation, Statistics and Debiasingcited by 21
- 2023Building the Bridge of Schr"odinger: A Continuous Entropic Optimal Transport Benchmarkcited by 19
- 2023Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Mapscited by 16
- 2024Progressive Entropic Optimal Transport Solverscited by 10
- 2022InfoOT: Information Maximizing Optimal Transportcited by 9
- 2025Hierarchical Refinement: Optimal Transport to Infinity and Beyondcited by 8
- 2024Low-Rank Optimal Transport through Factor Relaxation with Latent Couplingcited by 7
- 2024ENOT: Expectile Regularization for Fast and Accurate Training of Neural Optimal Transportcited by 6
- 2024Optimal Transport for Domain Adaptation through Gaussian Mixture Modelscited by 3
- 2023Learning representations that are closed-form Monge mapping optimal with application to domain adaptationcited by 2
- 2021Self Sparse Generative Adversarial Networkscited by 1
Built on by
Not cited yet.