Entropic Optimal Transport between Unbalanced Gaussian Measures has a Closed Form
Hicham Janati, Boris Muzellec, Gabriel Peyré, Marco Cuturi
摘要
Although optimal transport (OT) problems admit closed form solutions in a very few notable cases, e.g. in 1D or between Gaussians, these closed forms have proved extremely fecund for practitioners to define tools inspired from the OT geometry. On the other hand, the numerical resolution of OT problems using entropic regularization has given rise to many applications, but because there are no known closed-form solutions for entropic regularized OT problems, these approaches are mostly algorithmic, not informed by elegant closed forms. In this paper, we propose to fill the void at the intersection between these two schools of thought in OT by proving that the entropy-regularized optimal transport problem between two Gaussian measures admits a closed form. Contrary to the unregularized case, for which the explicit form is given by the Wasserstein-Bures distance, the closed form we obtain is differentiable everywhere, even for Gaussians with degenerate covariance matrices. We obtain this closed form solution by solving the fixed-point equation behind Sinkhorn's algorithm, the default method for computing entropic regularized OT. Remarkably, this approach extends to the generalized unbalanced case -where Gaussian measures are scaled by positive constants. This extension leads to a closed form expression for unbalanced Gaussians as well, and highlights the mass transportation / destruction trade-off seen in unbalanced optimal transport. Moreover, in both settings, we show that the optimal transportation plans are (scaled) Gaussians and provide analytical formulas of their parameters. These formulas constitute the first non-trivial closed forms for entropy-regularized optimal transport, thus providing a ground truth for the analysis of entropic OT and Sinkhorn's algorithm. 34th Conference on Neural Information Processing Systems (NeurIPS 2020),
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper23
- Faster Wasserstein Distance Estimation with the Sinkhorn DivergenceLénaïc Chizat, Pierre Roussillon, Flavien Léger, François-Xavier Vialard 等NeurIPS 2020 · 被引用 164 次
- Score-based Generative Neural Networks for Large-Scale Optimal TransportGrady Daniels, Tyler Maunu, Paul HandNeurIPS 2021 · 被引用 101 次
- Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentJason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. StrommeNeurIPS 2021 · 被引用 60 次
- Entropic Neural Optimal Transport via Diffusion ProcessesNikita Gushchin, Alexander Kolesov, Alexander Korotin, Dmitry P. Vetrov 等NeurIPS 2023 · 被引用 59 次
- Online Sinkhorn: Optimal Transport distances from sample streamsArthur Mensch, Gabriel PeyréNeurIPS 2020 · 被引用 35 次
它引用的顶会 Paper1
相关 Paper
- On Unbalanced Optimal Transport: An Analysis of Sinkhorn AlgorithmKhiem Pham, Khang Le, Nhat Ho, Tung Pham 等ICML 2020 · 被引用 104 次
- Entropic Gromov-Wasserstein between Gaussian DistributionsKhang Le, Dung Q. Le, Huy Nguyen, Dat Do 等ICML 2022 · 被引用 21 次
- Optimal Transport with Tempered Exponential MeasuresEhsan Amid, Frank Nielsen, Richard Nock, Manfred K. WarmuthAAAI 2024 · 被引用 4 次
- Sparsity-Constrained Optimal TransportTianlin Liu, Joan Puigcerver, Mathieu BlondelICLR 2023 · 被引用 3 次
- Regularized Optimal Transport is Ground Cost AdversarialFrançois-Pierre Paty, Marco CuturiICML 2020 · 被引用 33 次
