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
Instance-Dependent Generalization Bounds via Optimal Transport
Songyan Hou, Parnian Kassraie, Anastasis Kratsios, Andreas Krause, Jonas Rothfuss
Geodesic Sinkhorn for Fast and Accurate Optimal Transport on Manifolds
Guillaume Huguet, Alexander Tong, María Ramos Zapatero, Christopher J. Tape, Guy Wolf, Smita Krishnaswamy
Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptation
Peide Huang, Mengdi Xu, Jiacheng Zhu, Laixi Shi, Fei Fang, Ding Zhao
Mid-attribute speaker generation using optimal-transport-based interpolation of Gaussian mixture models
Aya Watanabe, Shinnosuke Takamichi, Yuki Saito, Detai Xin, Hiroshi Saruwatari