atlas

Research map / Optimization / Distributed and compressed

Fast Asynchronous Parallel Stochastic Gradient Descent: A Lock-Free Approach with Convergence Guarantee

AAAI 2016 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 70 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
replace Hogwild! with lock-free AsySVRG (variance-reduced parallel SGD)Hogwild! (10 threads) · rcv1, real-sim, news20, epsilon (logistic regression)convergence rate per effective passHelped
replace Hogwild! with AsySVRGHogwild!-10 · four LibSVM datasetsrelative CPU time to reach errorHelped
remove locks (lock-free update) from AsySVRG (ablation)AsySVRG · four LibSVM datasetsspeedup over 1 threadHelped
remove locks from AsySVRG (ablation)AsySVRG · four LibSVM datasetsconvergence per effective passNo clear effect
increase thread count from 1 to 10AsySVRG · news20convergence per effective passNo clear effect

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