Beyond Client Averaging: A Client-Independent Second-Order Stationary-Bias Component in Stochastic SCAFFOLD
Not on the map. Why?
Abstract (arXiv)
Existing constant-step analysis of stochastic Scaf identifies a leading O(γ/N) stationary mean bias and shows that higher-order bias can persist as the client count increases, but does not identify the first client-independent contribution at coefficient level. For full-participation stochastic Scaf with one-dimensional homogeneous clients, fixed local-step count H, and bounded additive gradient noise, we prove, uniformly over N≥2, beginaligned mathbbE_πγ,N,H[x]-x^star =& -fracf'''(x^star)σ24f''(x^star)2fracγN &- fracf'''(x^star)σ212f''(x^star) frac(H-1)(5H-1)Hγ2 +OH!left(fracγ2N+γ3right). endaligned Hence client averaging suppresses the leading O(γ/N) bias but does not remove the client-independent O(γ2) component when its coefficient is nonzero. The mechanism is indirect: although the direct control contribution cancels pathwise in the linear global average, the controls still alter within-round local trajectories and their second moments. Fresh gradient noise and persistent control fluctuations therefore generate local second-moment corrections that nonquadratic curvature converts into stationary mean bias. The coefficient vanishes for quadratic objectives. Numerical experiments are consistent with the predicted coefficient, its persistence as client count increases, and the stated joint remainder. The result is restricted to the one-dimensional homogeneous fixed-H setting.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 17 references that are in the map. First posted on arXiv 27 Aug 2026.
Builds on
13 of 17 references.
References · 13
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2018Local SGD Converges Fast and Communicates Littlecited by 605
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2019Tighter Theory for Local SGD on Identical and Heterogeneous Datacited by 266
- 2020Is Local SGD Better than Minibatch SGD?cited by 151
- 2017Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chainscited by 88
- 2021Stationary Behavior of Constant Stepsize SGD Type Algorithms: An Asymptotic Characterizationcited by 13
- 2024Computing the Bias of Constant-step Stochastic Approximation with Markovian Noisecited by 9
- 2024The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsizecited by 6
- 2025Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysiscited by 4
- 2025Scaffold with Stochastic Gradients: New Analysis with Linear Speed-Upcited by 3
1 more
Built on by
Not cited yet.