Characterizing Client-Independent Stationary Bias for SCAFFOLD and FedAvg in Federated Learning
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 term and explicit client-independent coefficients, where is the step size and 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 and local-step count , a remainder of , uniform in 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
| Analysis | Characterization beyond the shared leading term |
|---|---|
| SCAFFOLD , Mangold et al. [8, Theorem 5.3] | |
| FedAvg , Mangold et al. [9, Theorem 3] | |
| FedAvg , Mangold et al. [9, Theorem 4] , with | |
| This work, Theorems 4.1 and 4.2 |
| Study | Grid | Target vector | Estimated intercept vector | |
|---|---|---|---|---|
| SCAFFOLD | 2 | P | ||
| SCAFFOLD | 4 | P | ||
| SCAFFOLD | 4 | S | ||
| FedAvg | 2 | P | ||
| FedAvg | 4 | P | ||
| FedAvg | 4 | S |
| Estimate | Target | Nominal interval | ||
|---|---|---|---|---|
| 2 | 1 | |||
| 2 | 2 | |||
| 4 | 1 | |||
| 4 | 2 | |||
| 8 | 1 | |||
| 8 | 2 |
| Noise law | Target | Estimate | Simultaneous interval | |
|---|---|---|---|---|
| Symmetric | ||||
| Symmetric | ||||
| Symmetric | ||||
| Asymmetric | ||||
| Symmetric minus asymmetric ( ) | ||||
| Setting | ||||
|---|---|---|---|---|
| Cosine | Projection ratio | Relative residual | ||||
|---|---|---|---|---|---|---|
| 2 | 32 | 8 | ||||
| 4 | 8 | 32 | ||||
| 4 | 32 | 8 | ||||
| 4 | 32 | 8 | ||||
| 4 | 32 | 8 | ||||
| 4 | 128 | 2 |
Appendix figures & tables17 assets
Supplementary material from the paper’s appendix.
Appendix
| Comparison | ; | Client counts and step sizes | Runs |
|---|---|---|---|
| Primary joint grid | ; | (77) | 8 |
| Smaller-step joint grid | ; | (78) | 8 |
| Fixed-step client count | ; | ; | 8 |
| Five-dimensional | ; | ; | 8 |
| Leading coefficient | ; | ; | 12 |
| Cartesian control coefficient | ; | ; | 12 |
| Study | Heuristic time scale | Burn-in | Batch length | Batches |
|---|---|---|---|---|
| Joint grid, fixed step, and | ; ( ), ( ) | 100 | ||
| Cartesian/local step | 64 | |||
| Contraction/noise law | 64 | |||
| Real-data training | 64 |
| Study | Interval construction | Coordinate levels / simultaneous family |
|---|---|---|
| Joint grid and fixed step, | Pointwise Student- (7 degrees of freedom); 2,000 seed-block bootstrap draws for intercepts | Coordinate level ; bootstrap quantiles |
| Five-dimensional | Pointwise Student- (7 degrees of freedom); 5,000 bootstrap draws | Coordinate level ; quantiles |
| Cartesian/local step | Student- (11 degrees of freedom); Bonferroni adjustment; 2,000 bootstrap draws for sensitivity | 16 leading coordinates; 6 control coordinates; 12 contrasts; 2 coordinates for |
| Contraction/noise law | 4,000 within-cell bootstrap draws; centered standardized maximum; marginal and Bonferroni- sensitivity | 36 scalars: 24 coefficient coordinates, 6 law contrasts, 6 covariance contrasts |
| Real-data allocation | Nominal jackknife- intervals; adjusted contrast intervals | 105 cellwise projections; separate 36 allocation/configuration contrasts |
| Model averaging | 19,999 paired-seed bootstrap draws; centered standardized maximum; delete-one-seed Bonferroni- sensitivity | Separate primary (196), secondary (392), and diagnostic (1,176) families |
| Law | Support | Probabilities | ||
|---|---|---|---|---|
| Symmetric | ||||
| Asymmetric |
| Study | Grid | Coordinate 1 interval | Coordinate 2 interval | |
|---|---|---|---|---|
| S | 2 | P | ||
| S | 4 | P | ||
| S | 4 | S | ||
| F | 2 | P | ||
| F | 4 | P | ||
| F | 4 | S |
| at | at | range | Log–log slope | |
|---|---|---|---|---|
| 1 | ||||
| 2 |
| 95% simultaneous CI | Intercept theory | |
|---|---|---|
| 1 | ||
| 2 |
| Theory | 95% simultaneous CI | |||
|---|---|---|---|---|
| 2 | 1 | |||
| 2 | 2 | |||
| 2 | 3 | |||
| 2 | 4 | |||
| 2 | 5 | |||
| 4 | 1 |
| Alg. | Estimate 1 | Interval 1 | Estimate 2 | Interval 2 | |
|---|---|---|---|---|---|
| 1 | S | ||||
| 1 | F | ||||
| 2 | S | ||||
| 2 | F | ||||
| 4 | S | ||||
| 4 | F |
| Condition / contrast | Alg. | Estimate 1 | Interval 1 | Estimate 2 | Interval 2 |
| , sym. | S | ||||
| , sym. | F | ||||
| , sym. | S | ||||
| , sym. | F | ||||
| , sym. | S | ||||
| , sym. | F |
| Quantity | Target | Estimate | Simultaneous interval |
|---|---|---|---|
| SCAFFOLD coefficient | |||
| FedAvg coefficient | |||
| SCAFFOLD covariance contrast |
| 2 | 16 | 2 | ||||
|---|---|---|---|---|---|---|
| 2 | 48 | 1 | ||||
| 4 | 16 | 2 | ||||
| 4 | 48 | 1 |
| Check | Configuration |
|---|---|
| Orthogonal rotation | ( ); ; ; 4 paired runs per configuration, 16 paths in total |
| Affine translation | ; ; , ; ; 24 configurations of 2,000 rounds |
| Component | Specification |
|---|---|
| Training data | 32,512 of 32,561 rows selected by a fixed random permutation to allow equal disjoint partitions |
| Features and penalty | Each 123-feature row divided by , then augmented with an intercept; ; all 124 parameters regularized with |
| Client objectives | Shared: all clients use the same data; disjoint IID: random partition; label skew: two label-sorted shards per client. Disjoint regimes use one primary and two alternative partitions |
| Minibatches and base step | Sampling with replacement; ; |
| Fixed-budget allocations | ; ; , |
| Additional shared-objective runs | Three step-size/local-step variants (Table 5 ) and three checks; nine shared-objective configurations in total |
| Shared objective: additional error and loss measurements | ||||
|---|---|---|---|---|
| MSE (S) | MSE (F) | Test loss (S) | Test loss (F) | |
| 8 | ||||
| 32 | ||||
| 128 | ||||
| Quantity | SCAFFOLD | FedAvg |
|---|---|---|
| Train objective gap | ||
| Held-out log loss | ||
| Paired difference | Estimate [simultaneous interval] | |
Stochastic Optimization
Stochastic optimization studies how to find good decisions or model parameters when objectives, data, or feedback are random or noisy.
See all 212 papers