mlsanityData to 7 Oct 2026

How does the Combined Risk Affect the Performance of Unsupervised Domain Adaptation Approaches?

arXiv 2101.01104 ↗First posted 30 Dec 2020cs.LG cs.AI cs.CVcited by 17

Not on the map. Why?

Abstract (arXiv)

Unsupervised domain adaptation (UDA) aims to train a target classifier with labeled samples from the source domain and unlabeled samples from the target domain. Classical UDA learning bounds show that target risk is upper bounded by three terms: source risk, distribution discrepancy, and combined risk. Based on the assumption that the combined risk is a small fixed value, methods based on this bound train a target classifier by only minimizing estimators of the source risk and the distribution discrepancy. However, the combined risk may increase when minimizing both estimators, which makes the target risk uncontrollable. Hence the target classifier cannot achieve ideal performance if we fail to control the combined risk. To control the combined risk, the key challenge takes root in the unavailability of the labeled samples in the target domain. To address this key challenge, we propose a method named E-MixNet. E-MixNet employs enhanced mixup, a generic vicinal distribution, on the labeled source samples and pseudo-labeled target samples to calculate a proxy of the combined risk. Experiments show that the proxy can effectively curb the increase of the combined risk when minimizing the source risk and distribution discrepancy. Furthermore, we show that if the proxy of the combined risk is added into loss functions of four representative UDA methods, their performance is also improved.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 5; 2023: 2; 2024: 3; 2025: 1.

17 papers.

Sort:

  1. 2021ToAlign: Task-oriented Alignment for Unsupervised Domain Adaptationcited by 33
  2. 2021Learning Bounds for Open-Set Learningcited by 27
  3. 2021Fusing Higher-order Features in Graph Neural Networks for Skeleton-based Action Recognitioncited by 22
  4. 2021Meta Two-Sample Testing: Learning Kernels for Testing with Limited Datacited by 18
  5. 2021TOHAN: A One-step Approach towards Few-shot Hypothesis Adaptationcited by 17
  6. 2024Adaptive Betweenness Clustering for Semi-Supervised Domain Adaptationcited by 9
  7. 2022Delving into the Continuous Domain Adaptationcited by 6
  8. 2024A Unified Data Representation Learning for Non-parametric Two-sample Testingcited by 5
  9. 2023Diversity-enhancing Generative Network for Few-shot Hypothesis Adaptationcited by 4
  10. 2022Autonomous Cross Domain Adaptation under Extreme Label Scarcitycited by 3
  11. 2022Connecting sufficient conditions for domain adaptation: source-guided uncertainty, relaxed divergences and discrepancy localizationcited by 2
  12. 2024RanLayNet: A Dataset for Document Layout Detection used for Domain Adaptation and Generalizationcited by 2
5 more
  1. 2021Boosting Unsupervised Domain Adaptation with Soft Pseudo-label and Curriculum Learningcited by 1
  2. 2022Shuffle Augmentation of Features from Unlabeled Data for Unsupervised Domain Adaptationcited by 1
  3. 2022Multi-class Classification with Fuzzy-feature Observations: Theory and Algorithmscited by 1
  4. 2023Chaos to Order: A Label Propagation Perspective on Source-Free Domain Adaptationcited by 0
  5. 2025Source-free Semantic Regularization Learning for Semi-supervised Domain Adaptationcited by 0