A Reproducible and Realistic Evaluation of Partial Domain Adaptation Methods
Not on the map. Why?
Abstract (arXiv)
Unsupervised Domain Adaptation (UDA) aims at classifying unlabeled target images leveraging source labeled ones. In this work, we consider the Partial Domain Adaptation (PDA) variant, where we have extra source classes not present in the target domain. Most successful algorithms use model selection strategies that rely on target labels to find the best hyper-parameters and/or models along training. However, these strategies violate the main assumption in PDA: only unlabeled target domain samples are available. Moreover, there are also inconsistencies in the experimental settings - architecture, hyper-parameter tuning, number of runs - yielding unfair comparisons. The main goal of this work is to provide a realistic evaluation of PDA methods with the different model selection strategies under a consistent evaluation protocol. We evaluate 7 representative PDA algorithms on 2 different real-world datasets using 7 different model selection strategies. Our two main findings are: (i) without target labels for model selection, the accuracy of the methods decreases up to 30 percentage points; (ii) only one method and model selection pair performs well on both datasets. Experiments were performed with our PyTorch framework, BenchmarkPDA, which we open source.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 41 references that are in the map. First posted on arXiv 3 Oct 2022.
Builds on
18 of 41 references.
References · 18
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2018Computational Optimal Transportcited by 765
- 2017VisDA: The Visual Domain Adaptation Challengecited by 432
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
- 2018Partial Adversarial Domain Adaptationcited by 127
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
- 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 83
6 more
- 2017Minimal-Entropy Correlation Alignment for Unsupervised Deep Domain Adaptationcited by 70
- 2021Minibatch optimal transport distances; analysis and applicationscited by 62
- 2020A Balanced and Uncertainty-aware Approach for Partial Domain Adaptationcited by 55
- 2021Tune it the Right Way: Unsupervised Validation of Domain Adaptation via Soft Neighborhood Densitycited by 44
- 2021Improving Mini-batch Optimal Transport via Partial Transportationcited by 40
- 2021Unsupervised Domain Adaptation: A Reality Checkcited by 24
Built on by
Not cited yet.