Computational Optimal Transport
Gabriel Peyr\'e, Marco Cuturi

TL;DR
Optimal transport is a mathematical framework for comparing and transforming probability distributions, with recent scalable algorithms enabling its widespread application across imaging, computer vision, graphics, and machine learning.
Contribution
This paper reviews numerical methods for optimal transport and discusses their theoretical properties and applications in data sciences.
Findings
Recent scalable OT algorithms enable large-scale data applications
OT provides effective tools for image and shape processing
Theoretical properties of OT support diverse data science tasks
Abstract
Optimal transport (OT) theory can be informally described using the words of the French mathematician Gaspard Monge (1746-1818): A worker with a shovel in hand has to move a large pile of sand lying on a construction site. The goal of the worker is to erect with all that sand a target pile with a prescribed shape (for example, that of a giant sand castle). Naturally, the worker wishes to minimize her total effort, quantified for instance as the total distance or time spent carrying shovelfuls of sand. Mathematicians interested in OT cast that problem as that of comparing two probability distributions, two different piles of sand of the same volume. They consider all of the many possible ways to morph, transport or reshape the first pile into the second, and associate a "global" cost to every such transport, using the "local" consideration of how much it costs to move a grain of sand…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Computational Optimal Transport· youtube
Taxonomy
TopicsData Management and Algorithms
