mlsanityData to 7 Oct 2026

Jacobian Norm for Unsupervised Source-Free Domain Adaptation

arXiv 2204.03467 ↗First posted 7 Apr 2022cs.LG cs.MMcited by 4

Not on the map. Why?

Abstract (arXiv)

Unsupervised Source (data) Free domain adaptation (USFDA) aims to transfer knowledge from a well-trained source model to a related but unlabeled target domain. In such a scenario, all conventional adaptation methods that require source data fail. To combat this challenge, existing USFDAs turn to transfer knowledge by aligning the target feature to the latent distribution hidden in the source model. However, such information is naturally limited. Thus, the alignment in such a scenario is not only difficult but also insufficient, which degrades the target generalization performance. To relieve this dilemma in current USFDAs, we are motivated to explore a new perspective to boost their performance. For this purpose and gaining necessary insight, we look back upon the origin of the domain adaptation and first theoretically derive a new-brand target generalization error bound based on the model smoothness. Then, following the theoretical insight, a general and model-smoothness-guided Jacobian norm (JN) regularizer is designed and imposed on the target domain to mitigate this dilemma. Extensive experiments are conducted to validate its effectiveness. In its implementation, just with a few lines of codes added to the existing USFDAs, we achieve superior results on various benchmark datasets.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 7 Apr 2022.

Builds on

27 of 48 references.

References · 27

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
  3. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
  4. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
  5. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
  6. 2019When Does Label Smoothing Help?cited by 985
  7. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
  8. 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 682
  9. 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
  10. 2017Central Moment Discrepancy (CMD) for Domain-Invariant Representation Learningcited by 192
  11. 2017Generate To Adapt: Aligning Domains using Generative Adversarial Networkscited by 183
  12. 2018Progressive Feature Alignment for Unsupervised Domain Adaptationcited by 183
15 more
  1. 2019A review of domain adaptation without target labelscited by 154
  2. 2019Domain Agnostic Learning with Disentangled Representationscited by 107
  3. 2021Improved OOD Generalization via Adversarial Training and Pre-trainingcited by 66
  4. 2020Multi-Source Domain Adaptation for Text Classification via DistanceNet-Banditscited by 30
  5. 2020Adversarial Bipartite Graph Learning for Video Domain Adaptationcited by 28
  6. 2021Dual Path Learning for Domain Adaptation of Semantic Segmentationcited by 26
  7. 2021Source-free Domain Adaptation via Distributional Alignment by Matching Batch Normalization Statisticscited by 24
  8. 2020Casting a BAIT for Offline and Online Source-free Domain Adaptationcited by 23
  9. 2020Beyond H-Divergence: Domain Adaptation Theory With Jensen-Shannon Divergencecited by 15
  10. 2019Heterogeneous Domain Adaptation via Soft Transfer Networkcited by 14
  11. 2021Transferrable Contrastive Learning for Visual Domain Adaptationcited by 14
  12. 2020Adaptively-Accumulated Knowledge Transfer for Partial Domain Adaptationcited by 9
  13. 2018Guaranteed Deterministic Bounds on the Total Variation Distance between Univariate Mixturescited by 7
  14. 2020Unsupervised Domain Adaptation with Progressive Adaptation of Subspacescited by 5
  15. 2021On the inductive biases of deep domain adaptationcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 1.

4 papers.