Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift
Remi Tachet, Han Zhao, Yu-Xiang Wang, Geoff Gordon

TL;DR
This paper introduces a generalized label shift assumption to enhance domain adaptation methods, providing theoretical guarantees and practical reweighting techniques that improve performance under label distribution mismatches.
Contribution
It proposes the generalized label shift assumption, offers theoretical transfer guarantees, and develops a reweighting method that improves existing domain adaptation algorithms.
Findings
Improved performance on standard DA tasks with label mismatches
Theoretical guarantees for transfer performance under GLS
Effective reweighting method with low computational overhead
Abstract
Adversarial learning has demonstrated good performance in the unsupervised domain adaptation setting, by learning domain-invariant representations. However, recent work has shown limitations of this approach when label distributions differ between the source and target domains. In this paper, we propose a new assumption, generalized label shift (), to improve robustness against mismatched label distributions. states that, conditioned on the label, there exists a representation of the input that is invariant between the source and target domains. Under , we provide theoretical guarantees on the transfer performance of any classifier. We also devise necessary and sufficient conditions for to hold, by using an estimation of the relative class weights between domains and an appropriate reweighting of samples. Our weight estimation method could be straightforwardly and…
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
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Multimodal Machine Learning Applications · COVID-19 diagnosis using AI
