Papers › Federated Learning Based on Dynamic Regularization

Federated Learning Based on Dynamic Regularization

8 Nov 2021ICLR 2021 1arXiv:2111.04263archive 2025-07-28

Durmus Alp Emre Acar, Yue Zhao, Ramon Matas Navarro, Matthew Mattina, Paul N. Whatmough, Venkatesh Saligrama

We propose a novel federated learning method for distributively training neural network models, where the server orchestrates cooperation between a subset of randomly chosen devices in each round. We view Federated Learning problem primarily from a communication perspective and allow more device level computations to save transmission costs. We point out a fundamental dilemma, in that the minima of the local-device level empirical loss are inconsistent with those of the global empirical loss. Different from recent prior works, that either attempt inexact minimization or utilize devices for parallelizing gradient computation, we propose a dynamic regularizer for each device at each round, so that in the limit the global and device solutions are aligned. We demonstrate both through empirical results on real and synthetic data as well as analytical results that our scheme leads to efficient training, in both convex and non-convex settings, while being fully agnostic to device heterogeneity and robust to large number of devices, partial participation and unbalanced data.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

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.

Syntology holds a reference implementation of Federated Learning based on Dynamic Regularization, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Federated Learning based on Dynamic Regularization') (how to connect); the free check have('2111.04263') needs no token.

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

Code

Syntology 15 code samples harvested from 4 repositories linked to this paper: 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. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 1 sample from 1 repository, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 14 samples from 3 repositories, 6 ran (5 with no instrument failure; 1 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.

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

alpemreacar/FedDyn officialmentioned in paperpytorchSyntology: 1 sample, 0 ran · 1 unverified report
KarhouTam/FL-bench mentioned on GitHubpytorchGPL-3.0Syntology: not harvested report
NAVER-INTEL-Co-Lab/gaudi-byzantine mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report
thejungwon/gc-fed mentioned on GitHubpytorchSyntology: 9 samples, 4 ran (0 instrument-failed) · 5 unverified report
TsingZ0/PFL-Non-IID pytorchSyntology: 4 samples, 1 ran (0 instrument-failed) · 3 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.

Code Syntology ran Syntology

15 samples harvested: 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. “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.

1ran · honoured contract
1ran · our draft was wrong
4ran
9unverified

Licence: 9 of the 15 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 4 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”. For 1 sample that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “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.

alpemreacar/FedDyn official repository 1 sample, 0 ran · 1 unverified
train_FedDyn utils_methods.py unverified MIT (permissive) · d8e5236ae622abdc · report
NAVER-INTEL-Co-Lab/gaudi-byzantine community (archive-listed) 1 sample, 1 ran (1 instrument-failed) · 0 unverified
server_dyn src/aggregation.py ran · our draft was wrong MIT (permissive) · a0b65033d450bccb · report fixture: returned tuple · level recorded 2026-09-22
thejungwon/gc-fed community (archive-listed) 9 samples, 4 ran (0 instrument-failed) · 5 unverified
CNN in 23 papers algorithms/gcfed.py ran · metamorphic tier: deterministic no licence file found · pointer only · cff80b8ecb8c8c99 · report fixture: returned CNN · level recorded 2026-09-22
MLP in 375 papers algorithms/gcfed.py ran · metamorphic tier: deterministic no licence file found · pointer only · acd09ebeda2c9bc6 · report fixture: returned MLP · level recorded 2026-09-22
ResNet18 in 174 papers algorithms/gcfed.py ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only · ce17439507a51476 · report fixture: returned ResNet18 · level recorded 2026-09-22
VGG11 in 36 papers algorithms/gcfed.py ran · metamorphic tier: deterministic no licence file found · pointer only · f0aeb868a782b3d7 · report fixture: returned VGG11 · level recorded 2026-09-22
GCFedClient algorithms/gcfed.py unverified no licence file found · pointer only · 70803d2f07b42d4a · report
get_model in 368 papers algorithms/gcfed.py unverified no licence file found · pointer only · 021173b9b0b6da38 · report
init_weights in 109 papers algorithms/gcfed.py unverified no licence file found · pointer only · 39c6548f5ca70964 · report
log_info in 5 papers algorithms/gcfed.py unverified no licence file found · pointer only · a2a34e406dfeba02 · report
set_random_seed in 12 papers algorithms/gcfed.py unverified no licence file found · pointer only · c08e488e6cf86c88 · report
TsingZ0/PFL-Non-IID community (archive-listed) 4 samples, 1 ran (0 instrument-failed) · 3 unverified
model_parameter_vector system/flcore/servers/serverdyn.py ran · honoured contract Apache-2.0 (permissive) · 1f7693bbd3b8865f · report fixture: signature model:callable/0/? · returned Tensor · level recorded 2026-09-22
FedDyn system/flcore/servers/serverdyn.py unverified Apache-2.0 (permissive) · a327f364bcb74163 · report
Server in 21 papers system/flcore/servers/serverdyn.py unverified Apache-2.0 (permissive) · 0a6af52fc93a95a1 · report
clientDyn system/flcore/servers/serverdyn.py unverified Apache-2.0 (permissive) · 16480f2cf0b819dd · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

5 assemblies on this paper: 4 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).

