What is recorded here?
Quantized stochastic gradients with controllable unbiased rounding and bounded second moments, then encoded the sparse/low-precision updates to trade communication against optimization iterations.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Pinned original four-author 2016 version, not later expanded byline. Inherits SGD and 1-bit compression predecessors. Sublinear bits per iteration can require more iterations; communication-optimal claims concern specified convex/distributed models, not arbitrary deep networks or universally faster wall-clock training. Lossless coding is applied after lossy quantization, not lossless reconstruction of the original gradient.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Dan Alistarh; Jerry Z. Li; Ryota Tomioka; Milan Vojnovic
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
QSGD: unbiased randomized gradient quantization and coding tradeoffs
Quantized stochastic gradients with controllable unbiased rounding and bounded second moments, then encoded the sparse/low-precision updates to trade communication against optimization iterations.
Scientific scope
Pinned original four-author 2016 version, not later expanded byline. Inherits SGD and 1-bit compression predecessors. Sublinear bits per iteration can require more iterations; communication-optimal claims concern specified convex/distributed models, not arbitrary deep networks or universally faster wall-clock training. Lossless coding is applied after lossy quantization, not lossless reconstruction of the original gradient.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Dan Alistarh; Jerry Z. Li; Ryota Tomioka; Milan Vojnovic
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.