Partial Domain Adaptation without Domain Alignment
Weikai Li, Songcan Chen

TL;DR
This paper introduces a novel approach for partial domain adaptation that avoids domain alignment by focusing on model smoothness, specifically through intra-domain structure preservation, leading to improved performance on benchmarks.
Contribution
It proposes the first method to address partial domain adaptation without domain alignment, emphasizing model smoothness via intra-domain structure preservation.
Findings
Outperforms state-of-the-art methods on multiple benchmarks
Achieves up to +10% accuracy improvements
Demonstrates effectiveness without domain alignment
Abstract
Unsupervised domain adaptation (UDA) aims to transfer knowledge from a well-labeled source domain to a different but related unlabeled target domain with identical label space. Currently, the main workhorse for solving UDA is domain alignment, which has proven successful. However, it is often difficult to find an appropriate source domain with identical label space. A more practical scenario is so-called partial domain adaptation (PDA) in which the source label set or space subsumes the target one. Unfortunately, in PDA, due to the existence of the irrelevant categories in the source domain, it is quite hard to obtain a perfect alignment, thus resulting in mode collapse and negative transfer. Although several efforts have been made by down-weighting the irrelevant source categories, the strategies used tend to be burdensome and risky since exactly which irrelevant categories are…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and ELM · Multimodal Machine Learning Applications
