Contrastive Diversity Augmentation for Single Domain Generalization

Single domain generalization aims to train a model on a single source domain that generalizes to unseen target domains, which is critical in multimedia applications. Current methods typically use adversarial data augmentation to enrich the source domain distribution with novel samples. However, these methods typically rely on labeled data and require adversarial training between generators and classifiers, which may limit sample diversity and introduce spurious correlations. To tackle these problems, we propose a method that integrates Contrastive clustering regularization with an Unsupervised Diversity Augmentation (UDA), termed C-UDA. Specifically, UDA is a flexible and general framework in which two customized models iteratively optimize a novel adversarial loss to enable fully unsupervised data augmentation. Within UDA, we design a lightweight generator that diversifies each input image along three distinct visual attributes. Based on both original and augmented images, we further introduce contrastive clustering regularization to encourage the model to learn domain-invariant representations, resulting in robust decision boundaries. Extensive experiments on four challenging benchmarks demonstrate that C-UDA significantly outperforms 22 state-of-the-art methods. The source code is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/Ruiding1/C-UDA</uri>.

Institutions

Publication Details

Journal
IEEE Transactions on Multimedia
Published
2025-09-23
DOI
https://doi.org/10.1109/tmm.2025.3613123
Primary Topic
Philosophy, Sociology, Political Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Contrastive Diversity Augmentation for Single Domain Generalization

IEEE Transactions on Multimedia
Philosophy, Sociology, Political Theory
article

Contrastive Diversity Augmentation for Single Domain Generalization

article en

Abstract

Single domain generalization aims to train a model on a single source domain that generalizes to unseen target domains, which is critical in multimedia applications. Current methods typically use adversarial data augmentation to enrich the source domain distribution with novel samples. However, these methods typically rely on labeled data and require adversarial training between generators and classifiers, which may limit sample diversity and introduce spurious correlations. To tackle these problems, we propose a method that integrates Contrastive clustering regularization with an Unsupervised Diversity Augmentation (UDA), termed C-UDA. Specifically, UDA is a flexible and general framework in which two customized models iteratively optimize a novel adversarial loss to enable fully unsupervised data augmentation. Within UDA, we design a lightweight generator that diversifies each input image along three distinct visual attributes. Based on both original and augmented images, we further introduce contrastive clustering regularization to encourage the model to learn domain-invariant representations, resulting in robust decision boundaries. Extensive experiments on four challenging benchmarks demonstrate that C-UDA significantly outperforms 22 state-of-the-art methods. The source code is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/Ruiding1/C-UDA</uri>.

IEEE Transactions on MultimediaVol. 28
Central South University (CN), Wenzhou University (CN)
Openalex Percentile: Top 38%
Philosophy, Sociology, Political Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.