Methods › General › Data Parallel Methods › Gradient Sparsification

Gradient Sparsification

38 papers tagged archive 2025-07-28

Introduced by Jianqiao Wangni et al. in Gradient Sparsification for Communication-Efficient Distributed Optimization

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Gradient Sparsification is a technique for distributed training that sparsifies stochastic gradients to reduce the communication cost, with minor increase in the number of iterations. The key idea behind our sparsification technique is to drop some coordinates of the stochastic gradient and appropriately amplify the remaining coordinates to ensure the unbiasedness of the sparsified stochastic gradient. The sparsification approach can significantly reduce the coding length of the stochastic gradient and only slightly increase the variance of the stochastic gradient.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: gradient EM; Gradient Cuff; Gradient Mirage; pathway gradient; Gradient Surgery; Gradient Sealing; Gradient Surgery; phantom gradient.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 38 · with a code link: 10 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 38 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 38 of 38, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 28 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Federated Learning13
Quantization5
Deep Learning3
Distributed Optimization3
Stochastic Optimization3
BIG-bench Machine Learning2
Fairness2
GPU2
Privacy Preserving2
Transfer Learning2
compressed sensing2
Adversarial Defense1
Adversarial Robustness1
All1
Bayesian Inference1
Binarization1
Classification1
Collaborative Fairness1
Earth Observation1
General Classification1

Usage over time archive 2025-07-28

Papers per year tagged with Gradient Sparsification: 2017 to 2025, peak 6 6 0 2017: 1 paper 2017 2018: 3 papers 2018 2019: 4 papers 2019 2020: 5 papers 2020 2021: 6 papers 2021 2022: 4 papers 2022 2023: 6 papers 2023 2024: 5 papers 2024 2025: 4 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (38 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Data Parallel MethodsStochastic OptimizationOptimizationDistributed Methods

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections