TL;DR
This paper introduces DIDA-Net, a novel approach to unsupervised domain adaptation that treats each instance as its own domain, using adaptive convolutional kernels for feature adaptation without relying on domain labels or complex feature alignment.
Contribution
The paper proposes a dynamic instance domain adaptation method with adaptive kernels, enabling effective domain adaptation without domain labels or feature alignment losses.
Findings
Achieves state-of-the-art results on multiple UDA benchmarks.
Effectively handles both single-source and multi-source UDA scenarios.
Simplifies the adaptation process by using a semi-supervised learning paradigm.
Abstract
Most existing studies on unsupervised domain adaptation (UDA) assume that each domain's training samples come with domain labels (e.g., painting, photo). Samples from each domain are assumed to follow the same distribution and the domain labels are exploited to learn domain-invariant features via feature alignment. However, such an assumption often does not hold true -- there often exist numerous finer-grained domains (e.g., dozens of modern painting styles have been developed, each differing dramatically from those of the classic styles). Therefore, forcing feature distribution alignment across each artificially-defined and coarse-grained domain can be ineffective. In this paper, we address both single-source and multi-source UDA from a completely different perspective, which is to view each instance as a fine domain. Feature alignment across domains is thus redundant. Instead, we…
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.
