mlsanityData to 14 Oct 2026

Energy-Guided Continuous Entropic Barycenter Estimation for General Costs

arXiv 2310.01105 ↗First posted 2 Oct 2023cs.LG stat.MLcited by 12

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

  1. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
  2. 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,585
  3. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
  4. 2014Deep Learning Face Attributes in the Wildcited by 3,693
  5. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  6. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
  7. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 602
  8. 2016Input Convex Neural Networkscited by 414
  9. 2021Domain Adaptation for Medical Image Analysis: A Surveycited by 352
  10. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
  11. 2021How to Train Your Energy-Based Modelscited by 274
  12. 2023Reduce, Reuse, Recycle: Compositional Generation with Energy-Based Diffusion Models and MCMCcited by 220
38 more
  1. 2021Likelihood Training of Schr"odinger Bridge using Forward-Backward SDEs Theorycited by 219
  2. 2013Fast Computation of Wasserstein Barycenterscited by 216
  3. 2023StyleGAN-T: Unlocking the Power of GANs for Fast Large-Scale Text-to-Image Synthesiscited by 212
  4. 2019Optimal transport mapping via input convex neural networkscited by 206
  5. 2019Universal Approximation with Deep Narrow Networkscited by 200
  6. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
  7. 2016A Theory of Generative ConvNetcited by 174
  8. 2023Diffusion Schr"odinger Bridge Matchingcited by 153
  9. 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 141
  10. 2020Improved Contrastive Divergence Training of Energy Based Modelscited by 130
  11. 2022Neural Optimal Transportcited by 126
  12. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 123
  13. 2020Learning Energy-Based Models by Diffusion Recovery Likelihoodcited by 123
  14. 2019Wasserstein-2 Generative Networkscited by 97
  15. 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 96
  16. 2023Simulation-free Schr"odinger bridges via score and flow matchingcited by 83
  17. 2021Generative Modeling with Optimal Transport Mapscited by 82
  18. 2019NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transportcited by 74
  19. 2021Score-based Generative Neural Networks for Large-Scale Optimal Transportcited by 60
  20. 2017Generalizing Hamiltonian Monte Carlo with Neural Networkscited by 52
  21. 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 51
  22. 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 50
  23. 2022Entropic Neural Optimal Transport via Diffusion Processescited by 50
  24. 2015Scalable Bayes via Barycenter in Wasserstein Spacecited by 44
  25. 2021Universal Approximation Theorems for Differentiable Geometric Deep Learningcited by 41
  26. 2021Neural Monge Map estimation and its applicationscited by 40
  27. 2017A-NICE-MC: Adversarial Training for MCMCcited by 38
  28. 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
  29. 2021Automatic Text Evaluation through the Lens of Wasserstein Barycenterscited by 38
  30. 2022Neural Optimal Transport with General Cost Functionalscited by 36
  31. 2020Debiased Sinkhorn barycenterscited by 34
  32. 2020Entropy-Regularized 2-Wasserstein Distance between Gaussian Measurescited by 32
  33. 2020Continuous Regularized Wasserstein Barycenterscited by 32
  34. 2022Kernel Neural Optimal Transportcited by 31
  35. 2022On amortizing convex conjugates for optimal transportcited by 31
  36. 2019The Domain Shift Problem of Medical Image Segmentation and Vendor-Adaptation by Unet-GANcited by 30
  37. 2015A Smoothed Dual Approach for Variational Wasserstein Problemscited by 29
  38. 2021Wasserstein barycenters are NP-hard to computecited by 28

50 most cited of 77 All 77 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 5.

12 papers.