Energy-Guided Continuous Entropic Barycenter Estimation for General Costs
Not on the map. Why?
Abstract (arXiv)
Optimal transport (OT) barycenters are a mathematically grounded way of averaging probability distributions while capturing their geometric properties. In short, the barycenter task is to take the average of a collection of probability distributions w.r.t. given OT discrepancies. We propose a novel algorithm for approximating the continuous Entropic OT (EOT) barycenter for arbitrary OT cost functions. Our approach is built upon the dual reformulation of the EOT problem based on weak OT, which has recently gained the attention of the ML community. Beyond its novelty, our method enjoys several advantageous properties: (i) we establish quality bounds for the recovered solution; (ii) this approach seamlessly interconnects with the Energy-Based Models (EBMs) learning procedure enabling the use of well-tuned algorithms for the problem of interest; (iii) it provides an intuitive optimization scheme avoiding min-max, reinforce and other intricate technical tricks. For validation, we consider several low-dimensional scenarios and image-space setups, including non-Euclidean cost functions. Furthermore, we investigate the practical task of learning the barycenter on an image manifold generated by a pretrained generative model, opening up new directions for real-world applications. Our code is available at https://github.com/justkolesov/EnergyGuidedBarycenters.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 77 of its 121 references that are in the map. First posted on arXiv 2 Oct 2023.
Builds on
77 of 121 references.
References · 77
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,585
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 602
- 2016Input Convex Neural Networkscited by 414
- 2021Domain Adaptation for Medical Image Analysis: A Surveycited by 352
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
- 2021How to Train Your Energy-Based Modelscited by 274
- 2023Reduce, Reuse, Recycle: Compositional Generation with Energy-Based Diffusion Models and MCMCcited by 220
38 more
- 2021Likelihood Training of Schr"odinger Bridge using Forward-Backward SDEs Theorycited by 219
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2023StyleGAN-T: Unlocking the Power of GANs for Fast Large-Scale Text-to-Image Synthesiscited by 212
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2019Universal Approximation with Deep Narrow Networkscited by 200
- 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
- 2016A Theory of Generative ConvNetcited by 174
- 2023Diffusion Schr"odinger Bridge Matchingcited by 153
- 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 141
- 2020Improved Contrastive Divergence Training of Energy Based Modelscited by 130
- 2022Neural Optimal Transportcited by 126
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 123
- 2020Learning Energy-Based Models by Diffusion Recovery Likelihoodcited by 123
- 2019Wasserstein-2 Generative Networkscited by 97
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 96
- 2023Simulation-free Schr"odinger bridges via score and flow matchingcited by 83
- 2021Generative Modeling with Optimal Transport Mapscited by 82
- 2019NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transportcited by 74
- 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 60
- 2017Generalizing Hamiltonian Monte Carlo with Neural Networkscited by 52
- 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 51
- 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 50
- 2022Entropic Neural Optimal Transport via Diffusion Processescited by 50
- 2015Scalable Bayes via Barycenter in Wasserstein Spacecited by 44
- 2021Universal Approximation Theorems for Differentiable Geometric Deep Learningcited by 41
- 2021Neural Monge Map estimation and its applicationscited by 40
- 2017A-NICE-MC: Adversarial Training for MCMCcited by 38
- 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
- 2021Automatic Text Evaluation through the Lens of Wasserstein Barycenterscited by 38
- 2022Neural Optimal Transport with General Cost Functionalscited by 36
- 2020Debiased Sinkhorn barycenterscited by 34
- 2020Entropy-Regularized 2-Wasserstein Distance between Gaussian Measurescited by 32
- 2020Continuous Regularized Wasserstein Barycenterscited by 32
- 2022Kernel Neural Optimal Transportcited by 31
- 2022On amortizing convex conjugates for optimal transportcited by 31
- 2019The Domain Shift Problem of Medical Image Segmentation and Vendor-Adaptation by Unet-GANcited by 30
- 2015A Smoothed Dual Approach for Variational Wasserstein Problemscited by 29
- 2021Wasserstein barycenters are NP-hard to computecited by 28
50 most cited of 77 All 77 (JSON)
Built on by
Citing papers per year: 2024: 3; 2025: 4; 2026: 5.
12 papers.
- 2026Learning Continuous Wasserstein Barycenter Space for Generalized All-in-One Image Restorationcited by 15
- 2024Estimating Barycenters of Distributions with Neural Optimal Transportcited by 14
- 2024Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transportcited by 9
- 2025Learning of Population Dynamics: Inverse Optimization Meets JKO Schemecited by 9
- 2024Low-dimensional approximations of the conditional law of Volterra processes: a non-positive curvature approachcited by 3
- 2025A Statistical Learning Perspective on Semi-dual Adversarial Neural Optimal Transport Solverscited by 2
- 2025Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysiscited by 2
- 2025Schr"odinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentrescited by 2
- 2026Variational Entropic Optimal Transportcited by 1
- 2026Binding Multiple Modalities via Multimodal Wasserstein Barycentercited by 1
- 2026FedDOSE: Federated Learning Framework Decomposing Site Effects for Modeling Brain Dynamic Functional Connectivitycited by 0
- 2026Simultaneous Neural Optimal Transportcited by 0
- 2026Simultaneous Neural Optimal Transport29 Sep 2026
- 2026Binding Multiple Modalities via Multimodal Wasserstein Barycenter27 Sep 2026
- 2026FedDOSE: Federated Learning Framework Decomposing Site Effects for Modeling Brain Dynamic Functional Connectivity7 Aug 2026
- 2026Learning Continuous Wasserstein Barycenter Space for Generalized All-in-One Image Restoration26 Feb 2026
- 2026Variational Entropic Optimal Transport2 Feb 2026
- 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
- 2025Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysis19 May 2025
- 2025A Statistical Learning Perspective on Semi-dual Adversarial Neural Optimal Transport Solvers3 Feb 2025
- 2024Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport4 Oct 2024
- 2024Low-dimensional approximations of the conditional law of Volterra processes: a non-positive curvature approach30 May 2024
- 2024Estimating Barycenters of Distributions with Neural Optimal Transport6 Feb 2024