- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates distributed learning under autonomous client participation, challenging the conventional assumption that client participation is primarily controlled by a central server. Motivated by practical scenarios where clients independently decide whether to participate based on their self-interest, resource constraints, and historical information, the authors propose a Markovian framework to characterize dynamic and temporally correlated participation behaviors. Under homogeneous data distributions, the paper derives convergence bounds that characterize the effects of participation probability, effective sample size, and Markov chain mixing time on learning performance. The authors further analyze different participation mechanisms and identify a critical autonomy threshold associated with training instability. Based on these theoretical findings, a budget-constrained server policy optimization method is proposed to incentivize client participation and improve learning stability. The framework is subsequently extended to heterogeneous data settings, where autonomous participation may introduce distributional bias and feedback effects that influence global model convergence. Finally, numerical simulations are conducted to examine the theoretical predictions, participation dynamics, and effectiveness of the proposed budget allocation strategy.
Critical strengths
1. Meaningful Problem Motivation and Research Perspective. The paper investigates a practically relevant problem by relaxing the conventional assumption that client participation in distributed learning is primarily controlled by a central server. In real-world distributed environments, clients may independently decide whether to participate based on their individual interests, resource constraints, and historical experiences. Considering such autonomous behavior introduces additional challenges beyond conventional client selection, particularly regarding temporally correlated participation and its interaction with global model training. This perspective is valuable because it highlights an important aspect of distributed learning dynamics that deserves further theoretical investigation.
2. Systematic Theoretical Analysis of Autonomous Participation. The paper demonstrates substantial theoretical effort in analyzing the influence of dynamic client participation on learning convergence. In particular, Theorem 2 (Sec. 3.4) connects participation probability, effective sample size, and Markov chain mixing time with convergence performance, offering a structured perspective on how different aspects of participation dynamics affect distributed optimization. The subsequent analysis of different participation mechanisms and critical autonomy thresholds further extends this theoretical investigation. These results provide useful insights into the relationship between client participation behavior and learning stability, while also motivating the server-side budget allocation framework.
Critical weaknesses
1. Limited Generality and Insufficient Justification of the Theoretical Framework.
Although the paper investigates a meaningful and practically relevant problem, the proposed theoretical framework relies on several restrictive assumptions, and the scope of its main theoretical guarantees remains insufficiently aligned with the motivating scenarios. My primary concerns are as follows:
-
Insufficient justification of autonomous participation behaviors. The proposed participation mechanisms rely on specifically designed behavioral assumptions whose connections to realistic client decisions remain unclear. For instance, Eq. (10) assumes that a client's participation probability increases with the number of previously participating clients, following a predefined logistic function. Although the authors provide intuitive explanations based on privacy and resource considerations, it remains unclear whether this model captures representative participation behaviors in practical distributed systems or whether the theoretical conclusions remain valid under alternative participation mechanisms.
-
Overemphasis on homogeneous data and limited heterogeneous analysis. The central theoretical contributions in Sec. 3, including the convergence bounds, Markovian mixing analysis, and critical autonomy threshold, are predominantly established under homogeneous data distributions. However, the motivating problem involves clients with different interests, local conditions, and potentially heterogeneous data, making the interaction between autonomy and heterogeneity particularly important. The extension in Sec. 5 and Appendix D considers only a simplified two-group setting, without sufficiently examining more general client-specific distributions or different forms of data heterogeneity commonly encountered in federated learning.
-
Insufficient justification of the critical autonomy threshold. The theoretical interpretation of the critical autonomy threshold requires further clarification. In particular, Proposition 3 establishes the threshold through a mean-field stability condition, but this does not directly demonstrate that the underlying finite-state Markov chain fails to mix. A more rigorous connection between mean-field instability, Markov chain mixing behavior, and learning convergence is needed to substantiate this central claim.
2. Insufficient Empirical Validation and Limited Practical Significance.
The experimental evaluation remains a major limitation, particularly given the paper's emphasis on practical autonomous participation in distributed learning. Although the numerical results illustrate several theoretical predictions, the current evidence is insufficient to establish their broader applicability or practical effectiveness. Several issues are particularly important:
-
Limited experimental scope and external validity. The evaluations in Figures 1–2 and Appendix E primarily rely on numerical simulations constructed around the proposed participation mechanisms and theoretical assumptions. While these results help illustrate the predicted convergence behaviors, they largely examine the internal consistency of the mathematical framework rather than independently validating its applicability to realistic distributed learning environments. The experiments lack representative real-world datasets, practical federated training tasks, and evaluations across diverse forms and degrees of non-IID data. Consequently, it remains unclear whether the reported critical threshold, participation-induced bias, and convergence characteristics generalize beyond the specifically constructed settings.
-
Insufficient comparisons and experimental reproducibility. The paper does not provide systematic comparisons with representative existing client selection or incentive-based approaches, making it difficult to assess the relative benefits of the proposed framework. Furthermore, important experimental details, including the precise learning configurations, participation mechanisms, and statistical variability of the reported results, are not sufficiently consolidated or discussed. These omissions limit the reproducibility of the experiments and make it difficult to evaluate the robustness of the observed phenomena.
-
Limited methodological depth and practical validation of server optimization. The server-side budget optimization in Sec. 4 is developed under a predefined incentive-response function and ultimately reduces to a one-dimensional search over the number of incentivized clients. Although this provides a reasonable application of the theoretical framework, its algorithmic contribution appears relatively limited. More importantly, the paper does not sufficiently demonstrate whether this strategy offers meaningful advantages over alternative budget allocation or client selection approaches in practical distributed training.
Questions for authors
-
How does the approximation in Appendix B.9.1 justify the claimed failure of Markov chain mixing at the critical autonomy threshold? Under what conditions is this approximation valid for the finite-state Markov chain?
-
In Appendix B.5, the proof of Theorem 2 assumes that the expected suboptimality at intermediate rounds is bounded by its initial value. How is this inequality guaranteed under Assumptions 1–3, particularly with stochastic gradient noise?
-
Although Appendix B.7–B.8 analyzes additional participation mechanisms, how well do the main theoretical findings generalize beyond these predefined rules? Can the authors provide supporting analysis or experiments using alternative, practically motivated participation policies?
-
In Sec. 5 and Appendix D, the heterogeneous analysis focuses on the target objective rather than the original global objective . Does the claimed participation-induced debiasing also improve convergence toward the original global optimum? Evidence under more general non-IID settings would help clarify this issue.
-
Can the authors provide additional FL experiments on standard datasets (e.g., CIFAR-10/100) with practical models and varying degrees of non-IID data? Please examine whether the critical threshold and participation-induced bias affect actual test accuracy and convergence, and compare the proposed budget optimization with representative baselines under identical budgets. Reporting participation rates and variability across multiple runs would further strengthen the evidence.
3 comments
- In Sec. 5 and Appendix D, the heterogeneous analysis focuses on the target objective rather than the original global objective . Does the claimed participation-induced debiasing also improve convergence toward the original global optimum? Evidence under more general non-IID settings would help clarify this issue.
Improving convergence toward the original unweighted global objective was not the goal of Section 5. On the contrary, our goal in Section 5 is to prove that under heterogeneous data, autonomous participation moves the model away from the global average and causes specialization toward a single group's distribution.
To formalize this specialization mathematically, we designate one of the two groups (, determined by population majority and model initialization ) as the reference ``target objective'' and measure the model's distance to . Under static participation (), the model converges to the compromised global objective , leaving a high steady-state error with respect to proportional to . Under autonomous participation (), clients in experience larger local gradient norms as the model moves toward and consequently drop out. This feedback loop drives , eliminating the cross-group interference relative to so the server specializes exclusively in (Figure 2 and Figure 8). We will clarify the phrasing in Section 5 so it is clear that is used as the analytical reference to measure specialization rather than a debiasing of the global objective .
- Can the authors provide additional FL experiments on standard datasets (e.g., CIFAR-10/100) with practical models and varying degrees of non-IID data? Please examine whether the critical threshold and participation-induced bias affect actual test accuracy and convergence, and compare the proposed budget optimization with representative baselines under identical budgets. Reporting participation rates and variability across multiple runs would further strengthen the evidence.
We have added a new set of experiments on CIFAR-10 using a CNN across clients (reporting mean std across 5 random seeds) in Appendix E.4.
Impact of on Test Accuracy (Case 1): Consistent with Proposition 3, when client autonomy is below the critical threshold (), active participation stays high (, Mean ), yielding stable convergence and a test accuracy of . Once crosses the threshold (), the autonomous clients drop out. The active cohort collapses to the uniform baseline (Mean ), starving the effective sample size . As predicted by Theorem 2, this inflates gradient variance, dropping accuracy to and exploding run-to-run variability to .
Participation-Induced Specialization (Non-IID): Under heterogeneous splits (60/40 majority/minority label skew), static participation () traps the model at a compromised global average (), yielding a high target-error floor (Target Acc: ). However, autonomous gradient-norm dropout () triggers the predicted feedback loop, driving the target participation ratio . By purging conflicting gradients, this specialization eliminates the cross-group bias relative to , boosting Target accuracy to .
Server Budget Optimization Baselines (Sec. 4): Note that Algorithm 1 optimizes the Markov chain metrics which depend only on the client population dynamics, independent of the dataset. Comparing Algorithm 1 () against equal-budget baselines in Figure 6, Uniform Full-Spread () and Concentrated Top- (), demonstrates that Algorithm 1 strictly minimizes steady-state error by balancing sample starvation against mixing delays.
Thank you for the detailed rebuttal and additional experiments. I have read the revised manuscript and appreciate the authors' efforts. Some of my concerns have been partially addressed, particularly through the theoretical clarifications and new CIFAR-10 results. However, I still share the concerns about experimental validation raised by other reviewers. More evaluations using established FL benchmarks and stronger baselines are needed to show how well the findings work in practice, especially the proposed budget optimization. I also value the extensive theoretical analysis, but it mainly focuses on homogeneous data, while real-world FL often involves much more complex non-IID settings. The heterogeneous analysis remains limited to a simplified two-group model, making it hard to judge how well the conclusions generalize. After considering the rebuttal and revisions, I feel these two main concerns remain unresolved, so I will maintain my original rating.
We thank the reviewer for their constructive feedback and for recognizing the meaningful motivation and systematic theoretical analysis of our work. To address your concerns regarding empirical validation, we have expanded our experiments and clarified the theoretical connections.
Below are the detailed answers to your specific questions:
This relationship follows from Kurtz's density-dependent Markov process limit theorems and the Linear Noise Approximation (Ethier & Kurtz, 1986, Chapter 11): Under the following conditions this approximation is valid: (i) Nc is sufficiently large, (ii) the chain is initialized within the basin of attraction of a hyperbolic fixed point n∗ (∣μ′(n∗)∣<1), and (iii) n∗ is bounded away from the boundary n=0, a first-order Taylor expansion yields the linear autoregressive (discrete Ornstein-Uhlenbeck) process δYr+1≈μ′(n∗)δYr+ξr.
For a linear AR(1) Markov chain, the second largest eigenvalue of the Markov transition operator is exactly its drift contraction rate, λ2=μ′(n∗).
As shown in our finite-size scaling analysis (Figure 5), the finite-state Markov chain converges rapidly to this continuous limit as Nd increases (Nd≥50).
We thank the reviewer for catching this technical detail in Appendix B.5 (Line 825). Because of stochastic gradient variance σ2>0, $ \mathbb{E}[F(\theta^{(r)}) - F(\theta^*)]$ is not strictly monotonic at every intermediate round. However, the exact same $ \mathcal{O}\left(\frac{1}{\eta \rho_\pi T} + \frac{\eta \sigma^2}{\rho_\pi m_{\text{eff},\pi}} + \frac{\tau_{\text{mix}}}{T}\right)$ convergence bound holds under the following assumption, which we included in the revised Appendix B.5.
Under the standard bounded-iterate assumption already stated in Theorem 5 (E∥θ(r)−θ∗∥2≤D2, enforceable via projection onto a ball of radius D), L-smoothness immediately guarantees E[F(θ(r))−F(θ∗)]≤2LE∥θ(r)−θ∗∥2≤2LD2 for all r≥0, which directly substitutes into Line 825.
Our core theoretical results (Lemma 1, Theorem 1, and Theorem 2) are completely agnostic to the specific functional form of the participation rule ϕc. Theorem 2 applies to any state-dependent participation mechanism as long as the induced Markov chain over Ω=2[Nc] is irreducible and aperiodic (which holds whenever pi(S)∈(0,1)), characterizing convergence purely through the macroscopic quantities (ρπ,meff,π,τmix).
Across the paper, we already analyze and evaluate four distinct, practically motivated participation mechanisms:
Case 1, Sec.3.5 & Case 2, App.B.7: Clients participate when the active ∣S∣ is large to ensure gradient dilution/privacy.
Case 3, App.B.8: Clients follow individual two-state Markov chains with entry/exit rates (ϵ(b),δ(b)) modeling local resource fatigue and recovery.
Sec.4, Eq.~17: Clients respond to server rewards w via diminishing marginal returns pu(w)=1+ww.
Sec.5 & App.E.3, Eq.69: Clients evaluate model alignment and drop out when their local gradient norm exceeds the active population average.