We study the complexity of approximating the multimarginal optimal transport (MOT) distance, a generalization of the classical optimal transport distance, considered here …
We study multi-marginal optimal transport problems from a probabilistic graphical model perspective. We point out an elegant connection between the two when the underlying cost …
We consider stochastic convex optimization problems with affine constraints and develop several methods using either primal or dual approach to solve it. In the primal case, we use …
J Altschuler, S Chewi, PR Gerber… - Advances in Neural …, 2021 - proceedings.neurips.cc
We study first-order optimization algorithms for computing the barycenter of Gaussian distributions with respect to the optimal transport metric. Although the objective is …
Computing Wasserstein barycenters (aka optimal transport barycenters) is a fundamental problem in geometry which has recently attracted considerable attention due to many …
A Mallasto, A Gerolin, HQ Minh - Information Geometry, 2022 - Springer
Gaussian distributions are plentiful in applications dealing in uncertainty quantification and diffusivity. They furthermore stand as important special cases for frameworks providing …
The optimal transport problem has recently developed into a powerful framework for various applications in estimation and control. Many of the recent advances in the theory and …
We study the fixed-support Wasserstein barycenter problem (FS-WBP), which consists in computing the Wasserstein barycenter of $ m $ discrete probability measures supported on …
T Vaskevicius, L Chizat - Advances in Neural Information …, 2024 - proceedings.neurips.cc
We study the computation of doubly regularized Wasserstein barycenters, a recently introduced family of entropic barycenters governed by inner and outer regularization …