MADG: Margin-based Adversarial Learning for Domain Generalization
- URL: http://arxiv.org/abs/2311.08503v1
- Date: Tue, 14 Nov 2023 19:53:09 GMT
- Title: MADG: Margin-based Adversarial Learning for Domain Generalization
- Authors: Aveen Dayal, Vimal K. B., Linga Reddy Cenkeramaddi, C. Krishna Mohan,
Abhinav Kumar and Vineeth N Balasubramanian
- Abstract summary: We propose a novel adversarial learning DG algorithm, MADG, motivated by a margin loss-based discrepancy metric.
The proposed MADG model learns domain-invariant features across all source domains and uses adversarial training to generalize well to the unseen target domain.
We extensively experiment with the MADG model on popular real-world DG datasets.
- Score: 25.45950080930517
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Domain Generalization (DG) techniques have emerged as a popular approach to
address the challenges of domain shift in Deep Learning (DL), with the goal of
generalizing well to the target domain unseen during the training. In recent
years, numerous methods have been proposed to address the DG setting, among
which one popular approach is the adversarial learning-based methodology. The
main idea behind adversarial DG methods is to learn domain-invariant features
by minimizing a discrepancy metric. However, most adversarial DG methods use
0-1 loss based $\mathcal{H}\Delta\mathcal{H}$ divergence metric. In contrast,
the margin loss-based discrepancy metric has the following advantages: more
informative, tighter, practical, and efficiently optimizable. To mitigate this
gap, this work proposes a novel adversarial learning DG algorithm, MADG,
motivated by a margin loss-based discrepancy metric. The proposed MADG model
learns domain-invariant features across all source domains and uses adversarial
training to generalize well to the unseen target domain. We also provide a
theoretical analysis of the proposed MADG model based on the unseen target
error bound. Specifically, we construct the link between the source and unseen
domains in the real-valued hypothesis space and derive the generalization bound
using margin loss and Rademacher complexity. We extensively experiment with the
MADG model on popular real-world DG datasets, VLCS, PACS, OfficeHome,
DomainNet, and TerraIncognita. We evaluate the proposed algorithm on
DomainBed's benchmark and observe consistent performance across all the
datasets.
Related papers
- Simple Domain Generalization Methods are Strong Baselines for Open
Domain Generalization [2.5889737226898437]
Domain generalization (DG) aims to handle the domain shift situation where the target domain of the inference phase is inaccessible during model training.
This work comprehensively evaluates existing DG methods in ODG and shows that two simple DG methods, CORrelation ALignment (CORAL) and Maximum Mean Discrepancy (MMD) are competitive with DAML in several cases.
arXiv Detail & Related papers (2023-03-31T13:08:31Z) - Domain-Specific Risk Minimization for Out-of-Distribution Generalization [104.17683265084757]
We first establish a generalization bound that explicitly considers the adaptivity gap.
We propose effective gap estimation methods for guiding the selection of a better hypothesis for the target.
The other method is minimizing the gap directly by adapting model parameters using online target samples.
arXiv Detail & Related papers (2022-08-18T06:42:49Z) - Adaptive Domain Generalization via Online Disagreement Minimization [17.215683606365445]
Domain Generalization aims to safely transfer a model to unseen target domains.
AdaODM adaptively modifies the source model at test time for different target domains.
Results show AdaODM stably improves the generalization capacity on unseen domains.
arXiv Detail & Related papers (2022-08-03T11:51:11Z) - Implicit Semantic Augmentation for Distance Metric Learning in Domain
Generalization [25.792285194055797]
Domain generalization (DG) aims to learn a model on one or more different but related source domains that could be generalized into an unseen target domain.
Existing DG methods try to prompt the diversity of source domains for the model's generalization ability.
This work applies the implicit semantic augmentation in feature space to capture the diversity of source domains.
arXiv Detail & Related papers (2022-08-02T11:37:23Z) - On Certifying and Improving Generalization to Unseen Domains [87.00662852876177]
Domain Generalization aims to learn models whose performance remains high on unseen domains encountered at test-time.
It is challenging to evaluate DG algorithms comprehensively using a few benchmark datasets.
We propose a universal certification framework that can efficiently certify the worst-case performance of any DG method.
arXiv Detail & Related papers (2022-06-24T16:29:43Z) - Compound Domain Generalization via Meta-Knowledge Encoding [55.22920476224671]
We introduce Style-induced Domain-specific Normalization (SDNorm) to re-normalize the multi-modal underlying distributions.
We harness the prototype representations, the centroids of classes, to perform relational modeling in the embedding space.
Experiments on four standard Domain Generalization benchmarks reveal that COMEN exceeds the state-of-the-art performance without the need of domain supervision.
arXiv Detail & Related papers (2022-03-24T11:54:59Z) - META: Mimicking Embedding via oThers' Aggregation for Generalizable
Person Re-identification [68.39849081353704]
Domain generalizable (DG) person re-identification (ReID) aims to test across unseen domains without access to the target domain data at training time.
This paper presents a new approach called Mimicking Embedding via oThers' Aggregation (META) for DG ReID.
arXiv Detail & Related papers (2021-12-16T08:06:50Z) - Towards Principled Disentanglement for Domain Generalization [90.9891372499545]
A fundamental challenge for machine learning models is generalizing to out-of-distribution (OOD) data.
We first formalize the OOD generalization problem as constrained optimization, called Disentanglement-constrained Domain Generalization (DDG)
Based on the transformation, we propose a primal-dual algorithm for joint representation disentanglement and domain generalization.
arXiv Detail & Related papers (2021-11-27T07:36:32Z) - Reappraising Domain Generalization in Neural Networks [8.06370138649329]
Domain generalization (DG) of machine learning algorithms is defined as their ability to learn a domain agnostic hypothesis from multiple training distributions.
We find that a straightforward Empirical Risk Minimization (ERM) baseline consistently outperforms existing DG methods.
We propose a classwise-DG formulation, where for each class, we randomly select one of the domains and keep it aside for testing.
arXiv Detail & Related papers (2021-10-15T10:06:40Z) - Model-Based Domain Generalization [96.84818110323518]
We propose a novel approach for the domain generalization problem called Model-Based Domain Generalization.
Our algorithms beat the current state-of-the-art methods on the very-recently-proposed WILDS benchmark by up to 20 percentage points.
arXiv Detail & Related papers (2021-02-23T00:59:02Z)
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.