- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper addresses topological and statistical heterogeneity in Federated Graph Learning (FGL) by proposing FedSeed, a framework that coordinates the second moment of local Adam optimizers. The authors observe that under a decoupled GNN architecture with a linear readout, the hop-block energy share of the local second moment approximates the client's multi-hop feature energy profile. Based on this, FedSeed introduces: (1) a compressed communication channel transmitting block-level second-moment scalars; (2) a hyperparameter-free, closed-form per-parameter client mixing coefficient derived by minimizing an update-space risk trading off step distortion against gradient noise amplification; and (3) a server-side similarity aggregation strategy using a Gaussian kernel over client hop energy profiles. The method is evaluated on seven datasets using GCN and GAMLP backbones across different client scales and Dirichlet non-IID settings, comparing against generic federated learning baselines.
Critical strengths
- FedSeed treats Adam’s second moment as a signal for both personalization and client coordination. This is a concrete and potentially novel design direction for federated graph learning.
- By formulating second-moment mixing in update space () as a trade-off between step distortion and gradient noise floor, the paper derives an exact closed-form coefficient that requires no tuning and provably prevents step-size explosion by ensuring .
Critical weaknesses
- The empirical validation does not include the closest relevant baselines. The experiments omit FedAdamW and several graph-federated methods discussed in the related-work section, including FedGTA, FedTAD, FedPub, and GraphP-FL. Therefore, the reported gains only establish superiority over the selected baselines, not over the most relevant alternatives.
- Methodological Disconnect for Standard GNNs and Missing Reproducibility Details: The theoretical derivation of hop energy profiles (Eq. 4) and hop-block compression (Section 3.3, Appendix A) explicitly requires a decoupled GNN where readout weights are indexed by propagation hop . However, half of the experiments (Table 1, Figure 2, Figure 4) use a standard GCN, where layers are coupled with non-linearities and no hop-indexed readout blocks exist. The paper fails to explain how hop profiles or block compression/decompression operate on GCN. Combined with unspecified formulas for profile dispersion and bandwidth (Algorithm 1), contradictory mixing schedules, and unverified partial-participation claims, the method is neither fully sound across backbones nor reproducible.
Questions for authors
- Why are FedAdamW and the graph-federated baselines discussed in Section 2 absent from the experiments? Under matched architectures, partitions, hyperparameter budgets, and communication budgets, does FedSeed still outperform them?
- How are "hop blocks," the hop energy profile (Eq. 4), and the compression/decompression mapping between the 10 scalars and full -dimensional parameter vectors defined and implemented when the backbone is a standard multi-layer GCN rather than a decoupled GNN?
- Is evaluation performed using the global model, client-local models, or personalized models? Please specify the data splits, model-selection procedure, and the construction of the AGNews graph.
2 comments
Thank you to the authors for the detailed response and for providing additional clarifications on the GCN layer-wise block mapping, bandwidth calibration, AGNews graph construction, and supplementary baseline runs on Cora and CiteSeer.
I have carefully reviewed the rebuttal. While these clarifications improve transparency regarding the implementation details, my main concerns remain unresolved:
1.Empirical Validation & Baseline Comparisons: The newly added FGL baselines (FedGTA, FedTAD, FED-PUB) and FedAdamW are only evaluated on two small-scale datasets (Cora and CiteSeer, GCN, ), where the proposed framework still underperforms tuned FedProx on both datasets (84.46 vs. 86.29 on Cora; 71.35 vs. 73.19 on CiteSeer) and ties with FedAdamW (84.46 vs. 84.74). Moreover, the severe data anomalies, truncated entries, and cross-backbone identical baseline values in the original main tables (Tables 1 and 2) were not directly addressed.
2.Methodological Fit on Standard GNNs: The authors' reported fidelity metric for GCN (, compared to for decoupled SIGN) confirms that the hop-block factorization assumption does not hold well for standard message-passing GNNs.
Given the extent of the required revisions and re-evaluations across all datasets and backbones, I will maintain my current rating. I encourage the authors to incorporate these clarifications and thoroughly overhaul the experimental tables in a future revision.
Dear Reviewer QCea,
We sincerely appreciate the time and effort you have invested in reviewing our paper. We hope that our responses below will effectively address your concerns.
Q1: Why are FedAdamW and the graph baselines absent, and does our framework still win under matched conditions?
Re1: The earlier harness covered only generic FL methods; the current version runs all four, each following its reference implementation: FedAdamW (official: v reset to the uploaded mean, m zeroed, step pinned to the server counter, −γ·lr/K·m̄), FedGTA (PVLDB'24, gate α=0.65), FedTAD (IJCAI'24), FED-PUB (ICML'23, MaskedGCN + functional similarity), the latter two via OpenFGL. GraphP-FL lacks a public implementation, so we omit it rather than use an unvalidated re-implementation. Accuracy (GCN, K=10, Metis, 200 rounds, 3 seeds, val-tuned):
Personalized (node-weighted): ours 84.03±0.80 on Cora, FedAdamW 82.42±0.85, FedGTA 80.95±0.07, FED-PUB 79.30±1.59. Ours beats FedAvg, FedAdam, SCAFFOLD, FedTAD, FED-PUB, ties FedAdamW; tuned FedProx strongest. Compressed budget: 720.6 vs 720.5 KB/client/round, 0.4 KB server state.
Q2: How are hop blocks, the profile p_k, and the compression defined for a multi-layer GCN?
Re2: Two backbones. SIGN/GAMLP: the readout acts on [z⁰;…;zᴷ], so its columns split into K+1 blocks, p_k(h) being the hop-h energy share,
pₖ(h) = ‖AₖʰXₖ‖²_F / Σₕ′‖Aₖʰ′Xₖ‖²_F,
with no n_k. 2-layer GCN: with no hop-indexed readout, blocks follow receptive field — lin1 on 1-hop, lin2 on 2-hop inputs; {lin1.weight, lin1.bias}=block 0, {lin2.weight, lin2.bias}=block 1 (K=#layers−1), profile = shares of ‖X‖², ‖AX‖². A layer-equivalent, not W_{c,h}; v-side fidelity is 0.970–0.9998 on SIGN (exact blocks), ≈0.59 on GCN. The channel sends one scalar per hop slice (mean v) plus one per other tensor: (K+1)+#tensors — 12 for SIGN/Cora, 2+#tensors for GCN ("≈10 floats" = decoupled). Compression costs ~0.3 points on GCN (84.46±1.02→84.16±1.23), none on SIGN (83.67±0.15→84.16±1.23). Algorithm 1 (mix at round start) is implemented; Sec. 3.4 is aligned. Bandwidth: w_kj ∝ exp(−‖p_k−p_j‖²/2h²), h=σ_w (0.011 near-IID to 0.077 at α=0.1), λ=0.9, no tuning.
Q3: Which model is evaluated, and what are the splits, selection, and AGNews construction?
Re3: The global model is evaluated each round on the full graph with union masks; personalized methods additionally use node-weighted local test accuracy. Each subgraph splits 20/40/40 into train/val/test (per seed). Numbers are test accuracy at the validation-best round; baseline hyper-parameters (η_g∈{0.003,0.01,0.1}, µ∈{0.01,…,1.0}) are tuned on validation only; ours has none. AGNews graph (released code):
Two fixes: the current version broadcasts to all clients (the submitted one updated only active ones), anchors refresh for every known client (Corollary 2); ours stays at 84.5 on Cora at 50% and 25%. Scope: Cora/Citeseer (GCN), Cora/PubMed (SIGN).