Improving Domain Generalization in Contrastive Learning using Adaptive Temperature Control
Robert Lewis, Katie Matton, Rosalind W. Picard, John Guttag
TL;DR
The paper tackles covariate shift across domains in self-supervised contrastive learning by introducing a domain-aware adaptive temperature for the InfoNCE loss. A domain discriminator estimates $P(D=d|z)$ to compute per-pair weights $w_{ij}$ and pairwise temperatures $\tau_{ij}$, upweighting harder negatives from similar domains and promoting domain-invariant representations. Two variants, Domain-Weighted Negatives and Domain-Weighted Pairs, demonstrate improved OOD and ID performance on a Colored-MNIST benchmark with sparse labels, along with analyses of gradient behavior and ablations on discriminator design and projector heads. The approach yields more robust generalization to unseen domains and provides insights into how adaptive temperature can steer learning away from domain-specific cues while preserving task-relevant information.
Abstract
Self-supervised pre-training with contrastive learning is a powerful method for learning from sparsely labeled data. However, performance can drop considerably when there is a shift in the distribution of data from training to test time. We study this phenomenon in a setting in which the training data come from multiple domains, and the test data come from a domain not seen at training that is subject to significant covariate shift. We present a new method for contrastive learning that incorporates domain labels to increase the domain invariance of learned representations, leading to improved out-of-distribution generalization. Our method adjusts the temperature parameter in the InfoNCE loss -- which controls the relative weighting of negative pairs -- using the probability that a negative sample comes from the same domain as the anchor. This upweights pairs from more similar domains, encouraging the model to discriminate samples based on domain-invariant attributes. Through experiments on a variant of the MNIST dataset, we demonstrate that our method yields better out-of-distribution performance than domain generalization baselines. Furthermore, our method maintains strong in-distribution task performance, substantially outperforming baselines on this measure.
