Wasserstein metric
In mathematics, the Wasserstein distance or Kantorovich–Rubinstein metric is a distance function defined between probability distributions on a given metric space
Wasserstein metric - Wikipedia Jump to content From Wikipedia, the free encyclopedia Distance function defined between probability distributions In mathematics , the Wasserstein distance or Kantorovich – Rubinstein metric is a distance function defined between probability distributions on a given metric space M {\displaystyle M} . It is named after Leonid Vaseršteĭn . Intuitively, if each distribution is viewed as a unit amount of earth (soil) piled on M {\displaystyle M} , the metric is the minimum "cost" of turning one pile into the other, which is assumed to be the amount of earth that need
Explore this link on the map →related reading
- Quick start guide - POT Python Optimal Transport 0.9.5 documentationpythonot.github.io
- Mediumamsword.medium.com
- [2405.15441] Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distancesarxiv.org
- 0907.4178arxiv.org
- Six (and a half) intuitions for KL divergence — LessWronglesswrong.com
- Kullback–Leibler divergence - Wikipediaen.wikipedia.org
- Levenshtein distance - Wikipediaen.wikipedia.org
- Your Transformer is Secretly an EOT Solver | Elements of a Vector Spaceelonlit.com
- [2505.06589v1] Optimal Transport for Machine Learnersarxiv.org
- Lewis Smith - A gentle introduction to information geometryrobots.ox.ac.uk
- Short Notes on Divergence Measuresdanilorezende.com
- Napkin.pdfvenhance.github.io