atlas

Research map / Optimization / Distributed and compressed

Optimal Distributed Learning with Multi-pass Stochastic Gradient Methods

ICML 2018 · Optimization › Distributed and compressed · approach: Decentralized optimization algorithms · 11 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
Increase partition level m from 2 to 64 (distributed SGM, step-size 1/(8n)) (ablation)distributed SGM · Simulated nonparametric regressiongeneralization error and number of passes to minimal errorHurt
Increase partition level m (more local subsets) while keeping total passes fixeddistributed SGM · Simulated nonparametric regressiontotal computational cost to reach minimal errorHelped
Distributed SGM with partition level m ≤ N^β (β < (2ζ+γ-1)/(2ζ+γ)) and tuned step-size/mini-batch/passesdistributed SGM · Theory, capacity/regularity assumptions (Corollary 2)convergence rate of generalization errorNo clear effect
Distributed partitioning with saturation for regularity ζ > 1distributed SGM · Theory (Corollary 2)convergence rateHurt
Single-machine multi-pass SGM (m=1) with improved analysis vs. prior Lin & Rosasco 2017bmulti-pass SGM · Theory (Theorem 2)convergence rate exponent/log factorHelped

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