Papers › SCAFFOLD: Stochastic Controlled Averaging for Federated Learning

SCAFFOLD: Stochastic Controlled Averaging for Federated Learning

14 Oct 2019ICML 2020 1arXiv:1910.06378archive 2025-07-28

Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi, Sebastian U. Stich, Ananda Theertha Suresh

Federated Averaging (FedAvg) has emerged as the algorithm of choice for federated learning due to its simplicity and low communication cost. However, in spite of recent research efforts, its performance is not fully understood. We obtain tight convergence rates for FedAvg and prove that it suffers from `client-drift' when the data is heterogeneous (non-iid), resulting in unstable and slow convergence. As a solution, we propose a new algorithm (SCAFFOLD) which uses control variates (variance reduction) to correct for the `client-drift' in its local updates. We prove that SCAFFOLD requires significantly fewer communication rounds and is not affected by data heterogeneity or client sampling. Further, we show that (for quadratics) SCAFFOLD can take advantage of similarity in the client's data yielding even faster convergence. The latter is the first result to quantify the usefulness of local-steps in distributed optimization.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 4 code samples harvested from 2 repositories linked to this paper: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: community (archive-listed): 4 samples from 2 repositories, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 4 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

KarhouTam/FL-bench mentioned on GitHubpytorchGPL-3.0Syntology: not harvested report
KarhouTam/SCAFFOLD-PyTorch mentioned on GitHubpytorchMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
carbonati/fl-zoo mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Communication-Efficient Learning of Deep Networks from Decentralized Data (arXiv:1602.05629; that paper's own run record: 47 ran (of which 17 constructed an object rather than computing a result; 27 with no instrument failure: 2 honoured, 0 violated, 25 with no contract checked; 20 where Syntology's instrument failed) · 30 unverified); nothing checks that they implement this paper's method. report
google-research/public-data-in-dpfl mentioned on GitHubtfApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning (arXiv:2008.03606; that paper's own run record: 5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
ramshi236/Accelerated-Federated-Learning-Over-MAC-in-Heterogeneous-Networks mentioned on GitHubpytorchGPL-3.0Syntology: not harvested report
thejungwon/gc-fed mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Communication-Efficient Learning of Deep Networks from Decentralized Data (arXiv:1602.05629; that paper's own run record: 47 ran (of which 17 constructed an object rather than computing a result; 27 with no instrument failure: 2 honoured, 0 violated, 25 with no contract checked; 20 where Syntology's instrument failed) · 30 unverified), Preservation of the Global Knowledge by Not-True Distillation in Federated Learning (arXiv:2106.03097; that paper's own run record: 4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified), Federated Learning Based on Dynamic Regularization (arXiv:2111.04263; that paper's own run record: 6 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified) and 1 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
TsingZ0/PFL-Non-IID pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Communication-Efficient Learning of Deep Networks from Decentralized Data (arXiv:1602.05629; that paper's own run record: 47 ran (of which 17 constructed an object rather than computing a result; 27 with no instrument failure: 2 honoured, 0 violated, 25 with no contract checked; 20 where Syntology's instrument failed) · 30 unverified), Think Locally, Act Globally: Federated Learning with Local and Global Representations (arXiv:2001.01523; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified), Ditto: Fair and Robust Federated Learning Through Personalization (arXiv:2012.04221; that paper's own run record: 15 ran (of which 5 constructed an object rather than computing a result; 12 with no instrument failure: 7 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified) and 8 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
ki-ljl/Scaffold-Federated-Learning pytorchMITSyntology: 3 samples, 2 ran (0 instrument-failed) · 1 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

4 samples harvested: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

3ran
1unverified

Licence: 0 of the 4 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

KarhouTam/SCAFFOLD-PyTorch community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
clone_parameters in 5 papers src/config/util.py ran MIT (permissive) · 3643bd05b1da6428 · report fixture: signature src:dict/0/? · returned OrderedDict · level recorded 2026-09-24
ki-ljl/Scaffold-Federated-Learning community (archive-listed) 3 samples, 2 ran (0 instrument-failed) · 1 unverified
get_mape get_data.py ran fingerprinted MIT (permissive) · bd47eaab015e63fe · report fixture: signature x:ndarray/1/float, y:ndarray/1/float · returned float64 · level recorded 2026-09-24
nn_seq_wind get_data.py ran MIT (permissive) · 64f7bd048cc61b61 · report fixture: signature file_name:str/0/str, B:int/0/int · returned tuple · level recorded 2026-09-24
load_data in 700 papers get_data.py unverified MIT (permissive) · 4a50bd68763f2dc6 · report

Tasks

Distributed OptimizationFederated Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections