Multi-step Online Unsupervised Domain Adaptation

• URL: http://arxiv.org/abs/2002.08930v1
• Date: Thu, 20 Feb 2020 18:26:02 GMT
• Title: Multi-step Online Unsupervised Domain Adaptation
• Authors: J. H. Moon, Debasmit Das and C. S. George Lee
• Abstract summary: We propose a multi-step framework for the Online Unsupervised Domain Adaptation problem. We compute the mean-target subspace inspired by the geometrical interpretation on the Euclidean space. The transformation matrix computed from the mean-target subspace is applied to the next target data as a preprocessing step.
• Score: 10.312968200748116
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we address the Online Unsupervised Domain Adaptation (OUDA) problem, where the target data are unlabelled and arriving sequentially. The traditional methods on the OUDA problem mainly focus on transforming each arriving target data to the source domain, and they do not sufficiently consider the temporal coherency and accumulative statistics among the arriving target data. We propose a multi-step framework for the OUDA problem, which institutes a novel method to compute the mean-target subspace inspired by the geometrical interpretation on the Euclidean space. This mean-target subspace contains accumulative temporal information among the arrived target data. Moreover, the transformation matrix computed from the mean-target subspace is applied to the next target data as a preprocessing step, aligning the target data closer to the source domain. Experiments on four datasets demonstrated the contribution of each step in our proposed multi-step OUDA framework and its performance over previous approaches.

Related papers

• Progressive Conservative Adaptation for Evolving Target Domains [76.9274842289221]
  Conventional domain adaptation typically transfers knowledge from a source domain to a stationary target domain. Restoring and adapting to such target data results in escalating computational and resource consumption over time. We propose a simple yet effective approach, termed progressive conservative adaptation (PCAda)
  arXiv  Detail & Related papers  (2024-02-07T04:11:25Z)
• Subject-Based Domain Adaptation for Facial Expression Recognition [51.10374151948157]
  Adapting a deep learning model to a specific target individual is a challenging facial expression recognition task. This paper introduces a new MSDA method for subject-based domain adaptation in FER. It efficiently leverages information from multiple source subjects to adapt a deep FER model to a single target individual.
  arXiv  Detail & Related papers  (2023-12-09T18:40:37Z)
• IIDM: Inter and Intra-domain Mixing for Semi-supervised Domain Adaptation in Semantic Segmentation [46.6002506426648]
  Unsupervised domain adaptation (UDA) is the dominant approach to solve this problem. We propose semi-supervised domain adaptation (SSDA) to overcome this limitation. We propose a novel framework that incorporates both Inter and Intra Domain Mixing (IIDM), where inter-domain mixing mitigates the source-target domain gap and intra-domain mixing enriches the available target domain information.
  arXiv  Detail & Related papers  (2023-08-30T08:44:21Z)
• Open-Set Domain Adaptation with Visual-Language Foundation Models [51.49854335102149]
  Unsupervised domain adaptation (UDA) has proven to be very effective in transferring knowledge from a source domain to a target domain with unlabeled data. Open-set domain adaptation (ODA) has emerged as a potential solution to identify these classes during the training phase.
  arXiv  Detail & Related papers  (2023-07-30T11:38:46Z)
• A Multi-stage Framework with Mean Subspace Computation and Recursive Feedback for Online Unsupervised Domain Adaptation [9.109788577327503]
  We propose a novel framework to solve real-world situations when the target data are unlabeled and arriving online sequentially in batches. To project the data from the source and the target domains to a common subspace and manipulate the projected data in real-time, our proposed framework institutes a novel method. Experiments on six datasets were conducted to investigate in depth the effect and contribution of each stage in our proposed framework.
  arXiv  Detail & Related papers  (2022-06-24T03:50:34Z)
• Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
  Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data. In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
  arXiv  Detail & Related papers  (2022-04-24T12:22:19Z)
• Multi-Source Unsupervised Domain Adaptation via Pseudo Target Domain [0.0]
  Multi-source domain adaptation (MDA) aims to transfer knowledge from multiple source domains to an unlabeled target domain. We propose a novel MDA approach, termed Pseudo Target for MDA (PTMDA) PTMDA maps each group of source and target domains into a group-specific subspace using adversarial learning with a metric constraint. We show that PTMDA as a whole can reduce the target error bound and leads to a better approximation of the target risk in MDA settings.
  arXiv  Detail & Related papers  (2022-02-22T08:37:16Z)
• Adapting Off-the-Shelf Source Segmenter for Target Medical Image Segmentation [12.703234995718372]
  Unsupervised domain adaptation (UDA) aims to transfer knowledge learned from a labeled source domain to an unlabeled and unseen target domain. Access to the source domain data at the adaptation stage is often limited, due to data storage or privacy issues. We propose to adapt an off-the-shelf" segmentation model pre-trained in the source domain to the target domain.
  arXiv  Detail & Related papers  (2021-06-23T16:16:55Z)
• ConDA: Continual Unsupervised Domain Adaptation [0.0]
  Domain Adaptation (DA) techniques are important for overcoming the domain shift between the source domain used for training and the target domain where testing takes place. Current DA methods assume that the entire target domain is available during adaptation, which may not hold in practice. This paper considers a more realistic scenario, where target data become available in smaller batches and adaptation on the entire target domain is not feasible.
  arXiv  Detail & Related papers  (2021-03-19T23:20:41Z)
• Cluster, Split, Fuse, and Update: Meta-Learning for Open Compound Domain Adaptive Semantic Segmentation [102.42638795864178]
  We propose a principled meta-learning based approach to OCDA for semantic segmentation. We cluster target domain into multiple sub-target domains by image styles, extracted in an unsupervised manner. A meta-learner is thereafter deployed to learn to fuse sub-target domain-specific predictions, conditioned upon the style code. We learn to online update the model by model-agnostic meta-learning (MAML) algorithm, thus to further improve generalization.
  arXiv  Detail & Related papers  (2020-12-15T13:21:54Z)
• MADAN: Multi-source Adversarial Domain Aggregation Network for Domain Adaptation [58.38749495295393]
  Domain adaptation aims to learn a transferable model to bridge the domain shift between one labeled source domain and another sparsely labeled or unlabeled target domain. Recent multi-source domain adaptation (MDA) methods do not consider the pixel-level alignment between sources and target. We propose a novel MDA framework to address these challenges.
  arXiv  Detail & Related papers  (2020-02-19T21:22:00Z)

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.