atlas

Research map / Optimization / Distributed and compressed

Asynchronous Distributed Semi-Stochastic Gradient Optimization

AAAI 2016 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 14 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use variance-reduced gradient in DPG (vr-dpg vs dpg) (ablation)DPG · Mnist8m and DNAobjective vs wall-clock timeHelped
apply delayed gradient to current iterate v^t as well (distr-vr-sgd vs vr-dpg style update) (ablation)distr-vr-sgd · Mnist8m and DNAobjective vs wall-clock timeHelped
set theta from nonzero to 0 (distr-svrg) (ablation)distr-vr-sgd · Mnist8m and DNAconvergence speed: learning rate $10^{-3}$ -> $10^{-6}$Hurt
increase workers from 16 to 128distr-vr-sgd · Mnist8mtime to target objective: about 3 times fasterHelped
increase workers from 16 to 128distr-vr-sgd · DNAtime to target objective: about 6 timesHelped
increase delay bound tau from 10 to 200distr-vr-sgd · Mnist8m/DNA, 128 workerscommunication costHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy