atlas

Research map / Optimization / Distributed and compressed

On the Computation and Communication Complexity of Parallel SGD with Dynamic Batch Sizes for Stochastic Non-Convex Optimization

ICML 2019 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 27 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 exponentially increasing batch sizes in parallel SGDParallel SGD under the P-L condition · Stochastic non-convex optimization under P-L conditioncommunication rounds: O(T) -> O(log(T))Helped
Use exponentially increasing batch sizes in parallel SGDParallel SGD under the P-L condition · Stochastic non-convex optimization under P-L conditionconvergence rate: O(1/(NT))Helped
Wrap CR-PSGD in a proximal-point outer loopCR-PSGD · General stochastic non-convex optimizationcommunication rounds: O(T) -> O(sqrt(TN)log(T/N))Helped
Wrap CR-PSGD in a proximal-point outer loopCR-PSGD · General stochastic non-convex optimizationconvergence rate: O(1/sqrt(NT))Helped

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