DomainAdaptor: A Novel Approach to Test-time Adaptation

• URL: http://arxiv.org/abs/2308.10297v1
• Date: Sun, 20 Aug 2023 15:37:01 GMT
• Title: DomainAdaptor: A Novel Approach to Test-time Adaptation
• Authors: Jian Zhang, Lei Qi, Yinghuan Shi, Yang Gao
• Abstract summary: DomainAdaptor aims to adapt a trained CNN model to unseen domains during the test. AdaMixBN addresses the domain shift by adaptively fusing training and test statistics in the normalization layer. Experiments show that DomainAdaptor consistently outperforms the state-of-the-art methods on four benchmarks.
• Score: 33.770970763959355
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To deal with the domain shift between training and test samples, current methods have primarily focused on learning generalizable features during training and ignore the specificity of unseen samples that are also critical during the test. In this paper, we investigate a more challenging task that aims to adapt a trained CNN model to unseen domains during the test. To maximumly mine the information in the test data, we propose a unified method called DomainAdaptor for the test-time adaptation, which consists of an AdaMixBN module and a Generalized Entropy Minimization (GEM) loss. Specifically, AdaMixBN addresses the domain shift by adaptively fusing training and test statistics in the normalization layer via a dynamic mixture coefficient and a statistic transformation operation. To further enhance the adaptation ability of AdaMixBN, we design a GEM loss that extends the Entropy Minimization loss to better exploit the information in the test data. Extensive experiments show that DomainAdaptor consistently outperforms the state-of-the-art methods on four benchmarks. Furthermore, our method brings more remarkable improvement against existing methods on the few-data unseen domain. The code is available at https://github.com/koncle/DomainAdaptor.

Related papers

• BoostAdapter: Improving Vision-Language Test-Time Adaptation via Regional Bootstrapping [64.8477128397529]
  We propose a training-required and training-free test-time adaptation framework. We maintain a light-weight key-value memory for feature retrieval from instance-agnostic historical samples and instance-aware boosting samples. We theoretically justify the rationality behind our method and empirically verify its effectiveness on both the out-of-distribution and the cross-domain datasets.
  arXiv  Detail & Related papers  (2024-10-20T15:58:43Z)
• What, How, and When Should Object Detectors Update in Continually Changing Test Domains? [34.13756022890991]
  Test-time adaptation algorithms have been proposed to adapt the model online while inferring test data. We propose a novel online adaption approach for object detection in continually changing test domains. Our approach surpasses baselines on widely used benchmarks, achieving improvements of up to 4.9%p and 7.9%p in mAP.
  arXiv  Detail & Related papers  (2023-12-12T07:13:08Z)
• Informative Data Mining for One-Shot Cross-Domain Semantic Segmentation [84.82153655786183]
  We propose a novel framework called Informative Data Mining (IDM) to enable efficient one-shot domain adaptation for semantic segmentation. IDM provides an uncertainty-based selection criterion to identify the most informative samples, which facilitates quick adaptation and reduces redundant training. Our approach outperforms existing methods and achieves a new state-of-the-art one-shot performance of 56.7%/55.4% on the GTA5/SYNTHIA to Cityscapes adaptation tasks.
  arXiv  Detail & Related papers  (2023-09-25T15:56:01Z)
• Unsupervised Noise adaptation using Data Simulation [21.866522173387715]
  We propose a generative adversarial network based method to efficiently learn a converse clean-to-noisy transformation. Experimental results show that our method effectively mitigates the domain mismatch between training and test sets.
  arXiv  Detail & Related papers  (2023-02-23T12:57:20Z)
• 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)
• IDANI: Inference-time Domain Adaptation via Neuron-level Interventions [24.60778570114818]
  We propose a new approach for domain adaptation (DA), using neuron-level interventions. We modify the representation of each test example in specific neurons, resulting in a counterfactual example from the source domain. Our experiments show that our method improves performance on unseen domains.
  arXiv  Detail & Related papers  (2022-06-01T06:39:28Z)
• CAFA: Class-Aware Feature Alignment for Test-Time Adaptation [50.26963784271912]
  Test-time adaptation (TTA) aims to address this challenge by adapting a model to unlabeled data at test time. We propose a simple yet effective feature alignment loss, termed as Class-Aware Feature Alignment (CAFA), which simultaneously encourages a model to learn target representations in a class-discriminative manner.
  arXiv  Detail & Related papers  (2022-06-01T03:02:07Z)
• Learning Instance-Specific Adaptation for Cross-Domain Segmentation [79.61787982393238]
  We propose a test-time adaptation method for cross-domain image segmentation. Given a new unseen instance at test time, we adapt a pre-trained model by conducting instance-specific BatchNorm calibration.
  arXiv  Detail & Related papers  (2022-03-30T17:59:45Z)
• Self-Domain Adaptation for Face Anti-Spoofing [31.441928816043536]
  We propose a self-domain adaptation framework to leverage the unlabeled test domain data at inference. A meta-learning based adaptor learning algorithm is proposed using the data of multiple source domains at the training step.
  arXiv  Detail & Related papers  (2021-02-24T08:46:39Z)
• Adaptive Risk Minimization: Learning to Adapt to Domain Shift [109.87561509436016]
  A fundamental assumption of most machine learning algorithms is that the training and test data are drawn from the same underlying distribution. In this work, we consider the problem setting of domain generalization, where the training data are structured into domains and there may be multiple test time shifts. We introduce the framework of adaptive risk minimization (ARM), in which models are directly optimized for effective adaptation to shift by learning to adapt on the training domains.
  arXiv  Detail & Related papers  (2020-07-06T17:59:30Z)

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.