Wasserstein distance

E970674 UNEXPLORED

Wasserstein distance is a metric from optimal transport theory that measures the minimal “cost” of transforming one probability distribution into another, widely used to compare distributions in statistics and machine learning.

Try in SPARQL Jump to: Surface forms Disambiguation Referenced by

All labels observed (8)

Label	Occurrences
Wasserstein distances	2
Kantorovich metric	1
Kantorovich–Rubinstein metric	1
Wasserstein distance canonical	1
Wasserstein metric	1
Wasserstein-1 distance	1
Wasserstein-p distance	1
Wasserstein-p distances	1

How this entity was disambiguated

This entity first appeared as the object of triple T12207436 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Wasserstein distance
Context triple: [Wasserstein GAN, basedOn, Wasserstein distance]

A. Hellinger distance
Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
B. Wasserstein GAN
Wasserstein GAN is a variant of generative adversarial networks that improves training stability and sample quality by optimizing the Wasserstein (Earth Mover’s) distance between real and generated data distributions.
C. Optimal Transport: Old and New
"Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
D. Kolmogorov distance
Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
E. Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Wasserstein distance
Target entity description: Wasserstein distance is a metric from optimal transport theory that measures the minimal “cost” of transforming one probability distribution into another, widely used to compare distributions in statistics and machine learning.

A. Hellinger distance
Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
B. Wasserstein GAN
Wasserstein GAN is a variant of generative adversarial networks that improves training stability and sample quality by optimizing the Wasserstein (Earth Mover’s) distance between real and generated data distributions.
C. Optimal Transport: Old and New
"Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
D. Kolmogorov distance
Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
E. Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
F. None of above. chosen