AdaTriplet-RA: Domain Matching via Adaptive Triplet and Reinforced Attention for Unsupervised Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Unsupervised domain adaption (UDA) is a transfer learning task where the data and annotations of the source domain are available but only have access to the unlabeled target data during training. Most previous methods try to minimise the domain gap by performing distribution alignment between the source and target domains, which has a notable limitation, i.e., operating at the domain level, but neglecting the sample-level differences. To mitigate this weakness, we propose to improve the unsupervised domain adaptation task with an inter-domain sample matching scheme. We apply the widely-used and robust Triplet loss to match the inter-domain samples. To reduce the catastrophic effect of the inaccurate pseudo-labels generated during training, we propose a novel uncertainty measurement method to select reliable pseudo-labels automatically and progressively refine them. We apply the advanced discrete relaxation Gumbel Softmax technique to realise an adaptive Topk scheme to fulfil the functionality. In addition, to enable the global ranking optimisation within one batch for the domain matching, the whole model is optimised via a novel reinforced attention mechanism with supervision from the policy gradient algorithm, using the Average Precision (AP) as the reward. Our model (termed textbftextitAdaTriplet-RA) achieves State-of-the-art results on several public benchmark datasets, and its effectiveness is validated via comprehensive ablation studies. Our method improves the accuracy of the baseline by 9.7% (ResNet-101) and 6.2% (ResNet-50) on the VisDa dataset and 4.22% (ResNet-50) on the Domainnet dataset. The source code is publicly available at textithttps://github.com/shuxy0120/AdaTriplet-RA.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 64 of its 102 references that are in the map. First posted on arXiv 16 Nov 2022.
Builds on
64 of 102 references.
References · 64
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,859
- 2014Going Deeper with Convolutionscited by 4,241
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2015Fast R-CNNcited by 2,933
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
38 more
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,845
- 2015Show, Attend and Tell: Neural Image Caption Generation with Visual Attentioncited by 1,423
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
- 2017Bottom-Up and Top-Down Attention for Image Captioning and Visual Question Answeringcited by 1,312
- 2017Adversarial Discriminative Domain Adaptationcited by 1,311
- 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
- 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
- 2017VisDA: The Visual Domain Adaptation Challengecited by 435
- 2018Stacked Cross Attention for Image-Text Matchingcited by 416
- 2018Detecting and Correcting for Label Shift with Black Box Predictorscited by 366
- 2021In Defense of Pseudo-Labeling: An Uncertainty-Aware Pseudo-label Selection Framework for Semi-Supervised Learningcited by 301
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 231
- 2016SCA-CNN: Spatial and Channel-wise Attention in Convolutional Networks for Image Captioningcited by 219
- 2018Multi-Adversarial Domain Adaptationcited by 196
- 2019Visual Semantic Reasoning for Image-Text Matchingcited by 185
- 2017Generate To Adapt: Aligning Domains using Generative Adversarial Networkscited by 183
- 2017Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptationcited by 151
- 2020Gradually Vanishing Bridge for Adversarial Domain Adaptationcited by 130
- 2018Partial Adversarial Domain Adaptationcited by 127
- 2019Domain-Symmetric Networks for Adversarial Domain Adaptationcited by 120
- 2017YouTube-BoundingBoxes: A Large High-Precision Human-Annotated Data Set for Object Detection in Videocited by 109
- 2017Adversarial Dropout Regularizationcited by 106
- 2016Hierarchical Multiscale Recurrent Neural Networkscited by 104
- 2019Learning to Transfer Examples for Partial Domain Adaptationcited by 87
- 2019Ranked List Loss for Deep Metric Learningcited by 77
- 2021Cross-domain Contrastive Learning for Unsupervised Domain Adaptationcited by 76
- 2019Discriminative Adversarial Domain Adaptationcited by 74
- 2020Adversarial-Learned Loss for Domain Adaptationcited by 65
- 2019Domain Adaptation with Asymmetrically-Relaxed Distribution Alignmentcited by 61
- 2017VQS: Linking Segmentations to Questions and Answers for Supervised Attention in VQA and Question-Focused Semantic Segmentationcited by 50
- 2016GANS for Sequences of Discrete Elements with the Gumbel-softmax Distributioncited by 48
50 most cited of 64 All 64 (JSON)
Built on by
Citing papers per year: 2025: 1.
1 paper.