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
Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
Gen Li, Yanxi Chen, Yu Huang, Yuejie Chi, H. Vincent Poor, Yuxin Chen
Extremal Domain Translation with Neural Optimal Transport
Milena Gazdieva, Alexander Korotin, Daniil Selikhanovych, Evgeny Burnaev
Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport
Jianheng Tang, Weiqi Zhang, Jiajin Li, Kangfei Zhao, Fugee Tsung, Jia Li
Generative Adversarial Learning of Sinkhorn Algorithm Initializations
Jonathan Geuter, Vaios Laschos
Dynamic and Distributed Optimization for the Allocation of Aerial Swarm Vehicles
Jason Hughes, Dominic Larkin, Charles O'Donnell, Christopher Korpela
Continual Learning with Optimal Transport based Mixture Model
Quyen Tran, Hoang Phan, Khoat Than, Dinh Phung, Trung Le
Taming Hyperparameter Tuning in Continuous Normalizing Flows Using the JKO Scheme
Alexander Vidal, Samy Wu Fung, Luis Tenorio, Stanley Osher, Levon Nurbekyan