atlas

Research map / Optimization / Distributed and compressed

Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go?

ICML 2018 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 37 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 polynomially growing gradient delays (d_n = O(n^q)) with step size alpha_n ∝ 1/(n log n log log n) instead of bounded delaysDASGD on stochastic variationally coherent problems · theoretical convergence analysisalmost sure convergence to global minimizerNo clear effect
Use linearly growing delays with step size 1/(n log n) instead of bounded delays (ablation)DAGD on Rosenbrock (d=101) with synchronous baseline comparison · Rosenbrock function d=101value convergence in simulationNo clear effect
Use ergodic averaging of iterates (weighted average) instead of last iterate X_n (ablation)DASGD on non-convex Rosenbrock function · Rosenbrock function d=101value convergenceHurt

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