Methods › General › Stochastic Optimization › AdaShift
AdaShift
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
AdaShift is a type of adaptive stochastic optimizer that decorrelates vₜ and gₜ in Adam by temporal shifting, i.e., using temporally shifted gradient gₜ₋ₙ to calculate vₜ. The authors argue that an inappropriate correlation between gradient gₜ and the second-moment term vₜ exists in Adam, which results in a large gradient being likely to have a small step size while a small gradient may have a large step size. The authors argue that such biased step sizes are the fundamental cause of non-convergence of Adam.
The AdaShift updates, based on the idea of temporal independence between gradients, are as follows:
gₜ = ∇fₜ(θₜ)
mₜ = ∑ⁿ⁻¹ᵢ₌₀βⁱ₁gₜ₋ᵢ/∑ⁿ⁻¹ᵢ₌₀βⁱ₁
Then for i=1 to M:
vₜ[i] = β₂vₜ₋₁[i] + (1-β₂)ϕ(g²ₜ₋ₙ[i])
θₜ[i] = θₜ₋₁[i] - αₜ/√(vₜ[i])·mₜ[i]
In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.
From the lookup's note on this name: Nothing resolved to this name, but 3 entries in Syntology's graph carry it; the most cited is the paper “AdaShift: Decorrelation and Convergence of Adaptive Learning Rate Methods” (arXiv:1810.00143, 75 citations). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute. For arXiv:1810.00143: its page on this site · ask the lookup about it.
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: 4 · with a code link: 3 · where Syntology ran a sample: 2 (2 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 (2 of 4 tagged: 2 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 4 of 4, 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.
-
AdaShift: Learning Discriminative Self-Gated Neural Feature Activation With an Adaptive Shift Factor 1 Jan 2024 · 0 repositories
-
Momentum Centering and Asynchronous Update for Adaptive Gradient Methods 11 Oct 2021 · 2 repositories · arXiv:2110.05454
-
An Adaptive and Momental Bound Method for Stochastic Learning 27 Oct 2019 · 2 repositories · arXiv:1910.12249Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples)
-
AdaShift: Decorrelation and Convergence of Adaptive Learning Rate Methods 29 Sep 2018 · 3 repositories · arXiv:1810.00143Syntology 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)
Tasks archive 2025-07-28
4 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 |
|---|---|
| Image Classification | 1 |
| Representation Learning | 1 |
| Stochastic Optimization | 1 |
| image-classification | 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