mlsanityData to 7 Oct 2026

Unsupervised Domain Adaptation Based on Source-guided Discrepancy

arXiv 1809.03839 ↗First posted 11 Sep 2018cs.LG stat.MLcited by 20

Not on the map. Why?

Abstract (arXiv)

Unsupervised domain adaptation is the problem setting where data generating distributions in the source and target domains are different, and labels in the target domain are unavailable. One important question in unsupervised domain adaptation is how to measure the difference between the source and target domains. A previously proposed discrepancy that does not use the source domain labels requires high computational cost to estimate and may lead to a loose generalization error bound in the target domain. To mitigate these problems, we propose a novel discrepancy called source-guided discrepancy (S-disc), which exploits labels in the source domain. As a consequence, S-disc can be computed efficiently with a finite sample convergence guarantee. In addition, we show that S-disc can provide a tighter generalization error bound than the one based on an existing discrepancy. Finally, we report experimental results that demonstrate the advantages of S-disc over the existing discrepancies.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Sep 2018.

Builds on

No reference list yet.

Built on by

Cited by year

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

20 papers.

Sort:

  1. 2021CDTrans: Cross-domain Transformer for Unsupervised Domain Adaptationcited by 129
  2. 2021Domain Adversarial Neural Networks for Domain Generalization: When It Works and How to Improvecited by 46
  3. 2022Graph-Relational Domain Adaptationcited by 19
  4. 2022PAC-Bayesian Domain Adaptation Bounds for Multiclass Learnerscited by 13
  5. 2022The Change that Matters in Discourse Parsing: Estimating the Impact of Domain Shift on Parser Errorcited by 12
  6. 2022Robust Local Preserving and Global Aligning Network for Adversarial Domain Adaptationcited by 8
  7. 2023Taxonomy-Structured Domain Adaptationcited by 6
  8. 2021Lifelong Generative Modelling Using Dynamic Expansion Graph Modelcited by 4
  9. 2022LEATHER: A Framework for Learning to Generate Human-like Text in Dialoguecited by 4
  10. 2023On the Hardness of Robustness Transfer: A Perspective from Rademacher Complexity over Symmetric Difference Hypothesis Spacecited by 2
  11. 2021SCIDA: Self-Correction Integrated Domain Adaptation from Single- to Multi-label Aerial Imagescited by 1
  12. 2021Information Theory-Guided Heuristic Progressive Multi-View Codingcited by 1
8 more
  1. 2023Practicality of generalization guarantees for unsupervised domain adaptation with neural networkscited by 1
  2. 2024Towards Domain Adaptive Neural Contextual Banditscited by 1
  3. 2025On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspectivecited by 1
  4. 2021A Symmetric Loss Perspective of Reliable Machine Learningcited by 0
  5. 2023Information Theory-Guided Heuristic Progressive Multi-View Codingcited by 0
  6. 2023Improving Source-Free Target Adaptation with Vision Transformers Leveraging Domain Representation Imagescited by 0
  7. 2024A Weight-aware-based Multi-source Unsupervised Domain Adaptation Method for Human Motion Intention Recognitioncited by 0
  8. 2025SWDL: Stratum-Wise Difference Learning with Deep Laplacian Pyramid for Semi-Supervised 3D Intracranial Hemorrhage Segmentationcited by 0