Browse State-of-the-Art › Federated Learning

Federated Learning

1,815 papers with code · 12 benchmarks · 10 datasets archive 2025-07-28

AdversarialMethodology

Federated Learning is a machine learning approach that allows multiple devices or entities to collaboratively train a shared model without exchanging their data with each other. Instead of sending data to a central server for training, the model is trained locally on each device, and only the model updates are sent to the central server, where they are aggregated to improve the shared model.

This approach allows for privacy-preserving machine learning, as each device keeps its data locally and only shares the information needed to improve the model.

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

12 leaderboard tables shown for this task, 12 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted. 10 shown of 12 until expanded.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
Cityscapes heterogeneous (9 rows) SiloBN + ASAM Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
Landmarks-User-160k (6 rows) FedASAM + SWA Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=0, 10 clients per round) (5 rows) FedASAM + SWA Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=0, 20 clients per round) (5 rows) FedASAM + SWA Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=0, 5 clients per round) (5 rows) FedASAM + SWA Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=0.5, 10 clients per round) (5 rows) FedASAM + SWA Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=0.5, 20 clients per round) (5 rows) FedASAM + SWA Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=0.5, 5 clients per round) (5 rows) FedASAM + SWA Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=1000, 10 clients per round) (5 rows) FedASAM Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=1000, 20 clients per round) (5 rows) FedASAM Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR-100 (alpha=1000, 5 clients per round) (5 rows) FedASAM Improving Generalization in Federated Learning by Seeking Flat Minima code Syntology official (archive's flag): 1 ran · 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 Compare
CIFAR100 (alpha=0.3, 10 clients per round) (1 row) AdaBest AdaBest: Minimizing Client Drift in Federated Learning via... code Syntology 4 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; 0 where Syntology's instrument failed) · 4 unverified Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

10 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

5 subtasks in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 6,771 · with a code link: 1,815 · where Syntology ran a sample: 457 (375 with a run with no instrument failure, 82 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (457 of 6,771 tagged: 375 with a run with no instrument failure, 82 where every run was a failure of Syntology's instrument)

Page 1 of 68: papers 1 to 100 of 6,771, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.

Syntology lines on 53 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

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