paper-with-me

Papers

Entropic Gromov-Wasserstein between Gaussian Distributions

2021-08-24 · Khang Le, Dung Le, Huy Nguyen, Dat Do, Tung Pham, Nhat Ho

We study the entropic Gromov-Wasserstein and its unbalanced version between (unbalanced) Gaussian distributions with different dimensions. When the metric is the inner product, which we refer to as inner product Gromov-Wasserstein (IGW), we demonstrate that the optimal transportation plans of entropic IGW and its unbalanced variant are (unbalanced) Gaussian distributions. Via an application of von Neumann's trace inequality, we obtain closed-form expressions for the entropic IGW between these Gaussian distributions. Finally, we consider an entropic inner product Gromov-Wasserstein barycenter of multiple Gaussian distributions. We prove that the barycenter is a Gaussian distribution when the entropic regularization parameter is small. We further derive a closed-form expression for the covariance matrix of the barycenter.

📄 PDF Abstract BibTeX arXiv:2108.10961

Code (0)

등록된 구현이 없습니다.

Tasks

Form

Similar Papers 제목 키워드 기반

Fast Gradient Computation for Gromov-Wasserstein Distance

2024-04-13 · Wei zhang, ZiHao Wang, Jie Fan, Hao Wu 외

The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion unde…

Partial Optimal Transport with Applications on Positive-Unlabeled Learning

2020-02-19 · Laetitia Chapel, Mokhtar Z. Alaya, Gilles Gasso

Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be too restrictive in certain applications…

Gromov-Wasserstein-like Distances in the Gaussian Mixture Models Space

2023-10-17 · Antoine Salmona, Julie Delon, Agnès Desolneux

The Gromov-Wasserstein (GW) distance is frequently used in machine learning to compare distributions across distinct metric spaces. Despite its utility, it remains computationally intensive, especially for large-scale pr…

The Joint Gromov Wasserstein Objective for Multiple Object Matching

2025-11-21 · Aryan Tajmir Riahi, Khanh Dao Duc arxiv

The Gromov-Wasserstein (GW) distance serves as a powerful tool for matching objects in metric spaces. However, its traditional formulation is constrained to pairwise matching between single objects, limiting its utility …

Computational Efficiency

Entropic regularization of Wasserstein distance between infinite-dimensional Gaussian measures and Gaussian processes

2020-11-15 · Minh Ha Quang

This work studies the entropic regularization formulation of the 2-Wasserstein distance on an infinite-dimensional Hilbert space, in particular for the Gaussian setting. We first present the Minimum Mutual Information pr…

Gaussian Processesvalid