- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces FedDG-GCD, where decentralized clients train a model to recognize known categories and discover novel categories in an unseen target domain, without target-domain access during training. The proposed method, NOMAD, combines a Global Style Bank, adaptive prototype alignment, and saliency-stability-weighted aggregation, using the same style perturbations for local training and client weighting. At deployment, known samples are identified through prototype-based rejection, while rejected samples are clustered with an estimated category count. Experiments on 3 benchmarks verify its superioty.
Critical strengths
-
Unexplored settings of FedDG-GCD. Decentralized data, unseen-domain deployment, and unknown categories can coexist in practice. The proposed protocol brings these constraints into a common evaluation framework.
-
Coherent methodological design. Sharing a perturbation family between style diversification and client weighting provides a clear organizing principle. Prototype alignment also operates in the representation space used at inference.
Critical weaknesses
-
The relationship between domain generalization, federated leanring, open world discovery and FedDG-GCD is not well discussed. I can understand the FedDG-GCD is a new setting, but I think its necessity should be more strongly supported. In this paper, it seems that it's just a intersection of above 3 settings. Firstly, the author should give some evidence that this setting is useful in real world. Secondly, I can not distinguish the unique challenges of FedDG-GCD compared with the above settings. In Table 1, it seems that the baselines like DG2CD-Net and HIDISC can also achive the same goals of FedDG-GCD with a slight performance drop even it does not consider this setting.
-
Too many parameters included in the method may affect its practicality. NOMAD introduces many interacting hyperparameters, but how most are selected without target-domain access remains unclear. Sensitivity analysis is mainly limited to PACS and varies one parameter at a time, with some choices causing substantial performance drops. It therefore remains uncertain whether a fixed configuration can transfer reliably to new deployment conditions.
-
Saliency stability is an insufficiently validated proxy for client usefulness. A model can attend consistently to an incorrect or uninformative region, so stable saliency does not necessarily imply transferable representations. Estimating a client’s weight from a fixed probe further risks dependence on its category and appearance, particularly under severe label skew. Moreover, min–max normalization can amplify small, noisy differences between clients. The aggregation comparisons demonstrate empirical utility, but do not establish that the score reliably measures contribution to unseen-domain recognition and discovery.
Questions for authors
-
Which failure is specific to the joint FedDG-GCD setting rather than inherited from its component tasks? Can you provide controlled comparisons that isolate these interactions and compare shared versus independent perturbations for training and aggregation?
-
Are the small novel-class improvements on Office-Home and Mini-DomainNet statistically reliable? Can you evaluate more class splits, novel-class proportions, and client counts, alongside wall-clock and communication costs?
Thank you and final discussion update
We thank all three reviewers for the constructive discussion and valuable feedback, which has helped strengthen and clarify the paper.
Summary of Current Standing:
All new experiments and clarifications from the discussion have been incorporated into the revised PDF. We remain available to address any final questions.