paper-with-me

Papers

Heterogeneous Wasserstein Discrepancy for Incomparable Distributions

2021-06-04 · Mokhtar Z. Alaya, Gilles Gasso, Maxime Berar, Alain Rakotomamonjy

Optimal Transport (OT) metrics allow for defining discrepancies between two probability measures. Wasserstein distance is for longer the celebrated OT-distance frequently-used in the literature, which seeks probability distributions to be supported on the $\textit{same}$ metric space. Because of its high computational complexity, several approximate Wasserstein distances have been proposed based on entropy regularization or on slicing, and one-dimensional Wassserstein computation. In this paper, we propose a novel extension of Wasserstein distance to compare two incomparable distributions, that hinges on the idea of $\textit{distributional slicing}$, embeddings, and on computing the closed-form Wassertein distance between the sliced distributions. We provide a theoretical analysis of this new divergence, called $\textit{heterogeneous Wasserstein discrepancy (HWD)}$, and we show that it preserves several interesting properties including rotation-invariance. We show that the embeddings involved in HWD can be efficiently learned. Finally, we provide a large set of experiments illustrating the behavior of HWD as a divergence in the context of generative modeling and in query framework.

📄 PDF Abstract BibTeX arXiv:2106.02542

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Entropy Regularization 설명 없음

Similar Papers 제목 키워드 기반

Learning Autoencoders with Relational Regularization

2020-02-07 · ICML 2020 1 · Hongteng Xu, Dixin Luo, Ricardo Henao, Svati Shah 외

A new algorithmic framework is proposed for learning autoencoders of data distributions. We minimize the discrepancy between the model and target distributions, with a \emph{relational regularization} on the learnable la…

MULTI-VIEW LEARNING

Learning Generative Models across Incomparable Spaces

2019-05-14 · Charlotte Bunne, David Alvarez-Melis, Andreas Krause, Stefanie Jegelka

Generative Adversarial Networks have shown remarkable success in learning a distribution that faithfully recovers a reference distribution in its entirety. However, in some cases, we may want to only learn some aspects (…

Relational Reasoning

A contribution to Optimal Transport on incomparable spaces

2020-11-09 · Titouan Vayer

Optimal Transport is a theory that allows to define geometrical notions of distance between probability distributions and to find correspondences, relationships, between sets of points. Many machine learning applications…

BIG-bench Machine LearningDomain Adaptation

Unbalanced CO-Optimal Transport

2022-05-30 · Quang Huy Tran, Hicham Janati, Nicolas Courty, Rémi Flamary 외

Optimal transport (OT) compares probability distributions by computing a meaningful alignment between their samples. CO-optimal transport (COOT) takes this comparison further by inferring an alignment between features as…

Domain Adaptation

Sliced Gromov-Wasserstein

2019-05-24 · NeurIPS 2019 12 · Titouan Vayer, Rémi Flamary, Romain Tavenard, Laetitia Chapel 외

Recently used in various machine learning contexts, the Gromov-Wasserstein distance (GW) allows for comparing distributions whose supports do not necessarily lie in the same metric space. However, this Optimal Transport …