generated Assembly for Federated Learning based on Dynamic Regularization (graph method: Federated Learning based on Dynamic Regularization), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 5 property tests passed on both).

label matches by construction: the code was generated for this method (not judged by a model)

  1. feddr_server_aggregation entry · level 3 · ran · violated contract · 3dbfe6ecd79ad3b991e8129047d8bf990f13942b5f90339ddafb80b3f645664b

4 sibling assemblies for Federated Learning based on Dynamic Regularization (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for Federated Learning based on Dynamic Regularization (graph method: Federated Learning based on Dynamic Regularization). 9 bricks; individually on a fixture: 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified; every one of the 4 samples that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 4 siblings

  1. GCFedClient entry · level 0 · unverified · 70803d2f07b42d4a
  2. get_model model · level 0 · unverified · 021173b9b0b6da38
  3. log_info helper · level 0 · unverified · a2a34e406dfeba02
  4. set_random_seed helper · level 0 · unverified · c08e488e6cf86c88
  5. CNN helper · level 1 · ran · cff80b8ecb8c8c99
  6. MLP helper · level 1 · ran · acd09ebeda2c9bc6
  7. ResNet18 helper · level 1 · ran · ce17439507a51476
  8. VGG11 helper · level 1 · ran · f0aeb868a782b3d7
  9. init_weights helper · level 0 · unverified · 39c6548f5ca70964

harvested Assembly for Federated Learning based on Dynamic Regularization (graph method: Federated Learning based on Dynamic Regularization). 1 brick; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. server_dyn entry · level 1 · ran · our draft was wrong · a0b65033d450bccb

harvested Assembly for Federated Learning based on Dynamic Regularization (graph method: Federated Learning based on Dynamic Regularization). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. train_FedDyn entry · level 0 · unverified · d8e5236ae622abdc

harvested Assembly for Federated Learning based on Dynamic Regularization (graph method: Federated Learning based on Dynamic Regularization). 12 bricks; individually on a fixture: 8 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. FedDyn entry · level 0 · unverified · a327f364bcb74163
  2. Server helper · level 0 · unverified · 0a6af52fc93a95a1
  3. clientDyn model · level 0 · unverified · 16480f2cf0b819dd
  4. DLG helper · level 1 · ran · honoured contract · 8bc43a565d54b3b7
  5. read_client_data helper · level 0 · unverified · ee5f6af39c3092db
  6. Client helper · level 1 · ran · 94a806a7b827ab03
  7. model_parameter_vector helper · level 1 · ran · honoured contract · 1f7693bbd3b8865f
  8. psnr helper · level 1 · ran · honoured contract · 417018913135e19a
  9. process_Shakespeare helper · level 1 · ran · our draft was wrong · 13727b959b74cb36
  10. process_image helper · level 1 · ran · our draft was wrong · eeaf321abdedfa1f
  11. process_text helper · level 1 · ran · our draft was wrong · bff598ba2b65008a
  12. read_data helper · level 1 · ran · honoured contract · 8eebe137489ff326

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2111.04263") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Federated 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