Browse State-of-the-Art › Distributed Optimization
Distributed Optimization
86 papers with code · 1 benchmark · 0 datasets archive 2025-07-28
The goal of Distributed Optimization is to optimize a certain objective defined over millions of billions of data that is distributed over many machines by utilizing the computational power of these machines.
Source: Analysis of Distributed StochasticDual Coordinate Ascent
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 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.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| ^(#!@#)(()))****** (1 row) | 多微电网区域配电系统的多目标分布式优化 | Multi-objective Distributed Optimization for Zonal Distribution... | — | — | 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
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 536 · with a code link: 86 · where Syntology ran a sample: 14 (13 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (14 of 536 tagged: 13 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 6: papers 1 to 100 of 536, 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.
-
14 Dec 2018 22 repositories listed Syntology official (archive's flag): 8 ran · 15 ran (of which 6 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified (of 26 harvested samples) · 9 pointer-only (licence)Theoretically, we provide convergence guarantees for our framework when learning over data from non-identical distributions (statistical heterogeneity), and while adhering to device-level systems constraints by allowing…
-
14 Oct 2019 8 repositories listed Syntology 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 (of 4 harvested samples)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.
-
27 Apr 2022 3 repositories listedWe demonstrate that employing the proposed Power Bundle Adjustment as a sub-problem solver significantly improves speed and accuracy of the distributed optimization.
-
21 Jun 2021 3 repositories listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 9 harvested samples)Training such models requires a lot of computational resources (e. g., HPC clusters) that are not available to small research groups and independent researchers.
-
31 Dec 2017 3 repositories listedRecent advances in derivative-free optimization allow efficient approximation of the global-optimal solutions of sophisticated functions, such as functions with many local optima, non-differentiable and non-continuous…
-
13 Jun 2022 2 repositories listedSpurred by that, we propose distributed adversarial training (DAT), a large-batch adversarial training framework implemented over multiple machines.
-
19 Jun 2021 2 repositories listedWe propose a novel approach for large-scale nonlinear least squares problems based on deep learning frameworks.
-
4 Mar 2021 2 repositories listed Syntology official (archive's flag): 1 ran · 1 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; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)Training deep neural networks on large datasets can often be accelerated by using multiple compute nodes.
-
13 Feb 2020 2 repositories listed Syntology 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) · 0 unverified (of 3 harvested samples)By running the optimizer in the host EPS, we show a new form of mixed precision for faster throughput and convergence.
-
7 Jan 2020 2 repositories listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)Federated learning aims to jointly learn statistical models over massively distributed remote devices.
-
30 Oct 2019 2 repositories listed Syntology official (archive's flag): 1 ran · 1 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; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)Specifically, we show that for loss functions that satisfy the Polyak-Łojasiewicz condition, O((pT)^(1/3)) rounds of communication suffice to achieve a linear speed up, that is, an error of O(1/pT), where T is the total…
-
1 Oct 2019 2 repositories listed Syntology official: harvested for another paper · 0 ran · 3 unverified (of 3 harvested samples) · 1 pointer-only (licence)We provide theoretical convergence guarantees showing that SlowMo converges to a stationary point of smooth non-convex losses.
-
21 Aug 2019 2 repositories listed Syntology 11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified (of 11 harvested samples) · 4 pointer-only (licence)Federated learning involves training statistical models over remote devices or siloed data centers, such as mobile phones or hospitals, while keeping data localized.
-
29 Jan 2019 2 repositories listedModern machine learning methods often require more data for training than a single expert can provide.
-
7 Nov 2016 2 repositories listedThe scale of modern datasets necessitates the development of efficient distributed optimization methods for machine learning.
-
13 Dec 2015 2 repositories listedDespite the importance of sparsity in many large-scale applications, there are few methods for distributed optimization of sparsity-inducing objectives.
-
25 Jun 2025 1 repository listedNumerical results validate the generated test cases, establishing DPLib as a foundation for reproducible distributed power system research.
-
5 Mar 2025 1 repository listedThis paper addresses the challenge of packet-based information routing in large-scale wireless communication networks.
-
25 Dec 2024 1 repository listedThus, we propose FedCFA, a novel FL framework employing counterfactual learning to generate counterfactual samples by replacing local data critical factors with global average data, aligning local data distributions…
-
4 Nov 2024 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 8 harvested samples)We present a novel methodology for convex optimization algorithm design using ideas from electric RLC circuits.
-
18 Aug 2024 1 repository listedDue to the discretization and temporal features of AoI indicators, the Qedgix framework employs QMIX to optimize distributed partially observable Markov decision processes (Dec-POMDP) based on centralized training and…
-
15 Jul 2024 1 repository listedWe demonstrate RAG's performance in simulated scenarios of area detection with up to 45 robots, simulating realistic robot-to-robot (r2r) communication speeds such as the 0.
-
3 Jun 2024 1 repository listedTraining LLMs relies on distributed implementations using multiple GPUs to compute gradients in parallel with sharded optimizers.
-
24 May 2024 1 repository listed Syntology official (archive's flag): 7 ran · 7 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; 3 where Syntology's instrument failed) · 3 unverified (of 10 harvested samples)We propose a new variant of the Adam optimizer called MicroAdam that specifically minimizes memory overheads, while maintaining theoretical convergence guarantees.
-
10 Apr 2024 1 repository listedOur results demonstrate three major findings: 1) The UPMEM PIM system can be a viable alternative to state-of-the-art CPUs and GPUs for many memory-bound ML training workloads, especially when operations and datatypes…
-
16 Feb 2024 1 repository listedSpecifically, FairSync resolves the issue by moving it to the dual space, where a central node aggregates historical fairness data into a vector and distributes it to all servers.
-
29 Jan 2024 1 repository listedMany machine learning applications require operating on a spatially distributed dataset.
-
17 Jan 2024 1 repository listedLocal stochastic gradient descent (Local-SGD), also referred to as federated averaging, is an approach to distributed optimization where each device performs more than one SGD update per communication.
-
Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates15 Oct 2023 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample) · 1 pointer-only (licence)Byzantine robustness is an essential feature of algorithms for certain distributed optimization problems, typically encountered in collaborative/federated learning.
-
10 Oct 2023 1 repository listedThis incentive mechanism can be viewed as a set of rules of the transmission expansion investment coordination game, set by the social planner TPC, such that, even if the individual TPs act selfishly, it will still lead…
-
1 Oct 2023 1 repository listed
-
28 Jun 2023 1 repository listed
-
16 Jun 2023 1 repository listed
-
24 May 2023 1 repository listed
-
19 Mar 2023 1 repository listed
-
8 Mar 2023 1 repository listed
-
20 Feb 2023 1 repository listed
-
8 Feb 2023 1 repository listed Syntology official (archive's flag): 3 ran · 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 (of 3 harvested samples)
-
5 Jan 2023 1 repository listed
-
28 Oct 2022 1 repository listed
-
26 Sep 2022 1 repository listed
-
24 Sep 2022 1 repository listed
-
9 Jul 2022 1 repository listed
-
7 Jun 2022 1 repository listed
-
9 May 2022 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample)
-
5 Mar 2022 1 repository listed
-
18 Feb 2022 1 repository listed
-
2 Feb 2022 1 repository listed
-
1 Feb 2022 1 repository listed Syntology official (archive's flag): 2 ran · 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 (of 2 harvested samples) · 2 pointer-only (licence)
-
3 Oct 2021 1 repository listed
-
26 Sep 2021 1 repository listed
-
25 Sep 2021 1 repository listed
-
30 Aug 2021 1 repository listed
-
Dynamic communication topologies for distributed heuristics in energy system optimization algorithms3 Aug 2021 1 repository listed
-
3 Jul 2021 1 repository listed
-
12 May 2021 1 repository listed
-
13 Mar 2021 1 repository listed
-
14 Feb 2021 1 repository listed
-
24 Nov 2020 1 repository listed
-
11 Oct 2020 1 repository listed
-
5 Sep 2020 1 repository listed
-
15 Jul 2020 1 repository listed
-
11 Jul 2020 1 repository listed
-
2 Jul 2020 1 repository listed
-
16 Jun 2020 1 repository listed
-
16 Jun 2020 1 repository listed
-
22 May 2020 1 repository listed
-
5 May 2020 1 repository listed
-
29 Apr 2020 1 repository listed
-
1 Jan 2020 1 repository listed
-
12 Dec 2019 1 repository listed
-
1 Dec 2019 1 repository listed
-
23 Oct 2019 1 repository listed
-
12 Sep 2019 1 repository listed
-
3 Jul 2019 1 repository listed
-
31 May 2019 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
21 Mar 2019 1 repository listed
-
20 Sep 2018 1 repository listed Syntology official (archive's flag): 3 ran · 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) · 0 unverified (of 3 harvested samples)
-
4 Mar 2018 1 repository listed
-
14 Nov 2017 1 repository listed
-
28 Feb 2017 1 repository listed
-
31 Oct 2016 1 repository listed
-
18 Aug 2016 1 repository listed
-
13 Dec 2015 1 repository listed
-
12 Feb 2015 1 repository listed
-
30 Dec 2013 1 repository listed
-
Communication Efficient, Differentially Private Distributed Optimization using Correlation-Aware Sketching4 Jul 2025 0 repositories listed
-
Multi-Timescale Gradient Sliding for Distributed Optimization18 Jun 2025 0 repositories listed
-
Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking9 Jun 2025 0 repositories listed
-
Distributed gradient methods under heavy-tailed communication noise30 May 2025 0 repositories listed
-
Online distributed optimization for spatio-temporally constrained real-time peer-to-peer energy trading28 May 2025 0 repositories listed
-
Privacy-Preserving Peer-to-Peer Energy Trading via Hybrid Secure Computations26 May 2025 0 repositories listed
-
Federated Learning: From Theory to Practice25 May 2025 0 repositories listed
-
Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs23 May 2025 0 repositories listed
-
LAGO: Few-shot Crosslingual Embedding Inversion Attacks via Language Similarity-Aware Graph Optimization21 May 2025 0 repositories listed
-
Distributed Optimization with Efficient Communication, Event-Triggered Solution Enhancement, and Operation Stopping23 Apr 2025 0 repositories listed
-
Distributed model predictive control without terminal cost under inexact distributed optimization22 Apr 2025 0 repositories listed
-
Hessian Riemannian Flow For Multi-Population Wardrop Equilibrium22 Apr 2025 0 repositories listed
-
Residual-Evasive Attacks on ADMM in Distributed Optimization22 Apr 2025 0 repositories listed
-
Distributed Optimization with Gradient Tracking over Heterogeneous Delay-Prone Directed Networks15 Apr 2025 0 repositories listed
Syntology lines on 17 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