Papers › Agnostic Federated Learning

Agnostic Federated Learning

1 Feb 2019arXiv:1902.00146archive 2025-07-28

Mehryar Mohri, Gary Sivek, Ananda Theertha Suresh

A key learning scenario in large-scale applications is that of federated learning, where a centralized model is trained based on data originating from a large number of clients. We argue that, with the existing training and inference, federated models can be biased towards different clients. Instead, we propose a new framework of agnostic federated learning, where the centralized model is optimized for any target distribution formed by a mixture of the client distributions. We further show that this framework naturally yields a notion of fairness. We present data-dependent Rademacher complexity guarantees for learning with this objective, which guide the definition of an algorithm for agnostic federated learning. We also give a fast stochastic optimization algorithm for solving the corresponding optimization problem, for which we prove convergence bounds, assuming a convex loss function and hypothesis set. We further empirically demonstrate the benefits of our approach in several datasets. Beyond federated learning, our framework and algorithm can be of interest to other learning scenarios such as cloud computing, domain adaptation, drifting, and other contexts where the training and test distributions do not coincide.

PaperPDFCodeCode 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 10 code samples harvested from 2 repositories linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified. Where Syntology's instrument failed: 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 10 samples from 2 repositories, 9 ran (8 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.

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

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

MLOPTPSU/FedTorch mentioned on GitHubpytorchSyntology: not harvested report
MLOPTPSU/TorchFed mentioned on GitHubpytorchGPL-2.0Syntology: not harvested report
cuis15/FCFL mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Addressing Algorithmic Disparity and Performance Inconsistency in Federated Learning (arXiv:2108.08435; that paper's own run record: 9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
fairfl/FCFL mentioned on GitHubpytorchSyntology: 3 samples, 3 ran (1 instrument-failed) · 0 unverified report
fairfl/FUEL mentioned on GitHubpytorchMITSyntology: 7 samples, 6 ran (0 instrument-failed) · 1 unverified report
litian96/fair_flearn mentioned on GitHubMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Fair Resource Allocation in Federated Learning (arXiv:1905.10497; that paper's own run record: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
vaseline555/aaggff mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Pursuing Overall Welfare in Federated Learning through Sequential Decision Making (arXiv:2405.20821; that paper's own run record: 2 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; 2 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. 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

10 samples harvested: 9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 1 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.

1ran · honoured contract
1ran · violated contract
1ran; the contract check could not run
6ran
1unverified

Licence: 0 of the 10 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.

fairfl/FCFL community (archive-listed) 3 samples, 3 ran (1 instrument-failed) · 0 unverified
find_means_for_continuous_types FUEL/dataset_generate.py ran · honoured contract fingerprinted MIT (permissive) · d749254a20b52f05 · report fixture: signature X:ndarray/2/object · returned list · level recorded 2026-09-22
isFloat FUEL/dataset_generate.py ran · violated contract MIT (permissive) · dd69c2e2e8f79e3a · report fixture: signature string:str/0/str · returned bool · level recorded 2026-09-22
prepare_data in 87 papers FUEL/dataset_generate.py ran; the contract check could not run (RAISES) · metamorphic tier: deterministic fingerprinted MIT (permissive) · 6509d4b83913ec5b · report fixture: signature raw_data:ndarray/2/object, means:list/1/float · returned tuple · level recorded 2026-09-22
fairfl/FUEL community (archive-listed) 7 samples, 6 ran (0 instrument-failed) · 1 unverified
concave_fun_eval FUEL/synthetic/utils.py ran fingerprinted MIT (permissive) · a03246af7c71643d · report fixture: signature x:ndarray/1/float · returned tuple · level recorded 2026-09-25
construct_log FUEL/utils.py ran MIT (permissive) · f9bb42bc79562af5 · report fixture: signature args:Args/0/? · returned Logger · level recorded 2026-09-25
f1 in 57 papers FUEL/synthetic/utils.py ran fingerprinted MIT (permissive) · 63aab5e7619728e3 · report fixture: signature x:ndarray/1/float · returned float64 · level recorded 2026-09-25
f2 in 7 papers FUEL/synthetic/utils.py ran fingerprinted MIT (permissive) · 8bdf4363c98a9708 · report fixture: signature x:ndarray/1/float · returned float64 · level recorded 2026-09-25
format_axes in 5 papers FUEL/synthetic/latex_utils.py ran MIT (permissive) · 19c3adf4dc402137 · report fixture: signature ax:Axes/0/?, title:str/0/str, xlabel:str/0/str, ylabel:str/0/str, leg_loc:str/0/str, grid:bool/0/bool · returned Axes · level recorded 2026-09-26
read_data in 132 papers FUEL/utils.py ran fingerprinted MIT (permissive) · 79c283c686e75fbe · report fixture: signature train_data_dir:str/0/str, test_data_dir:str/0/str · returned tuple · level recorded 2026-09-26
concave_fun FUEL/utils.py unverified MIT (permissive) · 85629ba2ef2046f9 · report

Tasks

Cloud ComputingDomain AdaptationFairnessFederated LearningStochastic Optimization

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