SCAFFOLD convergence — Explicit finite-round forms supporting Theorem III
ProvedSCAFFOLD.FiniteRoundConvergenceThe goal is the conjunction of the following two uniformly quantified finite-round guarantees.
Let and . Set , for , and . Then and
The case has uniform weights and ; gives geometric weights. No division by is used, and zero noise or zero initial distance is allowed.
For the full-client -sample warm start, put and suppose . Then
This includes , , , and under the specified initialization.
Formalization note: this is an explicit, paper-derived formulation of the finite-round convergence guarantees underlying Theorem III, not a literal formalization of its big- notation or a claim about last iterates. Rate optimization and initialization communication accounting are further corollaries, not extra hypotheses. The two branches use their stated, different initializations. The source audit documents the appendix sign, drift-index, control-expectation, and asymptotic-summary issues; none of those ambiguous expressions is used as a model assumption.
Source: Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi, Sebastian U. Stich, and Ananda Theertha Suresh, SCAFFOLD: Stochastic Controlled Averaging for Federated Learning, ICML 2020; arXiv:1910.06378v4, https://arxiv.org/abs/1910.06378v4; Section 5, PDF p. 5, Theorem III; Appendix E, PDF p. 25, Theorem VII; Appendix E.1, PDF p. 30, Lemma 15 and PDF p. 31 averaging display; Appendix E.2, PDF p. 34, Lemma 19 and PDF p. 35 final paragraph.
Notation and probability model
There are clients, a model space (including ), differentiable client losses with -Lipschitz gradients, , and . The starting point is deterministic and bounds within-client stochastic-gradient standard deviation. A run has rounds, local steps, clients per round, local step , global step , and . All random variables live on a standard Borel probability space with a filtration containing the full history. States and gradient samples are square integrable; gradient samples are conditionally unbiased, have conditional squared error at most , and are independent across clients conditional on each step's history. These are explicit fresh-oracle and finite-moment conventions.
Every round first defines virtual paths for all clients, starting at :
Then an -element subset is sampled uniformly, conditionally independently of these paths given the past. Equivalently, its conditional distribution given the entire completed virtual-path history is uniform. Only selected clients update their controls to ; other controls persist. The server update is . This is option II of Algorithm 1, with the average-gradient form of Appendix E. The model contains the algorithm and oracle laws, not any convergence inequality.
For convex targets, minimizes , and the client losses obey
The initial client controls are arbitrary deterministic vectors and the server control is their average. Define
For nonconvex targets, for all ; a minimizer need not exist. Each is instead initialized by averaging fresh stochastic gradients at , with the same conditional oracle assumptions. These full-client initialization queries are additional to the optimization rounds.
The output is a sampled pre-round server iterate among , represented by its expected loss or squared-gradient statistic. No last-iterate or pathwise guarantee is asserted. Sources: Section 2, PDF p. 2; Algorithm 1, PDF p. 4; Appendix B.1, PDF p. 14, assumptions A3–A5; Appendix E, PDF pp. 25–26, equations (18)–(22), Remark 10; Appendix E.2, PDF pp. 31 and 35, equations (26)–(27) and final warm-start paragraph. Primary reference: Karimireddy et al., SCAFFOLD: Stochastic Controlled Averaging for Federated Learning, ICML 2020, https://arxiv.org/abs/1910.06378v4.
import Definitions.Def_SCAFFOLD_Model open MeasureTheory universe u
namespace SCAFFOLD
theorem FiniteRoundConvergence :
(
∀ (d N : ℕ) (P : Problem d N) (Ω : Type u) [MeasurableSpace Ω]
[StandardBorelSpace Ω] (ν : Measure Ω) [IsProbabilityMeasure ν]
(S K T : ℕ) (ηl ηg μ : ℝ) (c0 : Fin N → Space d) (xstar : Space d),
Convexity P μ → IsMinimizer P xstar → 0 < ηl → 1 ≤ ηg →
effectiveStep K ηl ηg ≤ 1 / (81 * P.β) →
μ * effectiveStep K ηl ηg ≤ (S : ℝ) / (15 * (N : ℝ)) →
∀ A : Run P ν S K T ηl ηg (some c0),
weightedGap A xstar μ ≤ convexRHS P S K T ηl ηg μ c0 xstar
) ∧ (
∀ (d N : ℕ) (P : Problem d N) (Ω : Type u) [MeasurableSpace Ω]
[StandardBorelSpace Ω] (ν : Measure Ω) [IsProbabilityMeasure ν]
(S K T : ℕ) (ηl ηg fLower : ℝ),
(∀ x, fLower ≤ objective P.f x) → 0 < ηl → 1 ≤ ηg →
effectiveStep K ηl ηg ≤
Real.rpow ((S : ℝ) / (N : ℝ)) (2 / 3 : ℝ) / (24 * P.β) →
∀ A : Run P ν S K T ηl ηg none,
averageGradientSq A ≤ nonconvexRHS P S K T ηl ηg fLower
) := by sorry
end SCAFFOLDRead-back
What the Lean code literally says, in plain math · gpt-6
Read-back model: gpt-6.
The declaration asserts a conjunction of two independently universally quantified bounds, with the following common data and run requirements. For an arbitrary universe level, each bound quantifies over natural numbers , a problem , a type in that universe equipped with a measurable space that is a standard Borel space, a probability measure on , natural numbers , and real numbers . Write and , with its Euclidean norm and real inner product. The problem consists of functions for , real numbers , and , subject to , , , existence of the gradient at every , and
Define the real-valued objective, round times, and effective step by
Natural numbers occurring in real formulas are interpreted as real numbers.
A run at these parameters requires , , and . It supplies a filtration of sub--algebras of the specified measurable space on ; random vectors
and maps for all . All almost-sure statements below are with respect to , and denotes conditional expectation. The warm-up vectors satisfy, for every and , strong measurability of with respect to , membership , and
For each , the whole family is conditionally independent given . For every , and each are strongly measurable with respect to and belong to . For every , , and , is strongly measurable with respect to and belongs to . For every , , and , is strongly measurable with respect to , belongs to , and satisfies
Here a function applied to a random vector is evaluated pointwise on . For each and , the whole family is conditionally independent given .
For each , the sampled set has almost surely. For every finite subset , the real-valued indicator is strongly measurable with respect to , and
The run has almost surely. Its initial controls are specified separately in the two bounds below. For every and , it has almost surely. For every , , and , its local update is
For every and , its control update is
For every , its server update is
These requirements impose the local dynamics and gradient assumptions on every client , including clients outside . Each displayed almost-sure identity or inequality is required separately for the indicated indices. All of the warm-up requirements are part of a run in both bounds, including when its controls are initialized deterministically.
The first universally quantified bound additionally quantifies over a real number , an arbitrary deterministic function , and . It assumes and, for every and every ,
It also assumes
For every run satisfying all the common requirements and the deterministic control initialization almost surely for every , let
The asserted bound is
The left side is the weighted sum of the expected objective gaps at , divided by the sum of those weights.
The second universally quantified bound independently quantifies over all the common data and a real number . It assumes
where is the real power with exponent . For every run satisfying all the common requirements and the warm-up control initialization
the asserted bound is
Here is the Euclidean gradient of the explicitly defined average . This conjunct has no convexity or minimizer hypothesis. The conjunction asserts both universal implications; it does not require the data or the run in one conjunct to coincide with those in the other.
The quantifiers allow , when is the zero-dimensional Euclidean space with one point, and allow . They include , , , , and full participation whenever the other hypotheses hold. For the first bound, is allowed and gives and . Although are quantified as arbitrary natural numbers, admits no problem , and , , , or admits no run of the required kind. The universal assertion over runs is vacuous whenever no such run exists; neither conjunct asserts existence of a run. The first conjunct assumes the supplied is a minimizer, and the second assumes the supplied real is a global lower bound, without asserting existence of either. In an actual run meeting either conjunct's step assumptions, are all positive. In the first conjunct, , hence and . Thus the displayed denominators are nonzero in all instances with an admissible run. The run's arrays are defined for all natural time indices, but measurability, moment, independence, and update conditions apply only over the index ranges explicitly stated above; the bounds use , while the run also constrains and . Conditional independence is imposed for each indicated family across clients at a fixed warm-up step or local step; it does not itself assert independence across different steps. All integrals are the measure-theoretic integrals from the declaration, with their total-function convention of value zero for a nonintegrable integrand; no separate integrability hypothesis for the two displayed objective-gap or squared-gradient integrands is included in the theorem statement.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.