- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes a promising FL framework to deal with the substantial label distributions differerence between each client. Clients exchange low-rank Gaussian components per class instead of weights or prototypes. The idea is interesting, however, the experiments are not enough to make this paper a solid one.
Critical strengths
- The idea is interesting, sharing GMM rather than weights or prototypes. However, it has also been discussed in general areas [1].
- Label absent is a very important question to be solved.
[1] Wu Y, Zhang S, Yu W, et al. Personalized federated learning under mixture of distributions[C]//International conference on machine learning. PMLR, 2023: 37860-37879.
Critical weaknesses
- The experiments are not enough, only main results are presented, no ablation makes the paper not that solid.
- The experiment settings is not clear. How to define the absent labels for each client?
- Less critical related work: Personalized Federated Learning under Mixture of Distributions.
Questions for authors
- How does the client seperation of the experiment settings? How do you define the absent labels for each client? If a client has some absent labels, how do the metrices calculate?
We thank the reviewer for recognising the problem of locally absent labels and the idea of sharing class mixtures instead of weights or prototypes, and for pointing us to FedGMM. Line numbers refer to the revised PDF.
S1 / W3. Relation to FedGMM.
FedGMM (Wu et al., 2023) is now discussed in Sec. 2.3 (l. 146–151) and contrasted with FedGME in the first contribution (l. 80–82).
What the two methods share. Both describe data with Gaussian mixtures and exchange Gaussian parameters instead of raw data.
How they differ. FedGMM models the input distribution, pairing a mixture over inputs or pretrained embeddings with predictors specific to each component, to handle covariate and concept shift. Its server averages both the Gaussian parameters and the predictor weights. Its Gaussians describe inputs rather than classes, so they cannot supply labelled features for a class a site lacks. FedGME instead models class-conditional features with one component per client and class, never averages these components and exchanges no model weights.
Why we compare against CCVR instead (l. 150–156). CCVR is the closest method to FedGME in both problem and mechanism: it targets label skew, estimates class-conditional feature Gaussians at each client and samples synthetic features from them to train the classifier. The two methods differ in what is shared and when. CCVR merges the statistics into one Gaussian per class, uses them after training and relies on FedAvg's shared model. FedGME keeps one component per client, uses the components during training and only for absent classes, and exchanges no weights. Applied on top of FedGME, CCVR's merging lowers absent-class accuracy on TUEV from 0.264 to 0.088 at K = 5 (Table 1; Sec. 4, l. 424–428).
W1. Not enough experiments; no ablation.
We added a leave-one-out ablation and three baselines.
Ablation (Table 7, App. C.1, l. 1117–1159; summary in Sec. 4, l. 473–476). Removing synthetic replay drops absent-class accuracy to zero on both corpora. Removing absent-subspace anchoring (L_freeze) reduces it by about 60%. Removing pretrained anchoring reduces it to 0.011 on TUEV and drops TUEV BAcc from 0.413 to 0.340. The two bank terms change every metric by at most 0.018, so we read them as close to neutral.
Baselines (Table 1; Sec. 4, l. 390–428). We added FedProto, FedSA, and CCVR on top of both FedAvg and FedGME. Among the methods that share no weights, FedGME has the highest BAcc on both multiclass corpora at both K, by 0.060–0.072 over the strongest such baseline. It is the only one above 0.012 on absent classes. FedAvg + CCVR, which shares all model weights every round, is stronger on TUEV, on TUSZ at K = 10 and on TUAB, and we report this openly (l. 420). FedGME and FedGME + CCVR lead on TUSZ at K = 5.
W2 / Q1. How are clients separated, how are absent labels defined, and how are metrics computed?
Clients. For each seed, every training patient is assigned to exactly one client, so clients hold disjoint sets of patients (App. B.3, l. 1021). Validation and test patients are never used for training, and all splits are patient-disjoint (App. B.1, l. 964–966; Tables 4–6).
Absent labels (Sec. 3.6, l. 369–377). After assigning patients, we remove selected classes from selected clients, while every class remains at two or more clients. A class is locally absent at a client if that client holds no training window of it.
The number of clients per class is fixed for each corpus and K, and roughly doubles from K = 5 to K = 10; the seed decides which clients these are. Classes are removed from training only.
Metrics for a client with absent labels (Sec. 3.6, l. 378–386; Eq. 15).
We hope this clarifies the setting and the relation to FedGMM, and we would be glad to answer any further questions.