Locality-aware Private Class Identification for Domain Adaptation with Extreme Label Shift
Not on the map. Why?
Abstract (arXiv)
Domain adaptation aims to transfer knowledge from a labeled source domain to an unlabeled target domain with different distributions. In real-world scenarios, the label spaces of the two domains often have an inclusion relationship, where some classes exist only in one domain but not the other. These non-overlapping classes are referred to as private classes. Identifying private class samples and mitigating their adverse effects is critical in the literature. Existing methods rely on the assumption that shifts in private classes are large enough to be considered outliers. However, the variance within a single shared class can be significantly larger than the difference between a private class and another shared class, challenging this assumption. Consequently, private classes substantially increase the difficulty of cross-domain classification. To address these issues, based on local transportation and metric properties of optimal transport (OT), a locality-aware private class identification approach is proposed in the form of a score function on transport mass. The effectiveness of the proposed approach is theoretically proven, highlighting the score function's strong ability to distinguish between shared and private class samples. Building on this, we introduce a reliable OT-based method (ReOT) for domain adaptation under severe label shift. ReOT minimizes classification risk while learning the separated cluster structure between the identified shared classes and private classes, effectively avoiding mismatch between shared-private sample pairs, thus ensuring that important knowledge is reliably transported intra-class to mitigate class-conditional discrepancy. Furthermore, a generalization upper bound of the target risk is provided for extreme label shift scenarios, which can be minimized by ReOT. Extensive experiments on benchmarks validate the effectiveness of ReOT.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 35 of its 61 references that are in the map. First posted on arXiv 7 May 2026.
Builds on
35 of 61 references.
References · 35
- 2015Deep Residual Learning for Image Recognitioncited by 51,950
- 2015Domain-Adversarial Training of Neural Networkscited by 3,030
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,295
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,183
- 2015Optimal Transport for Domain Adaptationcited by 460
- 2017VisDA: The Visual Domain Adaptation Challengecited by 434
- 2016Unsupervised Domain Adaptation with Residual Transfer Networkscited by 340
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 281
- 2018Open Set Domain Adaptation by Backpropagationcited by 150
- 2018Partial Adversarial Domain Adaptationcited by 127
- 2020Domain Adaptation with Conditional Distribution Matching and Generalized Label Shiftcited by 124
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
23 more
- 2018Importance Weighted Adversarial Nets for Partial Domain Adaptationcited by 90
- 2019Learning to Transfer Examples for Partial Domain Adaptationcited by 86
- 2020On the Effectiveness of Image Rotation for Open Set Domain Adaptationcited by 72
- 2020Learning Invariant Representations and Risks for Semi-supervised Domain Adaptationcited by 69
- 2020Progressive Graph Learning for Open-Set Domain Adaptationcited by 56
- 2020A Balanced and Uncertainty-aware Approach for Partial Domain Adaptationcited by 55
- 2019Open Set Domain Adaptation: Theoretical Bound and Algorithmcited by 47
- 2020Multi-source Domain Adaptation in the Deep Learning Era: A Systematic Surveycited by 47
- 2020Deep Residual Correction Network for Partial Domain Adaptationcited by 45
- 2021Multi-Target Domain Adaptation with Collaborative Consistency Learningcited by 43
- 2021Improving Mini-batch Optimal Transport via Partial Transportationcited by 40
- 2020Unsupervised Domain Adaptation via Discriminative Manifold Propagationcited by 33
- 2021Conditional Bures Metric for Domain Adaptationcited by 25
- 2022Unknown-Aware Domain Adversarial Learning for Open-Set Domain Adaptationcited by 21
- 2022Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transportcited by 19
- 2019Domain Adversarial Reinforcement Learning for Partial Domain Adaptationcited by 16
- 2020Select, Label, and Mix: Learning Discriminative Invariant Feature Representations for Partial Domain Adaptationcited by 16
- 2021Unbalanced Multi-Marginal Optimal Transportcited by 11
- 2021Partial Domain Adaptation without Domain Alignmentcited by 11
- 2022From Big to Small: Adaptive Learning to Partial-Set Domainscited by 9
- 2020Bridging the Theoretical Bound and Deep Algorithms for Open Set Domain Adaptationcited by 7
- 2022Generalized Label Shift Correction via Minimum Uncertainty Principle: Theory and Algorithmcited by 3
- 2025Partial Domain Adaptation via Importance Sampling-based Shift Correctioncited by 2
Built on by
Not cited yet.