Towards Backwards-Compatible Data with Confounded Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Most current domain adaptation methods address either covariate shift or label shift, but are not applicable where they occur simultaneously and are confounded with each other. Domain adaptation approaches which do account for such confounding are designed to adapt covariates to optimally predict a particular label whose shift is confounded with covariate shift. In this paper, we instead seek to achieve general-purpose data backwards compatibility. This would allow the adapted covariates to be used for a variety of downstream problems, including on pre-existing prediction models and on data analytics tasks. To do this we consider a modification of generalized label shift (GLS), which we call confounded shift. We present a novel framework for this problem, based on minimizing the expected divergence between the source and target conditional distributions, conditioning on possible confounders. Within this framework, we provide concrete implementations using the Gaussian reverse Kullback-Leibler divergence and the maximum mean discrepancy. Finally, we demonstrate our approach on synthetic and real datasets.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 87 references that are in the map. First posted on arXiv 23 Mar 2022.
Builds on
21 of 87 references.
References · 21
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2017Adversarial Discriminative Domain Adaptationcited by 1,309
- 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 466
- 2016Coupled Generative Adversarial Networkscited by 216
- 2017Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptationcited by 151
- 2020Domain Adaptation with Conditional Distribution Matching and Generalized Label Shiftcited by 124
- 2019Maximum Mean Discrepancy Gradient Flowcited by 123
- 2018Unsupervised Alignment of Embeddings with Wasserstein Procrustescited by 96
- 2018Scalable Unbalanced Optimal Transport using Generative Adversarial Networkscited by 41
9 more
- 2018Gaussian Process Conditional Density Estimationcited by 22
- 2018Generalizing Point Embeddings using the Wasserstein Space of Elliptical Distributionscited by 20
- 2016Removal of Batch Effects using Distribution-Matching Residual Networkscited by 18
- 2018Wasserstein Distributionally Robust Kalman Filteringcited by 17
- 2019Concentration bounds for linear Monge mapping estimation and optimal transport domain adaptationcited by 17
- 2020Rethink Maximum Mean Discrepancy for Domain Adaptationcited by 11
- 2015Feature-Level Domain Adaptationcited by 8
- 2019Learning transport cost from subset correspondencecited by 6
- 2020On a Novel Application of Wasserstein-Procrustes for Unsupervised Cross-Lingual Learningcited by 6
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Unmasking Trees for Tabular Datacited by 4
- 2024Unmasking Trees for Tabular Data8 Jul 2024