Unsupervised Domain Adaptation with Progressive Adaptation of Subspaces

• URL: http://arxiv.org/abs/2009.00520v1
• Date: Tue, 1 Sep 2020 15:40:50 GMT
• Title: Unsupervised Domain Adaptation with Progressive Adaptation of Subspaces
• Authors: Weikai Li and Songcan Chen
• Abstract summary: Unsupervised Domain Adaptation (UDA) aims to classify unlabeled target domain by transferring knowledge from labeled source domain with domain shift. We propose a novel UDA method named Progressive Adaptation of Subspaces approach (PAS) in which we utilize such an intuition to gradually obtain reliable pseudo labels. Our thorough evaluation demonstrates that PAS is not only effective for common UDA, but also outperforms the state-of-the arts for more challenging Partial Domain Adaptation (PDA) situation.
• Score: 26.080102941802107
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unsupervised Domain Adaptation (UDA) aims to classify unlabeled target domain by transferring knowledge from labeled source domain with domain shift. Most of the existing UDA methods try to mitigate the adverse impact induced by the shift via reducing domain discrepancy. However, such approaches easily suffer a notorious mode collapse issue due to the lack of labels in target domain. Naturally, one of the effective ways to mitigate this issue is to reliably estimate the pseudo labels for target domain, which itself is hard. To overcome this, we propose a novel UDA method named Progressive Adaptation of Subspaces approach (PAS) in which we utilize such an intuition that appears much reasonable to gradually obtain reliable pseudo labels. Speci fically, we progressively and steadily refine the shared subspaces as bridge of knowledge transfer by adaptively anchoring/selecting and leveraging those target samples with reliable pseudo labels. Subsequently, the refined subspaces can in turn provide more reliable pseudo-labels of the target domain, making the mode collapse highly mitigated. Our thorough evaluation demonstrates that PAS is not only effective for common UDA, but also outperforms the state-of-the arts for more challenging Partial Domain Adaptation (PDA) situation, where the source label set subsumes the target one.

Related papers

• Overcoming Negative Transfer by Online Selection: Distant Domain Adaptation for Fault Diagnosis [42.85741244467877]
  The term distant domain adaptation problem' describes the challenge of adapting from a labeled source domain to a significantly disparate unlabeled target domain. This problem exhibits the risk of negative transfer, where extraneous knowledge from the source domain adversely affects the target domain performance. In response to this challenge, we propose a novel Online Selective Adversarial Alignment (OSAA) approach.
  arXiv  Detail & Related papers  (2024-05-25T07:17:47Z)
• Imbalanced Open Set Domain Adaptation via Moving-threshold Estimation and Gradual Alignment [58.56087979262192]
  Open Set Domain Adaptation (OSDA) aims to transfer knowledge from a well-labeled source domain to an unlabeled target domain. The performance of OSDA methods degrades drastically under intra-domain class imbalance and inter-domain label shift. We propose Open-set Moving-threshold Estimation and Gradual Alignment (OMEGA) to alleviate the negative effects raised by label shift.
  arXiv  Detail & Related papers  (2023-03-08T05:55:02Z)
• Cyclically Disentangled Feature Translation for Face Anti-spoofing [61.70377630461084]
  We propose a novel domain adaptation method called cyclically disentangled feature translation network (CDFTN) CDFTN generates pseudo-labeled samples that possess: 1) source domain-invariant liveness features and 2) target domain-specific content features, which are disentangled through domain adversarial training. A robust classifier is trained based on the synthetic pseudo-labeled images under the supervision of source domain labels.
  arXiv  Detail & Related papers  (2022-12-07T14:12:34Z)
• LE-UDA: Label-efficient unsupervised domain adaptation for medical image segmentation [24.655779957716558]
  We propose a novel and generic framework called Label-Efficient Unsupervised Domain Adaptation"(LE-UDA) In LE-UDA, we construct self-ensembling consistency for knowledge transfer between both domains, as well as a self-ensembling adversarial learning module to achieve better feature alignment for UDA. Experimental results demonstrate that the proposed LE-UDA can efficiently leverage limited source labels to improve cross-domain segmentation performance, outperforming state-of-the-art UDA approaches in the literature.
  arXiv  Detail & Related papers  (2022-12-05T07:47:35Z)
• CA-UDA: Class-Aware Unsupervised Domain Adaptation with Optimal Assignment and Pseudo-Label Refinement [84.10513481953583]
  unsupervised domain adaptation (UDA) focuses on the selection of good pseudo-labels as surrogates for the missing labels in the target data. source domain bias that deteriorates the pseudo-labels can still exist since the shared network of the source and target domains are typically used for the pseudo-label selections. We propose CA-UDA to improve the quality of the pseudo-labels and UDA results with optimal assignment, a pseudo-label refinement strategy and class-aware domain alignment.
  arXiv  Detail & Related papers  (2022-05-26T18:45:04Z)
• Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoning [66.80663779176979]
  Unsupervised domain adaptation (UDA) enables cross-domain learning without target domain labels. We show the insufficiency of minimizing source domain error and marginal distribution mismatch for a guaranteed reduction in the target domain error. Motivated from this, we propose novel data poisoning attacks to fool UDA methods into learning representations that produce large target domain errors.
  arXiv  Detail & Related papers  (2021-07-08T15:51:14Z)
• CLDA: Contrastive Learning for Semi-Supervised Domain Adaptation [1.2691047660244335]
  Unsupervised Domain Adaptation (UDA) aims to align the labeled source distribution with the unlabeled target distribution to obtain domain invariant predictive models. We propose Contrastive Learning framework for semi-supervised Domain Adaptation (CLDA) that attempts to bridge the intra-domain gap. CLDA achieves state-of-the-art results on all the above datasets.
  arXiv  Detail & Related papers  (2021-06-30T20:23:19Z)
• Adaptive Pseudo-Label Refinement by Negative Ensemble Learning for Source-Free Unsupervised Domain Adaptation [35.728603077621564]
  Existing Unsupervised Domain Adaptation (UDA) methods presumes source and target domain data to be simultaneously available during training. A pre-trained source model is always considered to be available, even though performing poorly on target due to the well-known domain shift problem. We propose a unified method to tackle adaptive noise filtering and pseudo-label refinement.
  arXiv  Detail & Related papers  (2021-03-29T22:18:34Z)
• Effective Label Propagation for Discriminative Semi-Supervised Domain Adaptation [76.41664929948607]
  Semi-supervised domain adaptation (SSDA) methods have demonstrated great potential in large-scale image classification tasks. We present a novel and effective method to tackle this problem by using effective inter-domain and intra-domain semantic information propagation. Our source code and pre-trained models will be released soon.
  arXiv  Detail & Related papers  (2020-12-04T14:28:19Z)
• Learning Target Domain Specific Classifier for Partial Domain Adaptation [85.71584004185031]
  Unsupervised domain adaptation (UDA) aims at reducing the distribution discrepancy when transferring knowledge from a labeled source domain to an unlabeled target domain. This paper focuses on a more realistic UDA scenario, where the target label space is subsumed to the source label space.
  arXiv  Detail & Related papers  (2020-08-25T02:28:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.