- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper develops a hierarchical distributional-stability analysis to understand the generalization on the general DP-FL framework. It constructs two terms to learn both sample- and client-replacement stability, leading to the final global generalization bound. The assumptions and theorems are aligned with the previous studies. Several experiments are conducted to validate the trends of the analysis in this paper.
Critical strengths
-
The paper addresses the relatively underexplored problem of generalization in client-level DP-FL. Its formulation provides a useful finding between within-client and unseen-client generalization.
-
The KL-based analysis is a useful contribution. Although the derivation is relatively straightforward, replacing the accumulation of learning rates with that of their squares yields an improved dependence on the training horizon.
Critical weaknesses
-
The analysis relies on globally bounded losses and potentially loose relaxations, without characterizing the tightness of the resulting bounds. These limitations weaken its practical relevance, particularly because the experiments use cross-entropy loss, which does not satisfy the global boundedness assumption.
-
The compatibility between horizon-independent generalization and optimization is insufficiently discussed. Corollary 1 considers decaying learning rates, whereas Corollary 3 assumes a constant learning rate. Moreover, the horizon-independent result relies on a fixed per-round noise scale. The paper should clarify which learning-rate and noise schedules provide meaningful simultaneous optimization and generalization guarantees.
-
The practical informativeness of the bounds remains unclear. The outer truncation in Eq. (5) may reduce the guarantee to the trivial bounded-loss bound. Without representative numerical evaluations, it is difficult to assess whether the theoretical dependencies provide informative guarantees under the experimental settings.
Questions for authors
-
What is the precise role of assuming that client distributions are independently sampled from a common meta-distribution Π? Please distinguish the results that rely on this assumption from those that remain valid for fixed, heterogeneous client distributions. Usually we only assume . An overall distribution may be more strong assumption here.
-
In Eqs. (10) and (11), the noise contribution suppresses an inverse dependence on the learning rate η that appears explicitly in the appendix. Could the authors retain this dependence and explain how the optimization–generalization trade-off changes with the choice of learning rate?
-
Can the bounded-loss assumption be relaxed, for example under suitable moment or tail conditions? Alternatively, please clarify how the current guarantees relate to the cross-entropy experiments.
-
Under what parameter regimes do the bounds improve upon the trivial bounded-loss guarantee? Please provide representative values or justified estimates of the theoretical constants and evaluate whether these regimes cover the experimental settings.