Contrastive-Enhanced Domain Generalization With Federated Learning
Bibliographic record
Abstract
Domain generalization (DG) aims to train a global model from different but related domains, which can be generalized to an unseen out-of-distribution domain. Most existing DG methods are based on the centralized learning paradigm, raising the privacy leakage concern. In this paper, we propose a contrastive-enhanced domain generalization framework in the federated learning paradigm (FedCDG), where there are a server and multiple clients. Each client owns data from one domain and builds a local model consisting of a domain-invariant feature extractor and a classifier head. The server generates a global model through aggregating and broadcasting local models' parameters, thus achieving knowledge sharing and keeping data confidential. To enhance the discrimination and generalization ability of the local model, we build an improved instance normalization module that focuses on task-relevant features with less domain-specific information. Moreover, for better class-wise alignment in the embedding space, we propose a prototype-based contrastive loss. Given the limited annotation budget in practice, we also extend the proposed framework into the semi-supervised DG setting (i.e., only 10 labelled samples per class). Experimental results on 3 benchmarks and different backbones show that the proposed framework yields promising performances for both DG and semi-supervised DG in the federated learning paradigm.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".