Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Aggregating data from multiple sources can be formalized as an Optimal Transport (OT) barycenter problem, which seeks to compute the average of probability distributions with respect to OT discrepancies. However, in real-world scenarios, the presence of outliers and noise in the data measures can significantly hinder the performance of traditional statistical methods for estimating OT barycenters. To address this issue, we propose a novel scalable approach for estimating the robust continuous barycenter, leveraging the dual formulation of the (semi-)unbalanced OT problem. To the best of our knowledge, this paper is the first attempt to develop an algorithm for robust barycenters under the continuous distribution setup. Our method is framed as a min-max optimization problem and is adaptable to general cost functions. We rigorously establish the theoretical underpinnings of the proposed method and demonstrate its robustness to outliers and class imbalance through a number of illustrative experiments. Our source code is publicly available at https://github.com/milenagazdieva/U-NOTBarycenters.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 57 of its 72 references that are in the map. First posted on arXiv 4 Oct 2024.
Builds on
57 of 72 references.
References · 57
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
- 2020Training Generative Adversarial Networks with Limited Datacited by 1,184
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
- 2021Designing an Encoder for StyleGAN Image Manipulationcited by 542
- 2016Input Convex Neural Networkscited by 407
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2023Diffusion Schr"odinger Bridge Matchingcited by 151
- 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
38 more
- 2022Neural Optimal Transportcited by 123
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
- 2019Wasserstein-2 Generative Networkscited by 96
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
- 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
- 2021Generative Modeling with Optimal Transport Mapscited by 80
- 2024Optimal Flow Matching: Learning Straight Trajectories in Just One Stepcited by 74
- 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 59
- 2019Sinkhorn Divergences for Unbalanced Optimal Transportcited by 52
- 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 50
- 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 49
- 2022Entropic Neural Optimal Transport via Diffusion Processescited by 49
- 2022Unbalanced Optimal Transport, from Theory to Numericscited by 45
- 2024Light and Optimal Schr"odinger Bridge Matchingcited by 45
- 2021Neural Monge Map estimation and its applicationscited by 40
- 2023Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transportcited by 39
- 2022Neural Optimal Transport with General Cost Functionalscited by 34
- 2020Continuous Regularized Wasserstein Barycenterscited by 32
- 2023Unbalancedness in Neural Monge Maps Improves Unpaired Domain Translationcited by 32
- 2022Kernel Neural Optimal Transportcited by 31
- 2022On amortizing convex conjugates for optimal transportcited by 30
- 2021On Robust Optimal Transport: Computational Complexity and Barycenter Computationcited by 27
- 2021Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysiscited by 27
- 2023Energy-guided Entropic Neural Optimal Transportcited by 25
- 2022Wasserstein Iterative Networks for Barycenter Estimationcited by 23
- 2018Existence, Duality, and Cyclical monotonicity for weak transport costscited by 21
- 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?cited by 19
- 2023Light Schr"odinger Bridgecited by 18
- 2023Tree-Based Diffusion Schr"odinger Bridge with Applications to Wasserstein Barycenterscited by 16
- 2024Estimating Barycenters of Distributions with Neural Optimal Transportcited by 14
- 2023Extremal Domain Translation with Neural Optimal Transportcited by 12
- 2023Energy-Guided Continuous Entropic Barycenter Estimation for General Costscited by 12
- 2024Adversarial Schr"odinger Bridge Matchingcited by 12
- 2021Unbalanced Multi-Marginal Optimal Transportcited by 11
- 2023Doubly Regularized Entropic Wasserstein Barycenterscited by 10
- 2020MMD-Regularized Unbalanced Optimal Transportcited by 8
- 2023Light Unbalanced Optimal Transportcited by 8
- 2023Analyzing and Improving Optimal-Transport-based Adversarial Networkscited by 8
50 most cited of 57 All 57 (JSON)
Built on by
Citing papers per year: 2025: 4; 2026: 5.
9 papers.
- 2025Learning of Population Dynamics: Inverse Optimization Meets JKO Schemecited by 6
- 2025Schr"odinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentrescited by 2
- 2025Reweighted Flow Matching via Unbalanced OT for Label-free Long-tailed Generationcited by 1
- 2025Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computationcited by 1
- 2026Rethinking the Flow-Based Gradual Domain Adaptation: A Semi-Dual Optimal Transport Perspectivecited by 0
- 2026Conditional Unbalanced Optimal Transport Maps: An Outlier-Robust Framework for Conditional Generative Modelingcited by 0
- 2026UOTIP: Unbalanced Optimal Transport Map for Unpaired Inverse Problemscited by 0
- 2026Simultaneous Neural Optimal Transportcited by 0
- 2026Towards Universal Wasserstein Barycenters through Flow Matchingcited by 0
- 2026Towards Universal Wasserstein Barycenters through Flow Matching29 Sep 2026
- 2026Simultaneous Neural Optimal Transport29 Sep 2026
- 2026UOTIP: Unbalanced Optimal Transport Map for Unpaired Inverse Problems20 May 2026
- 2026Conditional Unbalanced Optimal Transport Maps: An Outlier-Robust Framework for Conditional Generative Modeling7 Mar 2026
- 2026Rethinking the Flow-Based Gradual Domain Adaptation: A Semi-Dual Optimal Transport Perspective1 Feb 2026
- 2025Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computation6 Oct 2025
- 2025Reweighted Flow Matching via Unbalanced OT for Label-free Long-tailed Generation30 Sep 2025
- 2025Schr"odinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentres20 Jun 2025
- 2025Learning of Population Dynamics: Inverse Optimization Meets JKO Scheme2 Jun 2025