Unsupervised domain adaptation with non-stochastic missing data

• URL: http://arxiv.org/abs/2109.09505v1
• Date: Thu, 16 Sep 2021 06:37:07 GMT
• Title: Unsupervised domain adaptation with non-stochastic missing data
• Authors: Matthieu Kirchmeyer (MLIA), Patrick Gallinari (MLIA), Alain Rakotomamonjy (LITIS), Amin Mantrach
• Abstract summary: We consider unsupervised domain adaptation (UDA) for classification problems in the presence of missing data in the unlabelled target domain. Imputation is performed in a domain-invariant latent space and leverages indirect supervision from a complete source domain. We show the benefits of jointly performing adaptation, classification and imputation on datasets.
• Score: 0.6608945629704323
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider unsupervised domain adaptation (UDA) for classification problems in the presence of missing data in the unlabelled target domain. More precisely, motivated by practical applications, we analyze situations where distribution shift exists between domains and where some components are systematically absent on the target domain without available supervision for imputing the missing target components. We propose a generative approach for imputation. Imputation is performed in a domain-invariant latent space and leverages indirect supervision from a complete source domain. We introduce a single model performing joint adaptation, imputation and classification which, under our assumptions, minimizes an upper bound of its target generalization error and performs well under various representative divergence families (H-divergence, Optimal Transport). Moreover, we compare the target error of our Adaptation-imputation framework and the "ideal" target error of a UDA classifier without missing target components. Our model is further improved with self-training, to bring the learned source and target class posterior distributions closer. We perform experiments on three families of datasets of different modalities: a classical digit classification benchmark, the Amazon product reviews dataset both commonly used in UDA and real-world digital advertising datasets. We show the benefits of jointly performing adaptation, classification and imputation on these datasets.

Related papers

• Unsupervised Domain Adaptation via Distilled Discriminative Clustering [45.39542287480395]
  We re-cast the domain adaptation problem as discriminative clustering of target data. We propose to jointly train the network using parallel, supervised learning objectives over labeled source data. We conduct careful ablation studies and extensive experiments on five popular benchmark datasets.
  arXiv  Detail & Related papers  (2023-02-23T13:03:48Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• Domain Adaptation Principal Component Analysis: base linear method for learning with out-of-distribution data [55.41644538483948]
  Domain adaptation is a popular paradigm in modern machine learning. We present a method called Domain Adaptation Principal Component Analysis (DAPCA) DAPCA finds a linear reduced data representation useful for solving the domain adaptation task.
  arXiv  Detail & Related papers  (2022-08-28T21:10:56Z)
• 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)
• Boosting Unsupervised Domain Adaptation with Soft Pseudo-label and Curriculum Learning [19.903568227077763]
  Unsupervised domain adaptation (UDA) improves classification performance on an unlabeled target domain by leveraging data from a fully labeled source domain. We propose a model-agnostic two-stage learning framework, which greatly reduces flawed model predictions using soft pseudo-label strategy. At the second stage, we propose a curriculum learning strategy to adaptively control the weighting between losses from the two domains.
  arXiv  Detail & Related papers  (2021-12-03T14:47:32Z)
• 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)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• Domain Adaptation with Incomplete Target Domains [61.68950959231601]
  We propose an Incomplete Data Imputation based Adversarial Network (IDIAN) model to address this new domain adaptation challenge. In the proposed model, we design a data imputation module to fill the missing feature values based on the partial observations in the target domain. We conduct experiments on both cross-domain benchmark tasks and a real world adaptation task with imperfect target domains.
  arXiv  Detail & Related papers  (2020-12-03T00:07:40Z)
• Unsupervised BatchNorm Adaptation (UBNA): A Domain Adaptation Method for Semantic Segmentation Without Using Source Domain Representations [35.586031601299034]
  Unsupervised BatchNorm Adaptation (UBNA) adapts a given pre-trained model to an unseen target domain. We partially adapt the normalization layer statistics to the target domain using an exponentially decaying momentum factor. Compared to standard UDA approaches we report a trade-off between performance and usage of source domain representations.
  arXiv  Detail & Related papers  (2020-11-17T08:37:40Z)
• Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation [102.67010690592011]
  Unsupervised adaptationUDA (UDA) aims to leverage the knowledge learned from a labeled source dataset to solve similar tasks in a new unlabeled domain. Prior UDA methods typically require to access the source data when learning to adapt the model. This work tackles a practical setting where only a trained source model is available and how we can effectively utilize such a model without source data to solve UDA problems.
  arXiv  Detail & Related papers  (2020-02-20T03:13:58Z)
• Enlarging Discriminative Power by Adding an Extra Class in Unsupervised Domain Adaptation [5.377369521932011]
  We propose an idea of empowering the discriminativeness: Adding a new, artificial class and training the model on the data together with the GAN-generated samples of the new class. Our idea is highly generic so that it is compatible with many existing methods such as DANN, VADA, and DIRT-T.
  arXiv  Detail & Related papers  (2020-02-19T07:58: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.