#wasserstein

1 articles

01 ·Probability & Statistics·★ MEMBER·PAPER·11 min read Optimal Transport — The Mathematics of Moving Distributions Optimal transport measures the distance between two probability distributions as the cheapest way to haul sand from one pile into the shape of another. From the definition of the Wasserstein distance to the Sinkhorn algorithm that makes it practical, and on to WGAN, FID and Flow Matching — with numpy code and the failure modes that bite in production.