Methods › General › Stochastic Optimization › AdaMax
AdaMax
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
AdaMax is a generalisation of Adam from the l₂ norm to the l_∞ norm. Define:
uₜ = β^∞₂vₜ₋₁ + (1-β^∞₂)|gₜ|^∞
= max(β₂·vₜ₋₁, |gₜ|)
We can plug into the Adam update equation by replacing √(v̂ₜ + ϵ) with uₜ to obtain the AdaMax update rule:
θₜ₊₁ = θₜ - η/uₜm̂ₜ
Common default values are η= 0.002 and β₁=0.9 and β₂=0.999.
In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 87 in the graph, strongest link: mentioned on GitHub). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:1412.6980) is about this method is not checked.
Origin paper of this answer, arXiv:1412.6980 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 27 ran (of which 7 constructed an object rather than computing a result; 23 with no instrument failure: 4 honoured, 2 violated, 17 with no contract checked; 4 where Syntology's instrument failed) · 10 unverified (of 37 harvested samples) · 8 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
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: 9 · 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 9 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 9 of 9, 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.
-
New Insight in Cervical Cancer Diagnosis Using Convolution Neural Network Architecture 23 Oct 2024 · 0 repositories · arXiv:2410.17735
-
Should I try multiple optimizers when fine-tuning pre-trained Transformers for NLP tasks? Should I tune their hyperparameters? 10 Feb 2024 · 0 repositories · arXiv:2402.06948
-
A model for multi-attack classification to improve intrusion detection performance using deep learning approaches 25 Oct 2023 · 0 repositories · arXiv:2310.16380
-
ELRA: Exponential learning rate adaption gradient descent optimization method 12 Sep 2023 · 0 repositories · arXiv:2309.06274
-
Optimization Methods in Deep Learning: A Comprehensive Overview 19 Feb 2023 · 0 repositories · arXiv:2302.09566
-
Deep Transformer Model with Pre-Layer Normalization for COVID-19 Growth Prediction 10 Jul 2022 · 0 repositories · arXiv:2207.06356
-
Efficient-VDVAE: Less is more 25 Mar 2022 · 1 repository · arXiv:2203.13751
-
NVAE: A Deep Hierarchical Variational Autoencoder 8 Jul 2020 · 10 repositories · arXiv:2007.03898Syntology official (archive's flag): 9 ran · 26 ran (of which 15 constructed an object rather than computing a result; 21 with no instrument failure: 3 honoured, 0 violated, 18 with no contract checked; 5 where Syntology's instrument failed) · 15 unverified (of 41 harvested samples) · 23 pointer-only (licence)
-
Adam: A Method for Stochastic Optimization 22 Dec 2014 · 87 repositories · arXiv:1412.6980Syntology 27 ran (of which 7 constructed an object rather than computing a result; 23 with no instrument failure: 4 honoured, 2 violated, 17 with no contract checked; 4 where Syntology's instrument failed) · 10 unverified (of 37 harvested samples) · 8 pointer-only (licence)
Tasks archive 2025-07-28
13 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
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