Methods › General › Regularization › GradDrop
Gradient Sign Dropout
GradDrop
Introduced by Zhao Chen et al. in Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropout
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
GradDrop, or Gradient Sign Dropout, is a probabilistic masking procedure which samples gradients at an activation layer based on their level of consistency. It is applied as a layer in any standard network forward pass, usually on the final layer before the prediction head to save on compute overhead and maximize benefits during backpropagation. Below, we develop the GradDrop formalism. Throughout, o denotes elementwise multiplication after any necessary tiling operations (if any) are completed. To implement GradDrop, we first define the Gradient Positive Sign Purity, 𝒫, as
𝒫=1/2(1+(∑ᵢ ∇L_{i)/∑ᵢ|∇Lᵢ|)
𝒫 is bounded by [0,1] . For multiple gradient values ∇ₐ Lᵢ at some scalar a, we see that 𝒫=0 if ∇ₐ Lᵢ<0 ∀i, while 𝒫=1 if ∇ₐ Lᵢ>0 ∀i. Thus, 𝒫 is a measure of how many positive gradients are present at any given value. We then form a mask for each gradient ℳᵢ as follows:
ℳᵢ=ℐ[f(𝒫)>U] ∘ℐ[∇Lᵢ>0]+ℐ[f(𝒫)<U] ∘ℐ[∇Lᵢ<0]
for ℐ the standard indicator function and f some monotonically increasing function (often just the identity) that maps [0,1] ↦[0,1] and is odd around (0.5,0.5). U is a tensor composed of i.i.d U(0,1) random variables. The ℳᵢ is then used to produce a final gradient ∑ℳᵢ ∇Lᵢ
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.
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: 3 · with a code link: 1 · 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 3 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 3 of 3, 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.
-
Gradient Sparsification For Masked Fine-Tuning of Transformers 19 Jul 2023 · 0 repositories · arXiv:2307.10098
-
Gradient Sparsification For Masked Fine-Tuning of Transformers 16 Nov 2021 · 0 repositories
-
Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropout 14 Oct 2020 · 2 repositories · arXiv:2010.06808Syntology community repositories only · 3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 6 harvested samples) · 6 pointer-only (licence)
Tasks archive 2025-07-28
2 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Transfer Learning | 3 |
| XLM-R | 1 |
Usage over time archive 2025-07-28
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
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