cs.LGAug 27, 2026

Characterizing Client-Independent Stationary Bias for SCAFFOLD and FedAvg in Federated Learning

Authors: Yi-Ping Tang, Guan-Ju Peng

Organizations: Both authors are with the Graduate Institute of Data Science and Information Computing, National Chung Hsing University, Taichung, Taiwan.

Abstract

Even when all clients optimize the same strongly convex objective, the global model parameters produced by constant-step federated learning may still have a stationary mean that differs from the minimizer. Does increasing the number of clients eliminate this bias, or can some components persist? Answering this question clarifies the limits of client averaging. To this end, we study two federated learning algorithms, \Scaf{} and matched \FedAvg{}, under full participation, a sufficiently smooth objective, and independent bounded additive gradient noise. Analyzing global stationary balance and within-round local fluctuations yields multidimensional expansions with a shared γ/Nγ/N term and explicit client-independent γ2γ^2 coefficients, where γγ is the step size and NN is the client count. The \Scaf{} coefficient combines the ordinary local-update contribution found in \FedAvg{} with an additional persistent-control contribution. Although zero-sum controls cancel from the direct server increment, they change local second moments, which interact with third-order curvature to shift the stationary mean. For fixed dimension dd and local-step count HH, a remainder of OH,d(γ2/N+γ3)O_{H,d}(γ^2/N+γ^3), uniform in NN for sufficiently small γγ, identifies the second-order coefficients along arbitrary joint small-step, large-client limits after removing the shared leading term. Controlled experiments assess the predicted coefficients. In real-data analyses, finite-tail mean displacement can account for a substantial share of averaged-model parameter error, and a post-hoc comparison shows directional agreement with the derived curvature--noise structure.

Figures & tables

Appendix figures & tables17 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. SCAFFOLD under Hessian Similarity: Sharp Convergence Rates

    Oct 26, 2026Zhirayr Tovmasyan, Slavomír Hanzely, Egor Shulgin +2Federated LearningHeterogeneous Federated Learning

  2. Steady-State Convergence of Stochastic Approximation

    Sep 14, 2026Yixuan Zhang, Qiaomin XieStochastic ApproximationQ-Learning

  3. Stationary Bias and Extrapolation in Nonlinear Two-Timescale Stochastic Approximation

    Oct 7, 2026A. Ch. Madhusudanarao, Rahul SinghRichardson ExtrapolationStochastic Approximation