Energy-Guided Continuous Entropic Barycenter Estimation for General Costs
Alexander Kolesov, Petr Mokrov, Igor Udovichenko, Milena Gazdieva,, Gudmund Pammer, Anastasis Kratsios, Evgeny Burnaev, Alexander Korotin

TL;DR
This paper introduces a novel algorithm for approximating continuous Entropic OT barycenters with arbitrary costs, leveraging dual reformulation and energy-based models, applicable to low-dimensional and image data.
Contribution
It presents a new energy-guided method for continuous Entropic OT barycenter estimation that avoids complex min-max procedures and connects with energy-based models.
Findings
Provides quality bounds for solutions.
Effective in low-dimensional and image-space scenarios.
Enables learning barycenters on image manifolds.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Adversarial Robustness in Machine Learning · Model Reduction and Neural Networks
