TL;DR
This paper introduces Continuous Domain Adaptation (CDA), a new problem setting where models adapt across infinitely varying domains, and proposes a novel approach with an alternating training strategy, continuity constraints, and domain-specific queues to improve generalization.
Contribution
It formulates the CDA problem and proposes a novel baseline approach with techniques to handle continuous domain variations and improve adaptation performance.
Findings
Achieves state-of-the-art results on CDA benchmarks.
Demonstrates effectiveness of the alternating training strategy.
Shows improved generalization to unseen domains.
Abstract
Existing domain adaptation methods assume that domain discrepancies are caused by a few discrete attributes and variations, e.g., art, real, painting, quickdraw, etc. We argue that this is not realistic as it is implausible to define the real-world datasets using a few discrete attributes. Therefore, we propose to investigate a new problem namely the Continuous Domain Adaptation (CDA) through the lens where infinite domains are formed by continuously varying attributes. Leveraging knowledge of two labeled source domains and several observed unlabeled target domains data, the objective of CDA is to learn a generalized model for whole data distribution with the continuous attribute. Besides the contributions of formulating a new problem, we also propose a novel approach as a strong CDA baseline. To be specific, firstly we propose a novel alternating training strategy to reduce…
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.
