mlsanityData to 14 Oct 2026

Uncertainty-Induced Transferability Representation for Source-Free Unsupervised Domain Adaptation

arXiv 2208.13986 ↗First posted 30 Aug 2022cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

Source-free unsupervised domain adaptation (SFUDA) aims to learn a target domain model using unlabeled target data and the knowledge of a well-trained source domain model. Most previous SFUDA works focus on inferring semantics of target data based on the source knowledge. Without measuring the transferability of the source knowledge, these methods insufficiently exploit the source knowledge, and fail to identify the reliability of the inferred target semantics. However, existing transferability measurements require either source data or target labels, which are infeasible in SFUDA. To this end, firstly, we propose a novel Uncertainty-induced Transferability Representation (UTR), which leverages uncertainty as the tool to analyse the channel-wise transferability of the source encoder in the absence of the source data and target labels. The domain-level UTR unravels how transferable the encoder channels are to the target domain and the instance-level UTR characterizes the reliability of the inferred target semantics. Secondly, based on the UTR, we propose a novel Calibrated Adaption Framework (CAF) for SFUDA, including i)the source knowledge calibration module that guides the target model to learn the transferable source knowledge and discard the non-transferable one, and ii)the target semantics calibration module that calibrates the unreliable semantics. With the help of the calibrated source knowledge and the target semantics, the model adapts to the target domain safely and ultimately better. We verified the effectiveness of our method using experimental results and demonstrated that the proposed method achieves state-of-the-art performances on the three SFUDA benchmarks. Code is available at https://github.com/SPIresearch/UTR.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 42 of its 71 references that are in the map. First posted on arXiv 30 Aug 2022.

Builds on

42 of 71 references.

References · 42

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  5. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
  6. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  7. 2017Squeeze-and-Excitation Networkscited by 4,789
  8. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
  9. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  10. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  11. 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
  12. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
30 more
  1. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
  2. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
  3. 2018Evidential Deep Learning to Quantify Classification Uncertaintycited by 732
  4. 2021A Survey of Uncertainty in Deep Neural Networkscited by 680
  5. 2018Predictive Uncertainty Estimation via Prior Networkscited by 557
  6. 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 464
  7. 2017VisDA: The Visual Domain Adaptation Challengecited by 435
  8. 2020LEEP: A New Measure to Evaluate Transferability of Learned Representationscited by 188
  9. 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 177
  10. 2021Generalized Source-free Domain Adaptationcited by 175
  11. 2021LogME: Practical Assessment of Pre-trained Models for Transfer Learningcited by 172
  12. 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
  13. 2019Transferability and Hardness of Supervised Classification Taskscited by 127
  14. 2021Source-free Domain Adaptation via Avatar Prototype Generation and Adaptationcited by 111
  15. 2020Test-Time Adaptable Neural Networks for Robust Medical Image Segmentationcited by 102
  16. 2021Domain Impression: A Source Data Free Domain Adaptation Methodcited by 91
  17. 2020Domain Adaptation without Source Datacited by 88
  18. 2021Unsupervised Multi-source Domain Adaptation Without Access to Source Datacited by 76
  19. 2021Source-Free Domain Adaptation for Image Segmentationcited by 45
  20. 2020Towards Maximizing the Representation Gap between In-Domain & Out-of-Distribution Examplescited by 40
  21. 2020Revisiting One-vs-All Classifiers for Predictive Uncertainty and Out-of-Distribution Detection in Neural Networkscited by 31
  22. 2021Generation, augmentation, and alignment: A pseudo-source domain based method for source-free domain adaptationcited by 28
  23. 2020Casting a BAIT for Offline and Online Source-free Domain Adaptationcited by 23
  24. 2019Bayesian Uncertainty Matching for Unsupervised Domain Adaptationcited by 22
  25. 2021Learning Transferable Parameters for Unsupervised Domain Adaptationcited by 19
  26. 2019Uncertainty-Based Out-of-Distribution Classification in Deep Reinforcement Learningcited by 15
  27. 2018Robustness to Out-of-Distribution Inputs via Task-Aware Generative Uncertaintycited by 14
  28. 2022Dynamic Instance Domain Adaptationcited by 6
  29. 2021Repurposing Pretrained Models for Robust Out-of-domain Few-Shot Learningcited by 4
  30. 2022A Multi-stage Framework with Mean Subspace Computation and Recursive Feedback for Online Unsupervised Domain Adaptationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 4; 2024: 4; 2025: 1; 2026: 3.

13 papers.

Sort:

By area: