Adversarial Unsupervised Domain Adaptation with Conditional and Label Shift: Infer, Align and Iterate
At a glance
- Citations
- 76
- References
- 96
- Comments
- 0
Abstract
In this work, we propose an adversarial unsupervised domain adaptation (UDA) method under inherent conditional and label shifts, in which we aim to align the distributions w.r.t. both p(x|y) and p(y). Since labels are inaccessible in a target domain, conventional adversarial UDA methods assume that p(y) is invariant across domains and rely on aligning p(x) as an alternative to the p(x|y) alignment. To address this, we provide a thorough theoretical and empirical analysis of the conventional adversarial UDA methods under both conditional and label shifts, and propose a novel and practical alternative optimization scheme for adversarial UDA. Specifically, we infer the marginal p(y) and align p(x|y) iteratively at the training stage, and precisely align the posterior p(y|x) at the testing stage. Our experimental results demonstrate its effectiveness on both classification and segmentation UDA and partial UDA.
Publication details
- DOI
- 10.1109/iccv48922.2021.01020
- OpenAlex
- W3183988645
- Document type
- conference-paper
- Language
- EN
- Source
- 2021 IEEE/CVF International Conference on Computer Vision (ICCV)
- Last metadata update
Comments
Log in to join the discussion.