The reviewed record of science sign in
Pith

arxiv: 1909.03442 · v1 · pith:4HDNFMQK · submitted 2019-09-08 · cs.LG · cs.CV· stat.ML

CUDA: Contradistinguisher for Unsupervised Domain Adaptation

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:4HDNFMQKrecord.jsonopen to challenge →

classification cs.LG cs.CVstat.ML
keywords domaintargetadaptationalignmentsourceunlabeledunsupervisedctdr
0
0 comments X
read the original abstract

In this paper, we propose a simple model referred as Contradistinguisher (CTDR) for unsupervised domain adaptation whose objective is to jointly learn to contradistinguish on unlabeled target domain in a fully unsupervised manner along with prior knowledge acquired by supervised learning on an entirely different domain. Most recent works in domain adaptation rely on an indirect way of first aligning the source and target domain distributions and then learn a classifier on a labeled source domain to classify target domain. This approach of an indirect way of addressing the real task of unlabeled target domain classification has three main drawbacks. (i) The sub-task of obtaining a perfect alignment of the domain in itself might be impossible due to large domain shift (e.g., language domains). (ii) The use of multiple classifiers to align the distributions unnecessarily increases the complexity of the neural networks leading to over-fitting in many cases. (iii) Due to distribution alignment, the domain-specific information is lost as the domains get morphed. In this work, we propose a simple and direct approach that does not require domain alignment. We jointly learn CTDR on both source and target distribution for unsupervised domain adaptation task using contradistinguish loss for the unlabeled target domain in conjunction with a supervised loss for labeled source domain. Our experiments show that avoiding domain alignment by directly addressing the task of unlabeled target domain classification using CTDR achieves state-of-the-art results on eight visual and four language benchmark domain adaptation datasets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. 3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry

    cs.HC 2026-06 unverdicted novelty 5.0

    Three keys plus GPT-4o disambiguation achieve 9.46% CER and 12.20% WER on a 300-sentence English corpus, positioning 3 keys as a practical minimum.