GeT: Generative Target Structure Debiasing for Domain Adaptation
Can Zhang, Gim Hee Lee

TL;DR
The paper introduces GeT, a novel method for domain adaptation that reduces source and target class distribution biases by learning a non-biased target embedding with high-quality pseudo labels, improving performance across various settings.
Contribution
GeT is the first approach to simultaneously address source bias and target class distribution bias in domain adaptation using generative classifiers and structure similarity regularization.
Findings
Achieves consistent improvements across multiple DA benchmarks.
Effectively mitigates source data bias and target class distribution bias.
Enhances target class discriminability with high-quality pseudo labels.
Abstract
Domain adaptation (DA) aims to transfer knowledge from a fully labeled source to a scarcely labeled or totally unlabeled target under domain shift. Recently, semi-supervised learning-based (SSL) techniques that leverage pseudo labeling have been increasingly used in DA. Despite the competitive performance, these pseudo labeling methods rely heavily on the source domain to generate pseudo labels for the target domain and therefore still suffer considerably from source data bias. Moreover, class distribution bias in the target domain is also often ignored in the pseudo label generation and thus leading to further deterioration of performance. In this paper, we propose GeT that learns a non-bias target embedding distribution with high quality pseudo labels. Specifically, we formulate an online target generative classifier to induce the target distribution into distinctive Gaussian…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
GeT: Generative Target Structure Debiasing for Domain Adaptation· youtube
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Respiratory viral infections research
