mlsanityData to 14 Oct 2026

Aligning Non-Causal Factors for Transformer-Based Source-Free Domain Adaptation

arXiv 2311.16294 ↗First posted 27 Nov 2023cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

Conventional domain adaptation algorithms aim to achieve better generalization by aligning only the task-discriminative causal factors between a source and target domain. However, we find that retaining the spurious correlation between causal and non-causal factors plays a vital role in bridging the domain gap and improving target adaptation. Therefore, we propose to build a framework that disentangles and supports causal factor alignment by aligning the non-causal factors first. We also investigate and find that the strong shape bias of vision transformers, coupled with its multi-head attention, make it a suitable architecture for realizing our proposed disentanglement. Hence, we propose to build a Causality-enforcing Source-Free Transformer framework (C-SFTrans) to achieve disentanglement via a novel two-stage alignment approach: a) non-causal factor alignment: non-causal factors are aligned using a style classification task which leads to an overall global alignment, b) task-discriminative causal factor alignment: causal factors are aligned via target adaptation. We are the first to investigate the role of vision transformers (ViTs) in a privacy-preserving source-free setting. Our approach achieves state-of-the-art results in several DA benchmarks.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 53 of its 68 references that are in the map. First posted on arXiv 27 Nov 2023.

Builds on

53 of 68 references.

References · 53

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  5. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  6. 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
  7. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  8. 2017Arbitrary Style Transfer in Real-time with Adaptive Instance Normalizationcited by 2,010
  9. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  10. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
  11. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
  12. 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,082
38 more
  1. 2021Transformers in Vision: A Surveycited by 1,013
  2. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
  3. 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 683
  4. 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 675
  5. 2016Deep Transfer Learning with Joint Adaptation Networkscited by 612
  6. 2020FDA: Fourier Domain Adaptation for Semantic Segmentationcited by 541
  7. 2021Intriguing Properties of Vision Transformerscited by 446
  8. 2017VisDA: The Visual Domain Adaptation Challengecited by 435
  9. 2019Bridging Theory and Algorithm for Domain Adaptationcited by 332
  10. 2022How Do Vision Transformers Work?cited by 307
  11. 2020Universal Source-Free Domain Adaptationcited by 220
  12. 2016Coupled Generative Adversarial Networkscited by 216
  13. 2017Improved Texture Networks: Maximizing Quality and Diversity in Feed-forward Stylization and Texture Synthesiscited by 215
  14. 2017Generate To Adapt: Aligning Domains using Generative Adversarial Networkscited by 183
  15. 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 177
  16. 2021Generalized Source-free Domain Adaptationcited by 175
  17. 2020Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfercited by 173
  18. 2020Learning Texture Invariant Representation for Domain Adaptation of Semantic Segmentationcited by 153
  19. 2022Causality Inspired Representation Learning for Domain Generalizationcited by 138
  20. 2020Efficient Domain Generalization via Common-Specific Low-Rank Decompositioncited by 134
  21. 2021CDTrans: Cross-domain Transformer for Unsupervised Domain Adaptationcited by 129
  22. 2019Domain Agnostic Learning with Disentangled Representationscited by 108
  23. 2019HoMM: Higher-order Moment Matching for Unsupervised Domain Adaptationcited by 89
  24. 2021TVT: Transferable Vision Transformer for Unsupervised Domain Adaptationcited by 81
  25. 2021Generalize then Adapt: Source-Free Domain Adaptive Semantic Segmentationcited by 81
  26. 2018Style Augmentation: Data Augmentation via Style Randomizationcited by 79
  27. 2021Cross-Domain Gradient Discrepancy Minimization for Unsupervised Domain Adaptationcited by 67
  28. 2022Safe Self-Refinement for Transformer-based Domain Adaptationcited by 61
  29. 2022Confidence Score for Source-Free Unsupervised Domain Adaptationcited by 59
  30. 2022Balancing Discriminability and Transferability for Source-Free Domain Adaptationcited by 58
  31. 2017From source to target and back: symmetric bi-directional adaptive GANcited by 53
  32. 2020Unsupervised Multi-Target Domain Adaptation Through Knowledge Distillationcited by 47
  33. 2022Uncertainty-guided Source-free Domain Adaptationcited by 46
  34. 2022BMD: A General Class-balanced Multicentric Dynamic Prototype Strategy for Source-free Domain Adaptationcited by 39
  35. 2021Curriculum Graph Co-Teaching for Multi-Target Domain Adaptationcited by 37
  36. 2022The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancycited by 35
  37. 2021Transformer-Based Source-Free Domain Adaptationcited by 30
  38. 2022Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptationcited by 21

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.