Methods › General › Stochastic Optimization › AMSGrad

AMSGrad

49 papers tagged archive 2025-07-28

Introduced by Sashank J. Reddi et al. in On the Convergence of Adam and Beyond

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

AMSGrad is a stochastic optimization method that seeks to fix a convergence issue with Adam based optimizers. AMSGrad uses the maximum of past squared gradients vₜ rather than the exponential average to update the parameters:

mₜ = β₁mₜ₋₁ + (1-β₁)gₜ

vₜ = β₂vₜ₋₁ + (1-β₂)gₜ²

v̂ₜ = max(v̂ₜ₋₁, vₜ)

θₜ₊₁ = θₜ - η/(√(v̂ₜ) + ϵ)mₜ

PaperSourceSee Code · pytorch/pytorch

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: Q-AMSGrad.

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: 49 · with a code link: 14 · where Syntology ran a sample: 4 (4 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 (4 of 49 tagged: 4 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 49 of 49, 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 39 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
Stochastic Optimization12
Deep Learning3
Distributed Optimization3
BIG-bench Machine Learning2
Bilevel Optimization2
Open-Ended Question Answering2
Quantization2
Scheduling2
Time Series2
Time Series Analysis2
Transfer Learning2
Vocal Bursts Type Prediction2
Atari Games1
Binary Classification1
Click-Through Rate Prediction1
Computational Efficiency1
Dictionary Learning1
Distributed Computing1
Federated Learning1
Hyperparameter Optimization1

Usage over time archive 2025-07-28

Papers per year tagged with AMSGrad: 2019 to 2024, peak 16 16 0 2019: 8 papers 2019 2020: 10 papers 2020 2021: 16 papers 2021 2022: 6 papers 2022 2023: 6 papers 2023 2024: 3 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (49 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