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
Tree-Sliced Wasserstein Distance on a System of Lines
Viet-Hoang Tran, Trang Pham, Tho Tran, Tam Le, Tan M. Nguyen
Combining Optimal Transport and Embedding-Based Approaches for More Expressiveness in Unsupervised Graph Alignment
Songyang Chen, Yu Liu, Lei Zou, Zexuan Wang, Youfang Lin, Yuxing Chen, Anqun Pan
Progressive Entropic Optimal Transport Solvers
Parnian Kassraie, Aram-Alexandre Pooladian, Michal Klein, James Thornton, Jonathan Niles-Weed, Marco Cuturi
Submodular Framework for Structured-Sparse Optimal Transport
Piyushi Manupriya, Pratik Jawanpuria, Karthik S. Gurumoorthy, SakethaNath Jagarlapudi, Bamdev Mishra