- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Risk-Reversible Graph Transfer (R2GT) for federated node classification. R2GT augments semantic and structural knowledge sharing with a client-side controller that evaluates each updated candidate against a historical best-validation checkpoint, restores that checkpoint when degradation exceeds a tolerance, and temporarily disables transfer through a cooldown mechanism. The analysis establishes an empirical validation invariant and conditional population-utility bounds relative to the stored checkpoint. Evaluation covers eleven datasets, disjoint and overlapping client partitions, and five random seeds. Component ablations and paired rollback-versus-masking experiments provide evidence of predictive improvements and short-term recovery benefits. The central contribution is controlling which transfer-influenced states persist into subsequent training.
Critical strengths
- A concrete and potentially useful intervention on training-state persistence. R2GT distinguishes transfer admission, post-update acceptance, and checkpoint recovery (§3.2–3.4). Restoring a predictor can have effects that simply masking future transfer gradients cannot reproduce. This provides a clear operational contribution, with modest reported runtime overhead and one additional local checkpoint.
- Broad evaluation supplemented by paired intervention experiments. Tables 1, 2, 4, and 5 cover eleven datasets and multiple partition/client-count settings, with five-seed reporting. Beyond aggregate performance, the paper compares rollback and mask-only continuation from the same pre-decision state with shared subsequent randomness.
Critical weaknesses
- The reported recovery diagnostics are not yet clearly consistent with the stated algorithm. Algorithm 1 and §3.3 specify that validation violations trigger recovery even for local-only candidates during warm-up or cooldown. However, Figure 13 shows pre-decision violation fractions close to one over substantial portions of training for Cora O-30 and Minesweeper D-10, whereas Table 6 reports only 45 and 35 mean rollbacks, respectively. Table 6 also describes its denominator as eligible transfer decisions, although its counts equal all post-warm-up client-rounds under a 100-round budget and 20-round warm-up. These observations do not establish an implementation error: the figures may use different trajectories, configurations, or event subsets. However, those distinctions are not sufficiently specified.
- The evidence does not sufficiently distinguish graph-specific transfer recovery from generic validation-guided checkpoint recovery. The controller and theoretical bounds do not depend on graph structure, and the acceptance test also applies to purely local updates. Although the existing checkpoint-selection, mask-only, and random-rollback controls are useful, they do not fully isolate this distinction. Moreover, Figure 2 measures only immediate and next-round recovery, while its drift metric measures distance to the very state restored by rollback. Reduced drift therefore does not by itself establish better shared evidence or beneficial downstream feedback. The theoretical guarantees are also relative to the historical checkpoint, not to an independently trained local-only trajectory. Consequently, the broader interpretation as graph-specific negative-transfer control remains insufficiently supported.
Questions for authors
- What are the instantiated semantic and structural losses, client-clustering procedure, and server-bank update rule? Which components are unchanged from FedSSA, and what optimizer or cached state is retained when the default parameter-only rollback occurs?
- Is there evidence comparing local-only training with and without the identical recovery controller, using the same backbone and selection budget? Such a comparison would help determine how much of the gain is specific to cross-client transfer.
- Do Table 6 and Figure 13 use the same runs, margins, reference checkpoints, and recovery policy? Please distinguish total candidate checks, transfer-active checks, local-only rejections, and transfer-active rejections, and explain how the reported counts follow from Algorithm 1.
2 comments
Response to Reviewer yUTJ (2/2)
3. Reconciliation of Figure 13 and Table 6
Figure 13 and Table 6 summarize different trajectories and different quantities. Both use a 20-round warm-up and , but Figure 13 is a rollback-disabled logging audit, whereas Table 6 reports standard R2GT with recovery enabled. The original Table 6 description of its denominator as ``eligible transfer decisions'' was inaccurate: the 2,400/800 counts are all post-warm-up client-round candidate checks, including transfer-inactive cooldown rounds. We corrected the caption and surrounding text in blue.
| Item | Figure 13 audit | Table 6 standard R2GT |
|---|---|---|
| Recovery | Disabled | Enabled |
| Reference | Prefix best-validation state | Stored best-validation recoverable checkpoint |
| Quantity | Pre-decision validation-drawdown violations | Executed checkpoint restorations |
| Aggregation | Representative audit trajectory | Five-seed mean |
| Repeated events | Each client-round counted once | Each recovery counted once |
With recovery disabled, a degraded candidate remains in the audit trajectory, so raw drawdown can persist. In standard R2GT, restoration changes the retained state and all subsequent candidates. The two percentages therefore measure exposure under a no-recovery diagnostic and actions executed by the full method, respectively.
The standard-run event ledger is:
| Setting | Candidate checks / seed | Local-only rejects / seed | Transfer-active rejects / seed | Recoveries / seed | Recovery rate |
|---|---|---|---|---|---|
| Cora O-30 | 2,400 | 9.0 | 36.0 | 45.0 | 1.88% |
| Minesweeper D-10 | 800 | 7.0 | 28.0 | 35.0 | 4.38% |
Across both settings and five seeds, there are 16,000 candidate checks, including 1,600 transfer-active checks (1,280 accepted and 320 rejected). The 400 recoveries decompose into 320 transfer-active rejects and 80 local-only rejects. This accounting follows Algorithm 1: every post-warm-up candidate is checked, rejection triggers restoration regardless of transfer eligibility, and only retained-state statistics are uploaded.
Summary
The matched 2×2 experiment separates the transfer-specific contribution from generic checkpoint recovery, the recipient intervention establishes beneficial downstream feedback, and the corrected run ledger reconciles Figure 13 with Table 6 under the stated algorithm. The revised version also specifies the sharing pipeline, checkpoint state, upload ordering, and admissibility-summary role. All modifications are highlighted in blue. Thank you for the careful questions that led us to make these distinctions explicit. Because the two stated weaknesses are now addressed by direct controls and exact accounting, we respectfully ask you to reconsider the rating.
Response to Reviewer yUTJ (1/2)
Thank you for recognizing R2GT as a concrete intervention on training-state persistence, the breadth of the evaluation, and the value of the matched rollback-versus-mask experiment. Your review separates three decision-relevant issues: reproducibility of the sharing/recovery state, transfer-specific benefit beyond generic checkpointing, and consistency of the recovery diagnostics. We address them in that order.
1. Instantiated sharing pipeline and retained recovery state
R2GT preserves FedSSA's graph encoder and semantic/structural sharing pipeline. The instantiated operations are:
The default checkpoint stores the best-validation predictor parameters, with the best score and controller bookkeeping maintained separately. Parameter-only rollback restores the predictor while retaining the current optimizer moments. We directly test whether this stale optimizer state drives the result:
Full-state recovery changes final utility by +0.06 points (95% CI [-0.04, 0.16]) and next-round rescue by +0.04 points. Predictor restoration therefore captures the measured recovery benefit, while full-state restoration reaches the same conclusion with roughly three times the checkpoint storage.
State ordering is also explicit. The client first accepts the candidate or restores the checkpoint, then recomputes semantic/structural statistics from the retained predictor. A rejected candidate's statistics never enter the next bank. The admissibility summary records transfer eligibility, candidate acceptance, rollback, cooldown, and checkpoint-update events. It supports accounting and diagnostics but does not alter FedSSA's aggregation weights. A rolled-back client remains in aggregation with statistics recomputed from the restored state.
2. Transfer-specific benefit versus generic validation-guided checkpointing
We apply the identical controller with transfer on and off, holding the learner, masks, training budget, validation selection, and random streams fixed. The comparison covers 18 homophilic overlapping settings: six datasets by three client counts. We average five seeds within each setting and then take the setting-wise macro-average.
The controller contributes 0.16 points without transfer and 1.15 points with transfer. The paired interaction is 0.99 points (95% CI [0.74, 1.24]). The improvement is therefore concentrated on transfer-influenced states rather than explained by generic validation-guided checkpoint selection.
The source intervention provides the downstream test missing from a drift-only analysis. Across 320 rejected transfer-active events, matched downstream clients receive banks that differ only in the intervened source statistics. Transfer lowers their utility by 0.42 points after one round and 0.54 points after five rounds. Restoration reduces drift from the saved state and improves the subsequent utility of clients receiving the resulting shared evidence.