Feature Modulation for Semi-Supervised Domain Generalization without Domain Labels
Venuri Amarasinghe, Asini Jayakody, Isun Randila, Kalinga Bandara, Chamuditha Jayanga Galappaththige, Ranga Rodrigo
TL;DR
This work tackles semisupervised domain generalization (SSDG) without access to domain labels during training. It introduces a feature modulator guided by Similar Average Representations (SAR) to suppress domain-specific information and emphasize class-discriminative signals, paired with an uncertainty-aware, loss-scaled pseudo-labeling scheme to better utilize unlabeled data. The method achieves consistent gains over FixMatch baselines across four major DG benchmarks (PACS, OfficeHome, VLCS, DigitsDG) in both 5- and 10-label settings, and demonstrates improved class separation with robust performance under class imbalance. By removing the need for domain labels while boosting pseudo-label quality and unlabeled data usage, the approach has practical implications for real-world domain generalization tasks where domain annotations are scarce or unavailable.
Abstract
Semi-supervised domain generalization (SSDG) leverages a small fraction of labeled data alongside unlabeled data to enhance model generalization. Most of the existing SSDG methods rely on pseudo-labeling (PL) for unlabeled data, often assuming access to domain labels-a privilege not always available. However, domain shifts introduce domain noise, leading to inconsistent PLs that degrade model performance. Methods derived from FixMatch suffer particularly from lower PL accuracy, reducing the effectiveness of unlabeled data. To address this, we tackle the more challenging domain-label agnostic SSDG, where domain labels for unlabeled data are not available during training. First, we propose a feature modulation strategy that enhances class-discriminative features while suppressing domain-specific information. This modulation shifts features toward Similar Average Representations-a modified version of class prototypes-that are robust across domains, encouraging the classifier to distinguish between closely related classes and feature extractor to form tightly clustered, domain-invariant representations. Second, to mitigate domain noise and improve pseudo-label accuracy, we introduce a loss-scaling function that dynamically lowers the fixed confidence threshold for pseudo-labels, optimizing the use of unlabeled data. With these key innovations, our approach achieves significant improvements on four major domain generalization benchmarks-even without domain labels. We will make the code available.
