AI Paper Atlas

Research map / Optimization / Distributed and compressed

Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters

Yi Zhou, Yingbin Liang, Yaoliang Yu, Wei Dai, Eric P. Xing

JMLR 2018 · Optimization › Distributed and compressed · approach: Decentralized optimization algorithms · 20 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
allow larger staleness (s=10 to 30) with a staleness-penalized step size eta(alpha_s) (ablation)m-PAPG · Non-convex group Lasso, n=1000, d=2000objective valueNo clear effect
use the large synchronous step size eta(0) when staleness is nonzero (ablation)m-PAPG · Non-convex group Lasso, n=1000, d=2000convergenceHurt
add a staleness-dependent penalty alpha_s on the learning rate (eta*(alpha_s)) (ablation)m-PAPG · Non-convex group Lasso, n=1000, d=2000stable convergenceImproved
increase maximum staleness s from 0 to 1,3,5,7 (ablation)m-PAPG on Petuum · Large Lasso, n=1M, d=100M, 100 nodesper-iteration progressNo clear effect
increase maximum staleness s from 0 to 1,3,5,7 (ablation)m-PAPG on Petuum · Large Lasso, n=1M, d=100M, 100 nodessystem throughput (objective vs seconds)Improved

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