A Unified Framework for Unsupervised Domain Adaptation based on Instance Weighting
Not on the map. Why?
Abstract (arXiv)
Despite the progress made in domain adaptation, solving Unsupervised Domain Adaptation (UDA) problems with a general method under complex conditions caused by label shifts between domains remains a formidable task. In this work, we comprehensively investigate four distinct UDA settings including closed set domain adaptation, partial domain adaptation, open set domain adaptation, and universal domain adaptation, where shared common classes between source and target domains coexist alongside domain-specific private classes. The prominent challenges inherent in diverse UDA settings center around the discrimination of common/private classes and the precise measurement of domain discrepancy. To surmount these challenges effectively, we propose a novel yet effective method called Learning Instance Weighting for Unsupervised Domain Adaptation (LIWUDA), which caters to various UDA settings. Specifically, the proposed LIWUDA method constructs a weight network to assign weights to each instance based on its probability of belonging to common classes, and designs Weighted Optimal Transport (WOT) for domain alignment by leveraging instance weights. Additionally, the proposed LIWUDA method devises a Separate and Align (SA) loss to separate instances with low similarities and align instances with high similarities. To guide the learning of the weight network, Intra-domain Optimal Transport (IOT) is proposed to enforce the weights of instances in common classes to follow a uniform distribution. Through the integration of those three components, the proposed LIWUDA method demonstrates its capability to address all four UDA settings in a unified manner. Experimental evaluations conducted on three benchmark datasets substantiate the effectiveness of the proposed LIWUDA method.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 40 of its 59 references that are in the map. First posted on arXiv 8 Dec 2023.
Builds on
40 of 59 references.
References · 40
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,845
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2017Adversarial Discriminative Domain Adaptationcited by 1,309
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,079
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
28 more
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2017VisDA: The Visual Domain Adaptation Challengecited by 432
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
- 2016Unsupervised Domain Adaptation with Residual Transfer Networkscited by 340
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2020Universal Source-Free Domain Adaptationcited by 219
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
- 2017Central Moment Discrepancy (CMD) for Domain-Invariant Representation Learningcited by 192
- 2020Universal Domain Adaptation through Self Supervisioncited by 172
- 2018Open Set Domain Adaptation by Backpropagationcited by 150
- 2018Partial Adversarial Domain Adaptationcited by 127
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
- 2016Theoretical Analysis of Domain Adaptation with Optimal Transportcited by 105
- 2018Importance Weighted Adversarial Nets for Partial Domain Adaptationcited by 90
- 2019Learning to Transfer Examples for Partial Domain Adaptationcited by 86
- 2017Partial Transfer Learning with Selective Adversarial Networkscited by 84
- 2020On the Effectiveness of Image Rotation for Open Set Domain Adaptationcited by 72
- 2018Optimal Transport for Multi-source Domain Adaptation under Target Shiftcited by 67
- 2020A Balanced and Uncertainty-aware Approach for Partial Domain Adaptationcited by 55
- 2023Patch-Mix Transformer for Unsupervised Domain Adaptation: A Game Perspectivecited by 54
- 2023Both Style and Distortion Matter: Dual-Path Unsupervised Domain Adaptation for Panoramic Semantic Segmentationcited by 46
- 2020Deep Residual Correction Network for Partial Domain Adaptationcited by 45
- 2021Improving Mini-batch Optimal Transport via Partial Transportationcited by 40
- 2019DARec: Deep Domain Adaptation for Cross-Domain Recommendation via Transferring Rating Patternscited by 33
- 2019Open Set Domain Adaptation for Image and Action Recognitioncited by 30
- 2019Selective Transfer with Reinforced Transfer Network for Partial Domain Adaptationcited by 11
Built on by
Citing papers per year: 2024: 2.
2 papers.