Deep multi-Wasserstein unsupervised domain adaptation
In unsupervised domain adaptation (DA), 1 aims at learning from labeled source data and fully unlabeled target examples a model with a low error on the target domain. In this setting, standard generalization bounds prompt us to minimize the sum of three terms: (a) the source true risk, (b) the divergence be- tween the source and target domains, and (c) the combined error of the ideal joint hypothesis over the two domains. Many DA methods – especially those using deep neural networks – have focused on the first two terms by using different divergence measures to align the source and target distributions on a shared latent feature space, while ignoring the third term, assuming it is negligible to perform the adaptation. However, it has been shown that purely aligning the two distributions while minimizing the source error may lead to so-called negative transfer . In this paper, we address this issue with a new deep unsupervised DA method – called MCDA – minimizing the first two terms while controlling the third one. MCDA benefits from highly-confident target samples (using softmax predictions) to minimize class- wise Wasserstein distances and efficiently approximate the ideal joint hypothesis. Empirical results show that our approach outperforms state of the art methods.
Code (2)
Tasks
Domain AdaptationGeneralization BoundsUnsupervised Domain AdaptationSimilar Papers 제목 키워드 기반
Unsupervised learning of multimodal image registration using domain adaptation with projected Earth Move's discrepancies
Multimodal image registration is a very challenging problem for deep learning approaches. Most current work focuses on either supervised learning that requires labelled training scans and may yield models that bias towar…
Domain AdaptationImage RegistrationUnsupervised Domain AdaptationUnsupervised learning of multimodal image registration using domain adaptation with projected Earth Mover’s discrepancies
Multimodal image registration is a very challenging problem for deep learning approaches. Most current work focuses on either supervised learning that requires labelled training scans and may yield models that bias towar…
Domain AdaptationImage RegistrationUnsupervised Domain AdaptationSliced Wasserstein Discrepancy for Unsupervised Domain Adaptation
In this work, we connect two distinct concepts for unsupervised domain adaptation: feature distribution alignment between domains by utilizing the task-specific decision boundary and the Wasserstein metric. Our proposed …
Domain AdaptationGeneral Classificationimage-classificationImage Classification+4Unsupervised Wasserstein Distance Guided Domain Adaptation for 3D Multi-Domain Liver Segmentation
Deep neural networks have shown exceptional learning capability and generalizability in the source domain when massive labeled data is provided. However, the well-trained models often fail in the target domain due to the…
DisentanglementDomain AdaptationLiver SegmentationRepresentation Learning+2Sliced Wasserstein Discrepancy in Disentangling Representation and Adaptation Networks for Unsupervised Domain Adaptation
This paper introduces DRANet-SWD, an extension of existing work that disentangles content and style representations of images for unsupervised domain adaptation (UDA). The approach builds upon DRANet by incorporating the…
Domain AdaptationUnsupervised Domain Adaptation