Elastic Optimal Transport: Theory, Application, and Empirical Evaluation
Pei Yang, Yuhang Zhuang, Qi Tan
Abstract
The classical optimal transport such as Kantorovich's optimal transport and partial optimal transport could be too restrictive in applications due to the full-mass or fixed-mass preservation constraints. To remedy this limitation, we propose elastic optimal transport (ELOT) which is distinctive from the classical optimal transport in its ability of adaptive-mass preserving. It aims to answer the problem of how to transport the probability mass adaptively between probability distributions, which is a fundamental topic in various areas of artificial intelligence. The strength of elastic optimal transport is its capability to transport adaptive-mass in the light of the geometry structure of the problem itself. As an application example in machine learning, we apply elastic optimal transport to both unsupervised domain adaptation and partial domain adaptation tasks. It adaptively transports masses from source domain to target domain by taking domain shift into consideration and respecting the ubiquity of noises or outliers in the data, in order to improve the generalization performance. The experiment results on the benchmarks show that ELOT significantly outperforms the state-of-the-art methods. As a powerful distribution matching tool, elastic optimal transport might be of interests to the broad areas such as artificial intelligence, healthcare, physics, operations research, urban science, etc. The source code is available in the supplementary material.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on8
- Moment Matching for Multi-Source Domain AdaptationXingchao Peng, Qinxun Bai, Xide Xia, Zijun Huang et al.ICCV 2019 · 2,239 citations
- Adversarial-Learned Loss for Domain AdaptationMinghao Chen, Shuai Zhao, Haifeng Liu, Deng CaiAAAI 2020 · 195 citations
- Unbalanced minibatch Optimal Transport; applications to Domain AdaptationKilian Fatras, Thibault Séjourné, Rémi Flamary, Nicolas CourtyICML 2021 · 183 citations
- Category Contrast for Unsupervised Domain Adaptation in Visual TasksJiaxing Huang, Dayan Guan, Aoran Xiao, Shijian Lu et al.CVPR 2022 · 143 citations
- Robust Optimal Transport with Applications in Generative Modeling and Domain AdaptationYogesh Balaji, Rama Chellappa, Soheil FeiziNeurIPS 2020 · 141 citations
Related papers
- Probability-Polarized Optimal Transport for Unsupervised Domain AdaptationYan Wang, Chuan-Xian Ren, Yi-Ming Zhai, You-Wei Luo et al.AAAI 2024 · 8 citations
- MOT: Masked Optimal Transport for Partial Domain AdaptationYou-Wei Luo, Chuan-Xian RenCVPR 2023
- Prototypical Partial Optimal Transport for Universal Domain AdaptationYucheng Yang, Xiang Gu, Jian SunAAAI 2023 · 21 citations
- Partial Optimal Tranport with applications on Positive-Unlabeled LearningLaetitia Chapel, Mokhtar Z. Alaya, Gilles GassoNeurIPS 2020 · 30 citations
- On Partial Optimal Transport: Revising the Infeasibility of Sinkhorn and Efficient Gradient MethodsAnh Duc Nguyen, Tuan Dung Nguyen, Quang Minh Nguyen, Hoang H. Nguyen et al.AAAI 2024 · 6 citations
