atlas

Research map / Optimization / Distributed and compressed

Stochastic Sign Descent Methods: New Algorithms and Better Theory

ICML 2021 · Optimization › Distributed and compressed · approach: Gradient quantization and sparsification · 10 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 number of nodes in parallel signSGD with majority vote (ablation)parallel signSGD (majority vote) · Rosenbrock function, d=10convergence rateHelped
Use stochastic sign operator with momentum instead of deterministic sign in distributed settingSSDM · distributed partitioned dataconvergence rateHelped
Replace stochastic sign by deterministic sign in SSDM (ablation)SSDM · distributed, two-node counterexampleconvergenceHurt
Use distributed signSGD (deterministic sign of aggregated gradients) on partitioned datasignSGD in distributed setting · partitioned data, weighted lossesconvergenceHurt
Use mini-batch / larger batch size in signSGD trainingsignSGD on MNIST FNN · MNIST standard batch constructiontest/train accuracyHelped
Use signSGD early in training compared to SGDsignSGD vs SGD on MNIST FNN · MNIST split batch and standard batchaccuracy vs communicationHelped
Replace deterministic sign with stochastic sign that is unbiased after scalingsignSGD-type updates with biased estimators · counterexample (least squares, 2D)convergenceHelped

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