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
Adaptive Distribution Calibration for Few-Shot Learning with Hierarchical Optimal Transport
Dandan Guo, Long Tian, He Zhao, Mingyuan Zhou, Hongyuan Zha
VoLTA: Vision-Language Transformer with Weakly-Supervised Local-Feature Alignment
Shraman Pramanick, Li Jing, Sayan Nag, Jiachen Zhu, Hardik Shah, Yann LeCun, Rama Chellappa
Finding NEEMo: Geometric Fitting using Neural Estimation of the Energy Mover's Distance
Ouail Kitouni, Niklas Nolte, Mike Williams
Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplings
Frederike Lübeck, Charlotte Bunne, Gabriele Gut, Jacobo Sarabia del Castillo, Lucas Pelkmans, David Alvarez-Melis
Sparsity-Constrained Optimal Transport
Tianlin Liu, Joan Puigcerver, Mathieu Blondel