Papers › Deep learning with Elastic Averaging SGD

Deep learning with Elastic Averaging SGD

20 Dec 2014NeurIPS 2015 12arXiv:1412.6651archive 2025-07-28

Sixin Zhang, Anna Choromanska, Yann Lecun

We study the problem of stochastic optimization for deep learning in the parallel computing environment under communication constraints. A new algorithm is proposed in this setting where the communication and coordination of work among concurrent processes (local workers), is based on an elastic force which links the parameters they compute with a center variable stored by the parameter server (master). The algorithm enables the local workers to perform more exploration, i.e. the algorithm allows the local variables to fluctuate further from the center variable by reducing the amount of communication between local workers and the master. We empirically demonstrate that in the deep learning setting, due to the existence of many local optima, allowing more exploration can lead to the improved performance. We propose synchronous and asynchronous variants of the new algorithm. We provide the stability analysis of the asynchronous variant in the round-robin scheme and compare it with the more common parallelized method ADMM. We show that the stability of EASGD is guaranteed when a simple stability condition is satisfied, which is not the case for ADMM. We additionally propose the momentum-based version of our algorithm that can be applied in both synchronous and asynchronous settings. Asynchronous variant of the algorithm is applied to train convolutional neural networks for image classification on the CIFAR and ImageNet datasets. Experiments demonstrate that the new algorithm accelerates the training of deep architectures compared to DOWNPOUR and other common baseline approaches and furthermore is very communication efficient.

PaperPDFConference PDFCodeCode 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

The archive's official repository (sixin-zh/mpiT) was not harvested; the 12 samples below come from 2 community repositories.

Syntology 12 code samples harvested from 2 repositories linked to this paper: 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) · 11 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: community (archive-listed): 12 samples from 2 repositories, 1 ran (1 with no instrument failure; 0 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-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

sixin-zh/mpiT officialmentioned in papertorchApache-2.0Syntology: not harvested report
JoeriHermans/dist-keras mentioned on GitHubGPL-3.0Syntology: not harvested report
cerndb/dist-keras mentioned on GitHubGPL-3.0Syntology: not harvested report
duanders/mpi_learn mentioned on GitHubpytorchGPL-3.0Syntology: not harvested report
mila-udem/platoon mentioned on GitHubMITSyntology: 6 samples, 1 ran (0 instrument-failed) · 5 unverified report
tmulc18/Distributed-TensorFlow-Guide mentioned on GitHubtfMITSyntology: 6 samples, 0 ran · 6 unverified report
uoguelph-mlrg/Theano-MPI mentioned on GitHubNOASSERTIONSyntology: not harvested report
valentinchelle/kerasOnSpark mentioned on GitHubtfGPL-3.0Syntology: not harvested report
vlimant/NNLO mentioned on GitHubtfGPL-3.0Syntology: not harvested report
vlimant/mpi_learn mentioned on GitHubpytorchGPL-3.0Syntology: not harvested 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

12 samples harvested: 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) · 11 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
11unverified

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

mila-udem/platoon community (archive-listed) 6 samples, 1 ran (0 instrument-failed) · 5 unverified
launch_process platoon/util.py ran MIT (permissive) · 6985423314deb16d · report fixture: signature logs_folder:str/0/str, experiment_name:str/0/str, args:list/1/str, device:str/0/str, process_type:str/0/str · returned Popen · level recorded 2026-09-26
AverageSGD platoon/training/global_dynamics.py unverified MIT (permissive) · 1c0eb2292a1f7394 · report
SumSGD platoon/training/global_dynamics.py unverified MIT (permissive) · 3f0bece70f1f844a · report
fetch_devices_for_host platoon/configparser.py unverified MIT (permissive) · acd320b0a5508644 · report
mmap platoon/util.py unverified MIT (permissive) · 1c10065ed878004e · report
op_to_mpi platoon/util.py unverified MIT (permissive) · ee9496eca0245020 · report
tmulc18/Distributed-TensorFlow-Guide community (archive-listed) 6 samples, 0 ran · 6 unverified
assign_global_to_local AGN/AGN.py unverified MIT (permissive) · f8a4a97b4d0d03f9 · report
assign_global_to_local DOWNPOUR-Easy/DOWNPOUR.py unverified MIT (permissive) · cfe0509e6a9c0096 · report
assign_local_to_global AGN/AGN.py unverified MIT (permissive) · 92949b36477b9bf0 · report
get_global_variable_by_name AGN/AGN.py unverified MIT (permissive) · b62207d24c9391fe · report
get_variable_by_name DOWNPOUR-Easy/DOWNPOUR.py unverified MIT (permissive) · af0c2ca334ca8e29 · report
get_variable_by_name DOWNPOUR/DOWNPOUR.py unverified MIT (permissive) · a8b21a10b799b5c9 · report

Tasks

Deep LearningImage ClassificationStochastic Optimizationimage-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ADMM

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