Unsupervised Domain Adaptation Based on the Predictive Uncertainty of Models
Not on the map. Why?
Abstract (arXiv)
Unsupervised domain adaptation (UDA) aims to improve the prediction performance in the target domain under distribution shifts from the source domain. The key principle of UDA is to minimize the divergence between the source and the target domains. To follow this principle, many methods employ a domain discriminator to match the feature distributions. Some recent methods evaluate the discrepancy between two predictions on target samples to detect those that deviate from the source distribution. However, their performance is limited because they either match the marginal distributions or measure the divergence conservatively. In this paper, we present a novel UDA method that learns domain-invariant features that minimize the domain divergence. We propose model uncertainty as a measure of the domain divergence. Our UDA method based on model uncertainty (MUDA) adopts a Bayesian framework and provides an efficient way to evaluate model uncertainty by means of Monte Carlo dropout sampling. Empirical results on image recognition tasks show that our method is superior to existing state-of-the-art methods. We also extend MUDA to multi-source domain adaptation problems.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 49 references that are in the map. First posted on arXiv 16 Nov 2022.
Builds on
29 of 49 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2017Adversarial Discriminative Domain Adaptationcited by 1,309
- 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 682
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
17 more
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
- 2019Semi-supervised Domain Adaptation via Minimax Entropycited by 333
- 2016Domain Separation Networkscited by 317
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2016Coupled Generative Adversarial Networkscited by 216
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
- 2015Simultaneous Deep Transfer Across Domains and Taskscited by 205
- 2018Multi-Adversarial Domain Adaptationcited by 195
- 2017Generate To Adapt: Aligning Domains using Generative Adversarial Networkscited by 183
- 2015Bayesian Convolutional Neural Networks with Bernoulli Approximate Variational Inferencecited by 159
- 2020Domain Adaptive Ensemble Learningcited by 156
- 2018Deep Cocktail Network: Multi-source Unsupervised Domain Adaptation with Category Shiftcited by 109
- 2017Adversarial Dropout Regularizationcited by 106
- 2020Dual Mixup Regularized Learning for Adversarial Domain Adaptationcited by 99
- 2019Multi-source Distilling Domain Adaptationcited by 73
- 2019Unsupervised Visual Domain Adaptation: A Deep Max-Margin Gaussian Process Approachcited by 13
- 2021An Unsupervised Domain Adaptation Model based on Dual-module Adversarial Trainingcited by 10
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.