English
Related papers

Related papers: Quasi Manhattan Wasserstein Distance

200 papers

Distances between probability distributions that take into account the geometry of their sample space,like the Wasserstein or the Maximum Mean Discrepancy (MMD) distances have received a lot of attention in machine learning as they can, for…

Machine Learning · Computer Science 2020-04-29 Gaëtan Hadjeres , Frank Nielsen

Making sense of Wasserstein distances between discrete measures in high-dimensional settings remains a challenge. Recent work has advocated a two-step approach to improve robustness and facilitate the computation of optimal transport, using…

Machine Learning · Computer Science 2019-09-04 François-Pierre Paty , Marco Cuturi

Multiple marginal matching problem aims at learning mappings to match a source domain to multiple target domains and it has attracted great attention in many applications, such as multi-domain image translation. However, addressing this…

Machine Learning · Computer Science 2019-11-05 Jiezhang Cao , Langyuan Mo , Yifan Zhang , Kui Jia , Chunhua Shen , Mingkui Tan

Manifold distances are very effective tools for visual object recognition. However, most of the traditional manifold distances between images are based on the pixel-level comparison and thus easily affected by image rotations and…

Computer Vision and Pattern Recognition · Computer Science 2016-05-13 Fengfu Li , Xiayuan Huang , Hong Qiao , Bo Zhang

We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular in many areas of statistics and machine learning. We give the first minimax-optimal rates…

Statistics Theory · Mathematics 2020-04-30 Jonathan Niles-Weed , Quentin Berthet

This article presents a new distance for measuring shape dissimilarity between objects. Recent publications introduced the use of eigenvalues of the Laplace operator as compact shape descriptors. Here, we revisit the eigenvalues to define a…

Computer Vision and Pattern Recognition · Computer Science 2015-03-20 Ender Konukoglu , Ben Glocker , Antonio Criminisi , Kilian M. Pohl

In this work we analyse a number of variants of the Wasserstein distance which allow to focus the classification on the prescribed parts (fragments) of classified 2D curves. These variants are based on the use of a number of discrete…

Computer Vision and Pattern Recognition · Computer Science 2026-01-13 Agnieszka Kaliszewska , Monika Syga

The word mover's distance (WMD) is a popular semantic similarity metric for two texts. This position paper studies several possible extensions of WMD. We experiment with the frequency of words in the corpus as a weighting factor and the…

Computation and Language · Computer Science 2022-02-09 Ilya Smirnov , Ivan P. Yamshchikov

Optimal transport distances, otherwise known as Wasserstein distances, have recently drawn ample attention in computer vision and machine learning as a powerful discrepancy measure for probability distributions. The recent developments on…

Machine Learning · Computer Science 2015-11-11 Soheil Kolouri , Yang Zou , Gustavo K. Rohde

In this article, we represent the Wasserstein metric of order $p$, where $p\in [1,\infty)$, in terms of the comonotonicity copula, for the case of probability measures on $\R^d$, by revisiting existing results. In 1973, Vallender…

Probability · Mathematics 2023-07-18 Mariem Abdellatif , Peter Kuchling , Barbara Rüdiger , Irene Ventura

We consider the Wasserstein metric on the Gaussian mixture models (GMMs), which is defined as the pullback of the full Wasserstein metric on the space of smooth probability distributions with finite second moment. It derives a class of…

Probability · Mathematics 2023-09-25 Wuchen Li , Jiaxi Zhao

Distance metrics are central to machine learning, yet distances between ensembles of quantum states remain poorly understood due to fundamental quantum measurement constraints. We introduce a hierarchy of integral probability metrics,…

Quantum Physics · Physics 2026-01-30 Jian Yao , Pengtao Li , Xiaohui Chen , Quntao Zhuang

The Word Mover's Distance (WMD) is a metric that measures the semantic dissimilarity between two text documents by computing the cost of moving all words of a source/query document to the most similar words of a target document optimally.…

Machine Learning · Computer Science 2021-03-24 Jesmin Jahan Tithi , Fabrizio Petrini

We study the structure of the support of a doubling measure by analyzing its self-similarity properties, which we estimate using a variant of the $L^1$ Wasserstein distance. We show that measure satisfying certain self-similarity conditions…

Metric Geometry · Mathematics 2014-11-11 Jonas Azzam , Guy David , Tatiana Toro

This paper studies the problem of computing a linear approximation of quadratic Wasserstein distance $W_2$. In particular, we compute an approximation of the negative homogeneous weighted Sobolev norm whose connection to Wasserstein…

Numerical Analysis · Mathematics 2022-03-02 Philip Greengard , Jeremy G. Hoskins , Nicholas F. Marshall , Amit Singer

Wasserstein distance, especially among symmetric positive-definite matrices, has broad and deep influences on development of artificial intelligence (AI) and other branches of computer science. A natural idea is to describe the geometry of…

Differential Geometry · Mathematics 2021-05-12 Yihao Luo , Shiqiang Zhang , Yueqi Cao , Huafei Sun

We elucidate why the 1-Wasserstein distance $W_1$ coincides with the area between the two marginal cumulative distribution functions (CDFs). We first describe the Wasserstein distance in terms of copulas, and then show that $W_1$ with the…

Statistics Theory · Mathematics 2021-11-08 Marco De Angelis , Ander Gray

Seismic signals are typically compared using travel time difference or $L_2$ difference. We propose the Wasserstein metric as an alternative measure of fidelity or misfit in seismology. It exhibits properties from both of the traditional…

Mathematical Physics · Physics 2013-11-20 Bjorn Engquist , Brittany D. Froese

We propose of an improved version of the ubiquitous symmetrization inequality making use of the Wasserstein distance between a measure and its reflection in order to quantify the symmetry of the given measure. An empirical bound on this…

Statistics Theory · Mathematics 2020-01-07 Adam B Kashlak

In this article, we generalize the Wasserstein distance to measures with different masses. We study the properties of such distance. In particular, we show that it metrizes weak convergence for tight sequences. We use this generalized…

Analysis of PDEs · Mathematics 2015-06-05 Benedetto Piccoli , Francesco Rossi
‹ Prev 1 8 9 10 Next ›