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
Revisiting invariances and introducing priors in Gromov-Wasserstein distances
Pinar Demetci, Quang Huy Tran, Ievgen Redko, Ritambhara Singh
Geometry in global coordinates in mechanics and optimal transport
Du Nguyen
Manifold Learning with Sparse Regularised Optimal Transport
Stephen Zhang, Gilles Mordant, Tetsuya Matsumoto, Geoffrey Schiebinger
A generative flow for conditional sampling via optimal transport
Jason Alfonso, Ricardo Baptista, Anupam Bhakta, Noam Gal, Alfin Hou, Isa Lyubimova, Daniel Pocklington, Josef Sajonz, Giulio Trigila, Ryan Tsai
Optimal Transport Posterior Alignment for Cross-lingual Semantic Parsing
Tom Sherborne, Tom Hosking, Mirella Lapata