Gradually Vanishing Gap in Prototypical Network for Unsupervised Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Unsupervised domain adaptation (UDA) is a critical problem for transfer learning, which aims to transfer the semantic information from labeled source domain to unlabeled target domain. Recent advancements in UDA models have demonstrated significant generalization capabilities on the target domain. However, the generalization boundary of UDA models remains unclear. When the domain discrepancy is too large, the model can not preserve the distribution structure, leading to distribution collapse during the alignment. To address this challenge, we propose an efficient UDA framework named Gradually Vanishing Gap in Prototypical Network (GVG-PN), which achieves transfer learning from both global and local perspectives. From the global alignment standpoint, our model generates a domain-biased intermediate domain that helps preserve the distribution structures. By entangling cross-domain features, our model progressively reduces the risk of distribution collapse. However, only relying on global alignment is insufficient to preserve the distribution structure. To further enhance the inner relationships of features, we introduce the local perspective. We utilize the graph convolutional network (GCN) as an intuitive method to explore the internal relationships between features, ensuring the preservation of manifold structures and generating domain-biased prototypes. Additionally, we consider the discriminability of the inner relationships between features. We propose a pro-contrastive loss to enhance the discriminability at the prototype level by separating hard negative pairs. By incorporating both GCN and the pro-contrastive loss, our model fully explores fine-grained semantic relationships. Experiments on several UDA benchmarks validated that the proposed GVG-PN can clearly outperform the SOTA models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 41 of its 71 references that are in the map. First posted on arXiv 28 May 2024.
Builds on
41 of 71 references.
References · 41
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2022Generative Adversarial Networkscited by 5,627
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,845
29 more
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,200
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
- 2017In Defense of the Triplet Loss for Person Re-Identificationcited by 786
- 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 683
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 612
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 600
- 2017VisDA: The Visual Domain Adaptation Challengecited by 435
- 2019Contrastive Adaptation Network for Unsupervised Domain Adaptationcited by 407
- 2016Unsupervised Domain Adaptation with Residual Transfer Networkscited by 341
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
- 2020Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situationscited by 133
- 2020FixBi: Bridging Domain Spaces for Unsupervised Domain Adaptationcited by 124
- 2021Cross-domain Contrastive Learning for Unsupervised Domain Adaptationcited by 76
- 2021Cross-Domain Gradient Discrepancy Minimization for Unsupervised Domain Adaptationcited by 67
- 2022Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptationcited by 66
- 2021Category Contrast for Unsupervised Domain Adaptation in Visual Taskscited by 65
- 2020Progressive Graph Learning for Open-Set Domain Adaptationcited by 56
- 2021Transferable Semantic Augmentation for Domain Adaptationcited by 56
- 2021Curriculum Graph Co-Teaching for Multi-Target Domain Adaptationcited by 37
- 2021Contrastive Domain Adaptationcited by 36
- 2023Free Lunch for Domain Adversarial Training: Environment Label Smoothingcited by 33
- 2021Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptationcited by 21
- 2023Gradual Source Domain Expansion for Unsupervised Domain Adaptationcited by 12
- 2019Manifold Criterion Guided Transfer Learning via Intermediate Domain Generationcited by 7
- 2022BP-Triplet Net for Unsupervised Domain Adaptation: A Bayesian Perspectivecited by 7
- 2022IT-RUDA: Information Theory Assisted Robust Unsupervised Domain Adaptationcited by 3
Built on by
Not cited yet.