Towards Generalizing to Unseen Domains with Few Labels
Chamuditha Jayanga Galappaththige, Sanoojan Baliah, Malitha Gunawardhana, Muhammad Haris Khan
TL;DR
This work tackles semi-supervised domain generalization (SSDG), where abundant unlabeled data from multiple source domains must complement limited labeled data to generalize to unseen domains. The authors introduce a plug-and-play framework that augments SSL baselines with two losses: feature-based conformity (FBC), which aligns feature-space posteriors with pseudo-labels using domain-aware prototypes $\mathbf{K}_c^d$, and a semantics alignment (SA) constraint that regularizes the semantic layout by promoting cohesion around assigned prototypes and discouraging proximity to hard non-assigned prototypes. The method is model-agnostic and integrates with strong SSL baselines (e.g., FixMatch, StyleMatch) across five DG benchmarks, achieving consistent improvements (often several percentage points) in both 5- and 10-label settings. The results demonstrate improved cross-domain robustness in practical SSDG scenarios without adding extra learnable parameters, while noting limitations for semi-supervised single-source DG and suggesting avenues for extending the framework.
Abstract
We approach the challenge of addressing semi-supervised domain generalization (SSDG). Specifically, our aim is to obtain a model that learns domain-generalizable features by leveraging a limited subset of labelled data alongside a substantially larger pool of unlabeled data. Existing domain generalization (DG) methods which are unable to exploit unlabeled data perform poorly compared to semi-supervised learning (SSL) methods under SSDG setting. Nevertheless, SSL methods have considerable room for performance improvement when compared to fully-supervised DG training. To tackle this underexplored, yet highly practical problem of SSDG, we make the following core contributions. First, we propose a feature-based conformity technique that matches the posterior distributions from the feature space with the pseudo-label from the model's output space. Second, we develop a semantics alignment loss to learn semantically-compatible representations by regularizing the semantic structure in the feature space. Our method is plug-and-play and can be readily integrated with different SSL-based SSDG baselines without introducing any additional parameters. Extensive experimental results across five challenging DG benchmarks with four strong SSL baselines suggest that our method provides consistent and notable gains in two different SSDG settings.
