Optimal Transport
Optimal transport (OT) is a mathematical framework for efficiently moving probability distributions from one configuration to another while minimizing a cost function, often visualized as the "earth mover's distance." Current research focuses on developing robust and scalable OT algorithms, particularly for high-dimensional data and applications involving noisy or unbalanced distributions, often employing neural networks and Sinkhorn iterations. These advancements are significantly impacting diverse fields, including machine learning (e.g., generative modeling, domain adaptation), image processing, and even economic modeling, by providing powerful tools for data analysis, representation learning, and fair data manipulation.
Papers
Discrete Optimal Transport with Independent Marginals is #P-Hard
Bahar Taşkesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn, Karthik Natarajan
Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman Problem
Yong Liang Goh, Wee Sun Lee, Xavier Bresson, Thomas Laurent, Nicholas Lim
Optimal Transport of Classifiers to Fairness
Maarten Buyl, Tijl De Bie
Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenters
Luc Brogat-Motte, Rémi Flamary, Céline Brouard, Juho Rousu, Florence d'Alché-Buc
On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Error
Quang Minh Nguyen, Hoang H. Nguyen, Yi Zhou, Lam M. Nguyen