Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation
Not on the map. Why?
Abstract (arXiv)
We study an unsupervised domain adaptation problem where the source domain consists of subpopulations defined by the binary label Y and a binary background (or environment) A. We focus on a challenging setting in which one such subpopulation in the source domain is unobservable. Naively ignoring this unobserved group can result in biased estimates and degraded predictive performance. Despite this structured missingness, we show that the prediction in the target domain can still be recovered. Specifically, we rigorously derive both background-specific and overall prediction models for the target domain. For practical implementation, we propose the distribution matching method to estimate the subpopulation proportions. We provide theoretical guarantees for the asymptotic behavior of our estimator, and establish an upper bound on the prediction error. Experiments on both synthetic and real-world datasets show that our method outperforms the naive benchmark that does not account for this unobservable source subpopulation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 40 of its 58 references that are in the map. First posted on arXiv 24 Sep 2025.
Builds on
40 of 58 references.
References · 40
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,385
- 2019Invariant Risk Minimizationcited by 1,854
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
- 2017Enhancing The Reliability of Out-of-distribution Image Detection in Neural Networkscited by 1,328
- 2017Adversarial Discriminative Domain Adaptationcited by 1,311
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2018Deep Anomaly Detection with Outlier Exposurecited by 942
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 600
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 536
28 more
- 2021Towards Out-Of-Distribution Generalization: A Surveycited by 436
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
- 2018Detecting and Correcting for Label Shift with Black Box Predictorscited by 366
- 2021Rethinking Spatial Dimensions of Vision Transformerscited by 361
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
- 2021Exploring the Limits of Out-of-Distribution Detectioncited by 283
- 2020No Subclass Left Behind: Fine-Grained Robustness in Coarse-Grained Classification Problemscited by 209
- 2019Learning De-biased Representations with Biased Representationscited by 199
- 2016Deep Reconstruction-Classification Networks for Unsupervised Domain Adaptationcited by 163
- 2019A review of domain adaptation without target labelscited by 156
- 2022On Feature Learning in the Presence of Spurious Correlationscited by 145
- 2020A Unified View of Label Shift Estimationcited by 119
- 2019HoMM: Higher-order Moment Matching for Unsupervised Domain Adaptationcited by 89
- 2021Extending the WILDS Benchmark for Unsupervised Adaptationcited by 86
- 2023Discover and Cure: Concept-aware Mitigation of Spurious Correlationcited by 71
- 2021On the Impact of Spurious Correlation for Out-of-distribution Detectioncited by 68
- 2016Mixture Proportion Estimation via Kernel Embedding of Distributionscited by 67
- 2020Identifying Spurious Correlations for Robust Text Classificationcited by 59
- 2022Domain Adaptation under Open Set Label Shiftcited by 32
- 2023Seeing is not Believing: Robust Reinforcement Learning against Spurious Correlationcited by 25
- 2023Learning from data with structured missingnesscited by 24
- 2017Fisher consistency for prior probability shiftcited by 20
- 2018Building robust classifiers through generation of confident out of distribution examplescited by 20
- 2021OodGAN: Generative Adversarial Network for Out-of-Domain Data Generationcited by 15
- 2022Understanding new tasks through the lens of training data via exponential tiltingcited by 11
- 2023ELSA: Efficient Label Shift Adaptation through the Lens of Semiparametric Modelscited by 9
- 2023Doubly Flexible Estimation under Label Shiftcited by 6
- 2025Efficient Inference under Label Shift in Unsupervised Domain Adaptationcited by 2
Built on by
Not cited yet.