Papers › Stabilized Proximal-Point Methods for Federated Optimization

Stabilized Proximal-Point Methods for Federated Optimization

9 Jul 2024arXiv:2407.07084archive 2025-07-28

Xiaowen Jiang, Anton Rodomanov, Sebastian U. Stich

In developing efficient optimization algorithms, it is crucial to account for communication constraints -- a significant challenge in modern Federated Learning. The best-known communication complexity among non-accelerated algorithms is achieved by DANE, a distributed proximal-point algorithm that solves local subproblems at each iteration and that can exploit second-order similarity among individual functions. However, to achieve such communication efficiency, the algorithm requires solving local subproblems sufficiently accurately resulting in slightly sub-optimal local complexity. Inspired by the hybrid-projection proximal-point method, in this work, we propose a novel distributed algorithm S-DANE. Compared to DANE, this method uses an auxiliary sequence of prox-centers while maintaining the same deterministic communication complexity. Moreover, the accuracy condition for solving the subproblem is milder, leading to enhanced local computation efficiency. Furthermore, S-DANE supports partial client participation and arbitrary stochastic local solvers, making it attractive in practice. We further accelerate S-DANE and show that the resulting algorithm achieves the best-known communication complexity among all existing methods for distributed convex optimization while still enjoying good local computation efficiency as S-DANE. Finally, we propose adaptive variants of both methods using line search, obtaining the first provably efficient adaptive algorithms that could exploit local second-order similarity without the prior knowledge of any parameters.

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 15 code samples harvested from 1 repository linked to this paper: 10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified. Where Syntology's instrument failed: 6 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 15 samples from 1 repository, 10 ran (4 with no instrument failure; 6 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-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

mlolab/s-dane officialmentioned in paperpytorchSyntology: 15 samples, 10 ran (6 instrument-failed) · 5 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: 10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · violated contract
6ran · our draft was wrong
3ran
5unverified

Licence: 15 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 mlolab/s-dane. “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.

mlolab/s-dane official repository 15 samples, 10 ran (6 instrument-failed) · 5 unverified
add_vectors src/optimizers/accgradsliding.py ran no licence file found · pointer only · 3bc32482b7e6ace5 · report fixture: signature a:float/0/float, b:float/0/float, vector1:list/1/Tensor, vector2:list/1/Tensor · returned list · level recorded 2026-09-24
compute_average_vectors src/optimizers/accgradsliding.py ran · our draft was wrong no licence file found · pointer only · 029b117429ce49ea · report fixture: signature vector_list:dict/0/? · returned list · level recorded 2026-09-24
get_classifier in 16 papers src/base_classifier.py ran no licence file found · pointer only · 759293e202b468dd · report fixture: signature clf_name:str/0/str, train_set:list/1/MinimalBatch · returned Quadratic_model · level recorded 2026-09-24
get_dataset in 285 papers src/datasets.py ran no licence file found · pointer only · cfac3c404e669f4e · report fixture: signature dataset_name:str/0/str, split:str/0/str, datadir:str/0/str, exp_dict:dict/0/? · returned DatasetWrapper · level recorded 2026-09-24
get_metric_function src/metrics.py ran · our draft was wrong no licence file found · pointer only · d7a2c7ec3d979bb1 · report fixture: signature metric_name:str/0/str · returned function · level recorded 2026-09-24
load_json in 344 papers src/utils.py ran · our draft was wrong no licence file found · pointer only · 493c4dd4d6a4d756 · report fixture: signature fname:str/0/str, decode:NoneType/0/? · returned dict · level recorded 2026-09-24
load_pkl in 46 papers src/utils.py ran · our draft was wrong no licence file found · pointer only · 50ab62fb90cfd1a3 · report fixture: signature fname:str/0/str · returned dict · level recorded 2026-09-24
multiply_number_vector src/optimizers/accgradsliding.py ran · violated contract fingerprinted no licence file found · pointer only · b22ded125b44e841 · report fixture: signature a:int/0/int, vector:list/1/int · returned list · level recorded 2026-09-24
read_text in 29 papers src/utils.py ran · our draft was wrong no licence file found · pointer only · 4c6787e9e326cb19 · report fixture: signature fname:str/0/str · returned list · level recorded 2026-09-24
split_index_iid src/datasets.py ran · our draft was wrong no licence file found · pointer only · 1173582bb0065e73 · report fixture: signature dataset:SimpleDataset/0/?, nb_users:int/0/int · returned dict · level recorded 2026-09-24
get_model in 368 papers src/models.py unverified no licence file found · pointer only · b667f8007c622e6b · report
get_optimizer in 228 papers src/optimizer.py unverified no licence file found · pointer only · 0ce85016c30f493a · report
polyhedron_loss src/metrics.py unverified no licence file found · pointer only · 90fe3d7379deaea0 · report
quadratic_loss src/metrics.py unverified no licence file found · pointer only · 4d8479a4925059d8 · report
split_index_dirichlet src/datasets.py unverified no licence file found · pointer only · 0236a198be4ab7d9 · report

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