Deep Gradient Compression (DGC with Momentum Correction and Momentum Factor Masking)
Algorithms AIMech:DeepGradientCompressionWithMomentumCorrection DRAFT
Aliases: Deep Gradient Compression, DGC, Top-k Gradient Sparsification with Momentum Correction and Factor Masking
A high-sparsity distributed gradient compression algorithm (Lin et al. 2018, Section 3, Algorithm 1) that transmits only the top-k magnitude entries (down to 0.1% density) of a locally accumulated velocity buffer while preserving dense momentum-SGD convergence via four coupled mechanisms: (1) Momentum Correction (u_{k,t} = m u_{k,t-1} + g_{k,t}, v_{k,t} = v_{k,t-1} + u_{k,t}, Eq. 6), which accumulates local momentum velocities rather than raw gradients; (2) Momentum Factor Masking (v_{k,t} <- v_{k,t} o (1 - Mask), u_{k,t} <- u_{k,t} o (1 - Mask), Eq. 8), which clears both the accumulator and momentum factor on transmitted coordinates; (3) local gradient clipping scaled by N^{-1/2} before accumulation; and (4) warm-up sparsity scheduling.
Identity Notes & Concept Scope
Distinct from vanilla error-compensated Top-k SGD (AIMech:SparsifiedSgdWithErrorMemoryForKContractiveGradientCompression, Stich, Cordonnier, & Jaggi 2018), which analyses momentum-free local error memory e_{t+1} = e_t + eta g_t - C(e_t + eta g_t) without Momentum Correction (Eq. 6) or Momentum Factor Masking (Eq. 8).
Claims & Grounded Evidence
4 Claims
Mechanism
#r421-momentum-correction-equivalence-to-dense-momentum-sgd
When coordinate (i) remains below the sparsification threshold for T consecutive steps before firing, naive local gradient accumulation v_{k,t} = v_{k,t-1} + g_{k,t} (Eq. 5) loses the geometric discounting factors sum_{tau=0}^{T-1 - t} m^tau on intermediate gradients compared to dense momentum SGD (Eq. 4), whereas Momentum Correction u_{k,t} = m u_{k,t-1} + g_{k,t}, v_{k,t} = v_{k,t-1} + u_{k,t} (Eq. 6-7, Appendix B) restores the exact cumulative step -eta sum_{t=0}^{T-1} u_t of dense momentum SGD.
Mechanism
#r421-momentum-factor-masking-and-local-gradient-clipping-staleness-control
Zeroing both the velocity accumulator v_{k,t}^{(j)} and the momentum factor u_{k,t}^{(j)} on every transmitted coordinate j (Momentum Factor Masking, Eq. 8) prevents stale pre-transmission momentum from re-accumulating into v_{k,t+1}^{(j)} on subsequent steps, while scaling the local L2 gradient clipping threshold by N^{-1/2} preserves the global clipping norm across N workers (Section 3.3, Appendix C).
Limitation
#r421-sparse-index-encoding-and-allgather-irregularity-limitation
Because each worker selects a different set of top-k coordinate indices, transmitting sparse updates requires sending both values and index offsets and preventing dense in-place ring AllReduce without sparse index reconstruction or hierarchical aggregation.
Application
#r421-imagenet-resnet50-speech-recognition-and-language-modeling-application
Applied to distributed training of ResNet-50 and AlexNet on ImageNet, Penn Treebank LSTM language modeling, and AN4 speech recognition, achieving 277x to 597x gradient compression ratios without loss of validation accuracy.
⚠️ Curated Limitations & Negative Results
- Requires maintaining two full-dimension O(d) local buffers (u_{k,t} and v_{k,t}) per worker.
- Top-k threshold selection via random 0.1%-1% coordinate subsampling introduces an approximate quantile estimate at each step.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:SparseLearning
Sparse Learning
|
related_match | Deep Gradient Compression is a high-sparsity top-k gradient compression method with momentum correction for distributed deep learning. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r421-primary-pdf
|
Yujun Lin, Song Han, Huizi Mao, Yu Wang, William J. Dally
|
primary paper
full_text
|
ID: https://openreview.net/forum?id=SkhQHMW0W
sha256:b0a9404af47f…
|
r421-arxiv-abs
|
Yujun Lin, Song Han, Huizi Mao, Yu Wang, William J. Dally
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/1712.01887
sha256:0cadc88b8c0e…
|
r421-metadata-cr
|
Yujun Lin, Song Han, Huizi Mao, Yu Wang, William J. Dally
|
primary paper
abstract_only
|
ID: https://openreview.net/forum?id=SkhQHMW0W
sha256:43b9bad89ba0…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T08:24:00Z
Updated: 2026-10-19T08:24:00Z
Source File:
data/curated/DeepGradientCompressionWithMomentumCorrection.yaml
· Schema:
curated_concept.yaml
Explore across X-Mech
Related computational & biological Mechs:
Embedding Map
Network Graph
ProteinTraitsMech (ESM-2 pLM)
DUFMech (Domain pLM)
TraitMech
CultureMech
All 14 X-Mech Repositories