Robustness to Subpopulation Shift with Domain Label Noise via Regularized Annotation of Domains

• URL: http://arxiv.org/abs/2402.11039v2
• Date: Wed, 26 Jun 2024 16:35:16 GMT
• Title: Robustness to Subpopulation Shift with Domain Label Noise via Regularized Annotation of Domains
• Authors: Nathan Stromberg, Rohan Ayyagari, Monica Welfert, Sanmi Koyejo, Richard Nock, Lalitha Sankar,
• Abstract summary: We introduce Regularized reliant of Domains (RAD) in order to train robust last layer classifiers without the need for explicit domain annotations. RAD outperforms state-of-the-art annotation-reliant methods even with only 5% noise in the training data for several publicly available datasets.
• Score: 27.524318404316013
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing methods for last layer retraining that aim to optimize worst-group accuracy (WGA) rely heavily on well-annotated groups in the training data. We show, both in theory and practice, that annotation-based data augmentations using either downsampling or upweighting for WGA are susceptible to domain annotation noise, and in high-noise regimes approach the WGA of a model trained with vanilla empirical risk minimization. We introduce Regularized Annotation of Domains (RAD) in order to train robust last layer classifiers without the need for explicit domain annotations. Our results show that RAD is competitive with other recently proposed domain annotation-free techniques. Most importantly, RAD outperforms state-of-the-art annotation-reliant methods even with only 5% noise in the training data for several publicly available datasets.

Related papers

• Noise-Aware Generalization: Robustness to In-Domain Noise and Out-of-Domain Generalization [19.405975017917957]
  Multi-source Domain Generalization (DG) aims to improve model robustness to new distributions. However, DG methods often overlook the effect of label noise, which can confuse a model during training, reducing performance. In this paper, we investigate this underexplored space, where models are evaluated under both distribution shifts and label noise. Our proposed DL4ND approach improves noise detection by taking advantage of the observation that noisy samples that may appear indistinguishable within a single domain often show greater variation when compared across domains.
  arXiv  Detail & Related papers  (2025-04-03T19:37:57Z)
• Is Large-Scale Pretraining the Secret to Good Domain Generalization? [69.80606575323691]
  Multi-Source Domain Generalization (DG) is the task of training on multiple source domains and achieving high classification performance on unseen target domains. Recent methods combine robust features from web-scale pretrained backbones with new features learned from source data, and this has dramatically improved benchmark results. We show that all evaluated DG methods struggle on DomainBed-OOP, while recent methods excel on DomainBed-IP.
  arXiv  Detail & Related papers  (2024-12-03T21:43:11Z)
• AGLP: A Graph Learning Perspective for Semi-supervised Domain Adaptation [13.472532378889264]
  In semi-supervised domain adaptation (SSDA), the model aims to leverage partially labeled target domain data along with a large amount of labeled source domain data. This paper proposes a graph learning perspective (AGLP) for semi-supervised domain adaptation. We apply the graph convolutional network to the instance graph which allows structural information to propagate along the weighted graph edges.
  arXiv  Detail & Related papers  (2024-11-20T09:41:41Z)
• Improve Cross-domain Mixed Sampling with Guidance Training for Adaptive Segmentation [9.875170018805768]
  Unsupervised Domain Adaptation (UDA) endeavors to adjust models trained on a source domain to perform well on a target domain without requiring additional annotations. We propose a novel auxiliary task called Guidance Training. This task facilitates the effective utilization of cross-domain mixed sampling techniques while mitigating distribution shifts from the real world. We demonstrate the efficacy of our approach by integrating it with existing methods, consistently improving performance.
  arXiv  Detail & Related papers  (2024-03-22T07:12: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)
• FIXED: Frustratingly Easy Domain Generalization with Mixup [53.782029033068675]
  Domain generalization (DG) aims to learn a generalizable model from multiple training domains such that it can perform well on unseen target domains. A popular strategy is to augment training data to benefit generalization through methods such as Mixupcitezhang 2018mixup. We propose a simple yet effective enhancement for Mixup-based DG, namely domain-invariant Feature mIXup (FIX) Our approach significantly outperforms nine state-of-the-art related methods, beating the best performing baseline by 6.5% on average in terms of test accuracy.
  arXiv  Detail & Related papers  (2022-11-07T09:38:34Z)
• Exploiting Instance-based Mixed Sampling via Auxiliary Source Domain Supervision for Domain-adaptive Action Detection [75.38704117155909]
  We propose a novel domain adaptive action detection approach and a new adaptation protocol. Self-training combined with cross-domain mixed sampling has shown remarkable performance gain in UDA context. We name our proposed framework as domain-adaptive action instance mixing (DA-AIM)
  arXiv  Detail & Related papers  (2022-09-28T22:03:25Z)
• Towards Robust Cross-domain Image Understanding with Unsupervised Noise Removal [18.21213151403402]
  We find that contemporary domain adaptation methods for cross-domain image understanding perform poorly when source domain is noisy. We propose a novel method, termed Noise Tolerant Domain Adaptation, for Weakly Supervised Domain Adaptation (WSDA) We conduct extensive experiments to evaluate the effectiveness of our method on both general images and medical images from COVID-19 and e-commerce datasets.
  arXiv  Detail & Related papers  (2021-09-09T14:06:59Z)
• SAND-mask: An Enhanced Gradient Masking Strategy for the Discovery of Invariances in Domain Generalization [7.253255826783766]
  We propose a masking strategy, which determines a continuous weight based on the agreement of gradients that flow in each edge of network. SAND-mask is validated over the Domainbed benchmark for domain generalization.
  arXiv  Detail & Related papers  (2021-06-04T05:20:54Z)
• Generalizable Representation Learning for Mixture Domain Face Anti-Spoofing [53.82826073959756]
  Face anti-spoofing approach based on domain generalization(DG) has drawn growing attention due to its robustness forunseen scenarios. We propose domain dy-namic adjustment meta-learning (D2AM) without using do-main labels. To overcome the limitation, we propose domain dy-namic adjustment meta-learning (D2AM) without using do-main labels.
  arXiv  Detail & Related papers  (2021-05-06T06:04:59Z)
• Re-energizing Domain Discriminator with Sample Relabeling for Adversarial Domain Adaptation [88.86865069583149]
  Unsupervised domain adaptation (UDA) methods exploit domain adversarial training to align the features to reduce domain gap. In this work, we propose an efficient optimization strategy named Re-enforceable Adversarial Domain Adaptation (RADA) RADA aims to re-energize the domain discriminator during the training by using dynamic domain labels.
  arXiv  Detail & Related papers  (2021-03-22T08:32:55Z)
• Domain Adaptation in LiDAR Semantic Segmentation by Aligning Class Distributions [9.581605678437032]
  This work addresses the problem of unsupervised domain adaptation for LiDAR semantic segmentation models. Our approach combines novel ideas on top of the current state-of-the-art approaches and yields new state-of-the-art results.
  arXiv  Detail & Related papers  (2020-10-23T08:52:15Z)
• Learning Invariant Representations and Risks for Semi-supervised Domain Adaptation [109.73983088432364]
  We propose the first method that aims to simultaneously learn invariant representations and risks under the setting of semi-supervised domain adaptation (Semi-DA) We introduce the LIRR algorithm for jointly textbfLearning textbfInvariant textbfRepresentations and textbfRisks.
  arXiv  Detail & Related papers  (2020-10-09T15:42:35Z)

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.