Partial Distribution Alignment via Adaptive Optimal Transport
Not on the map. Why?
Abstract (arXiv)
To remedy the drawbacks of full-mass or fixed-mass constraints in classical optimal transport, we propose adaptive optimal transport which is distinctive from the classical optimal transport in its ability of adaptive-mass preserving. It aims to answer the mathematical problem of how to transport the probability mass adaptively between probability distributions, which is a fundamental topic in various areas of artificial intelligence. Adaptive optimal transport is able to transfer mass adaptively in the light of the intrinsic structure of the problem itself. The theoretical results shed light on the adaptive mechanism of mass transportation. Furthermore, we instantiate the adaptive optimal transport in machine learning application to align source and target distributions partially and adaptively by respecting the ubiquity of noises, outliers, and distribution shifts in the data. The experiment results on the domain adaptation benchmarks show that the proposed method significantly outperforms the state-of-the-art algorithms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 46 references that are in the map. First posted on arXiv 7 Mar 2025.
Builds on
28 of 46 references.
References · 28
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2016Identity Mappings in Deep Residual Networkscited by 1,960
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2017VisDA: The Visual Domain Adaptation Challengecited by 432
- 2019Contrastive Adaptation Network for Unsupervised Domain Adaptationcited by 407
- 2018A Survey of Unsupervised Deep Domain Adaptationcited by 361
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
- 2017Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptationcited by 151
16 more
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
- 2019Subspace Robust Wasserstein Distancescited by 89
- 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
- 2022Deep transfer operator learning for partial differential equations under conditional shiftcited by 83
- 2020Adversarial-Learned Loss for Domain Adaptationcited by 65
- 2021Category Contrast for Unsupervised Domain Adaptation in Visual Taskscited by 65
- 2022Supervised Training of Conditional Monge Mapscited by 60
- 2020Vocabulary Learning via Optimal Transport for Neural Machine Translationcited by 58
- 2017Multilevel Clustering via Wasserstein Meanscited by 48
- 2020Outlier-Robust Optimal Transportcited by 45
- 2021Improving Mini-batch Optimal Transport via Partial Transportationcited by 40
- 2022Interpretable bilinear attention network with domain adaptation improves drug-target predictioncited by 39
- 2021On Robust Optimal Transport: Computational Complexity and Barycenter Computationcited by 27
- 2021Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysiscited by 27
- 2023Prototypes-oriented Transductive Few-shot Learning with Conditional Transportcited by 8
Built on by
Not cited yet.