paper-with-me

Papers

Relative-Translation Invariant Wasserstein Distance

2024-09-04 · Binshuai Wang, Qiwei Di, Ming Yin, Mengdi Wang, Quanquan Gu, Peng Wei

We introduce a new family of distances, relative-translation invariant Wasserstein distances ($RW_p$), for measuring the similarity of two probability distributions under distribution shift. Generalizing it from the classical optimal transport model, we show that $RW_p$ distances are also real distance metrics defined on the quotient set $\mathcal{P}_p(\mathbb{R}^n)/\sim$ and invariant to distribution translations. When $p=2$, the $RW_2$ distance enjoys more exciting properties, including decomposability of the optimal transport model, translation-invariance of the $RW_2$ distance, and a Pythagorean relationship between $RW_2$ and the classical quadratic Wasserstein distance ($W_2$). Based on these properties, we show that a distribution shift, measured by $W_2$ distance, can be explained in the bias-variance perspective. In addition, we propose a variant of the Sinkhorn algorithm, named $RW_2$ Sinkhorn algorithm, for efficiently calculating $RW_2$ distance, coupling solutions, as well as $W_2$ distance. We also provide the analysis of numerical stability and time complexity for the proposed algorithm. Finally, we validate the $RW_2$ distance metric and the algorithm performance with three experiments. We conduct one numerical validation for the $RW_2$ Sinkhorn algorithm and show two real-world applications demonstrating the effectiveness of using $RW_2$ under distribution shift: digits recognition and similar thunderstorm detection. The experimental results report that our proposed algorithm significantly improves the computational efficiency of Sinkhorn in certain practical applications, and the $RW_2$ distance is robust to distribution translations compared with baselines.

📄 PDF Abstract BibTeX arXiv:2409.02416

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyTranslation

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Relative Wasserstein Angle and the Problem of the $W_2$-Nearest Gaussian Distribution

2026-01-29 · Binshuai Wang, Peng Wei arxiv

We study the problem of quantifying how far an empirical distribution deviates from Gaussianity under the framework of optimal transport. By exploiting the cone geometry of the relative translation invariant quadratic Wa…

Generating valid Euclidean distance matrices

2019-10-07 · Moritz Hoffmann, Frank Noé

Generating point clouds, e.g., molecular structures, in arbitrary rotations, translations, and enumerations remains a challenging task. Meanwhile, neural networks utilizing symmetry invariant layers have been shown to be…

Translationvalid

Wasserstein Distance Guided Representation Learning for Domain Adaptation

2017-07-05 · Jian Shen, Yanru Qu, Wei-Nan Zhang, Yong Yu

Domain adaptation aims at generalizing a high-performance learner on a target domain via utilizing the knowledge distilled from a source domain which has a different but related data distribution. One solution to domain …

Domain AdaptationGeneral Classificationimage-classificationImage Classification+1

Permutation invariant networks to learn Wasserstein metrics

2020-10-12 · NeurIPS Workshop TDA_and_Beyond 2020 12 · Arijit Sehanobish, Neal Ravindra, David van Dijk

Understanding the space of probability measures on a metric space equipped with a Wasserstein distance is one of the fundamental questions in mathematical analysis. The Wasserstein metric has received a lot of attention …

Learning Domain Invariant Representations by Joint Wasserstein Distance Minimization

2021-06-09 · Léo Andeol, Yusei Kawakami, Yuichiro Wada, Takafumi Kanamori 외

Domain shifts in the training data are common in practical applications of machine learning; they occur for instance when the data is coming from different sources. Ideally, a ML model should work well independently of t…