Methods › General › Stochastic Optimization › AdaShift

AdaShift

4 papers tagged archive 2025-07-28

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]

Source: AdaShift: Decorrelation and Convergence of Adaptive...See Code · MichaelKonobeev/adashift

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.

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.

TaskPapers
Image Classification1
Representation Learning1
Stochastic Optimization1
image-classification1

Usage over time archive 2025-07-28

Papers per year tagged with AdaShift: 2018 to 2024, peak 1 1 0 2018: 1 paper 2018 2019: 1 paper 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 0 papers 2022 2023: 0 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (4 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

Stochastic Optimization

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