Methods › General › Stochastic Optimization › NADAM

NADAM

introduced 2015 7 papers tagged archive 2025-07-28

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

NADAM, or Nesterov-accelerated Adaptive Moment Estimation, combines Adam and Nesterov Momentum. The update rule is of the form:

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

Image Source: Incorporating Nesterov Momentum into Adam

See Code · Dawn-Of-Eve/nadir

Papers archive 2025-07-28

7 shown of 7, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

12 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 Classification2
Anomaly Detection1
Cancer Classification1
Decoder1
Deep Learning1
Fault Detection1
Intrusion Detection1
Object Detection1
Stochastic Optimization1
Transfer Learning1
image-classification1
object-detection1

Usage over time archive 2025-07-28

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