A mathematical framework for measuring the minimal cost to transform one probability distribution into another.Optimal transport is a mathematical framework that asks a simple question: what is the most efficient way to move a pile of earth (or any mass) from one location to another, given a cost per unit of distance? In more formal terms, it seeks the minimal cost to transform one probability distribution into another, where 'cost' can be defined in many ways—distance, time, energy, or any other metric. This seemingly abstract problem has become a powerful tool across science, because many processes can be framed as moving mass or information from one state to another.
The problem was first posed by Gaspard Monge in 1781, and later reformulated by Leonid Kantorovich in 1942, who introduced the probabilistic formulation that made it tractable. Kantorovich's work earned him the Nobel Prize in Economics in 1975. The field saw a renaissance in the 1990s with connections to fluid dynamics and geometry.
The core idea is to find a 'transport plan' that matches each infinitesimal piece of mass in the source distribution to a piece in the target distribution, minimizing the total cost. This is not a simple one-to-one matching; it's a global optimization problem that can be solved using linear programming or, more elegantly, through the theory of partial differential equations (the Monge-Ampère equation). The solution often reveals a 'geodesic' path between distributions, and the minimal cost itself defines a metric (the Wasserstein distance) that measures how 'far apart' two distributions are.
It is used in image registration and morphing, economics (matching supply and demand), machine learning (training generative models like GANs), and in physics for modeling granular flows and the evolution of stellar systems.
The Wasserstein distance, derived from optimal transport, is the metric used in the training of Generative Adversarial Networks (GANs), which are responsible for generating realistic deepfakes and AI art.








