{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/adamax","slug":"adamax","name":"AdaMax","full_name":"AdaMax","full_name_withheld":false,"description_markdown":"**AdaMax** is a generalisation of [Adam](https://paperswithcode.com/method/adam) from the $l\\_{2}$ norm to the $l\\_{\\infty}$ norm. Define:\r\n\r\n$$ u\\_{t} = \\beta^{\\infty}\\_{2}v\\_{t-1} + \\left(1-\\beta^{\\infty}\\_{2}\\right)|g\\_{t}|^{\\infty}$$\r\n\r\n$$ = \\max\\left(\\beta\\_{2}\\cdot{v}\\_{t-1}, |g\\_{t}|\\right)$$\r\n\r\nWe can plug into the Adam update equation by replacing $\\sqrt{\\hat{v}_{t} + \\epsilon}$ with $u\\_{t}$ to obtain the AdaMax update rule:\r\n\r\n$$ \\theta\\_{t+1} = \\theta\\_{t} - \\frac{\\eta}{u\\_{t}}\\hat{m}\\_{t} $$\r\n\r\nCommon default values are $\\eta = 0.002$ and $\\beta\\_{1}=0.9$ and $\\beta\\_{2}=0.999$.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"http://arxiv.org/abs/1412.6980v9","title":"Adam: A Method for Stochastic Optimization","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/pytorch/pytorch/blob/b7bda236d18815052378c88081f64935427d7716/torch/optim/adamax.py#L5","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":9,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"new-insight-in-cervical-cancer-diagnosis","title":"New Insight in Cervical Cancer Diagnosis Using Convolution Neural Network Architecture","date":"2024-10-23","arxiv_id":"2410.17735","n_code_links":0,"syntology":null},{"paper":null,"slug":"should-i-try-multiple-optimizers-when-fine","title":"Should I try multiple optimizers when fine-tuning pre-trained Transformers for NLP tasks? Should I tune their hyperparameters?","date":"2024-02-10","arxiv_id":"2402.06948","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-model-for-multi-attack-classification-to","title":"A model for multi-attack classification to improve intrusion detection performance using deep learning approaches","date":"2023-10-25","arxiv_id":"2310.16380","n_code_links":0,"syntology":null},{"paper":null,"slug":"elra-exponential-learning-rate-adaption","title":"ELRA: Exponential learning rate adaption gradient descent optimization method","date":"2023-09-12","arxiv_id":"2309.06274","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimization-methods-in-deep-learning-a","title":"Optimization Methods in Deep Learning: A Comprehensive Overview","date":"2023-02-19","arxiv_id":"2302.09566","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-transformer-model-with-pre-layer","title":"Deep Transformer Model with Pre-Layer Normalization for COVID-19 Growth Prediction","date":"2022-07-10","arxiv_id":"2207.06356","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-vdvae-less-is-more","slug":"efficient-vdvae-less-is-more","title":"Efficient-VDVAE: Less is more","date":"2022-03-25","arxiv_id":"2203.13751","n_code_links":1,"syntology":null},{"paper":"/paper/nvae-a-deep-hierarchical-variational","slug":"nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","arxiv_id":"2007.03898","n_code_links":10,"syntology":{"ran":26,"of":41,"n_ran_checked":21,"n_instrument":5,"unverified":15,"pointer_only":23,"phrase":"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","official":{"repos":["NVlabs/NVAE"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":3,"n_ran_no_instrument_failure":6,"n_unverified":14,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/adam-a-method-for-stochastic-optimization","slug":"adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","arxiv_id":"1412.6980","n_code_links":87,"syntology":{"ran":27,"of":37,"n_ran_checked":23,"n_instrument":4,"unverified":10,"pointer_only":8,"phrase":"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","official":null}}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":3,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/adamax/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/adamax/papers/ran/1","json":"/method/adamax/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/deep-learning","name":"Deep Learning","papers":2},{"task":"/task/image-generation","name":"Image Generation","papers":2},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":2},{"task":"/task/cancer-classification","name":"Cancer Classification","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/intrusion-detection","name":"Intrusion Detection","papers":1},{"task":"/task/quantization","name":"Quantization","papers":1},{"task":"/task/speech-recognition","name":"Speech Recognition","papers":1},{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":1},{"task":"/task/time-series-1","name":"Time Series","papers":1},{"task":"/task/time-series","name":"Time Series Analysis","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1},{"task":"/task/speech-recognition-1","name":"speech-recognition","papers":1}],"tasks_shown":13,"n_tasks":13,"usage_by_year":[{"year":"2014","papers":1},{"year":"2020","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":3},{"year":"2024","papers":2}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/adamax"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=AdaMax","read_at":"2026-10-05T00:51:29+00:00","query":"AdaMax","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"AdaMax","origin_arxiv_id":"1412.6980"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":5,"in_graph":87,"list_truncated":true,"strongest_link":"mentioned_in_github"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1412.6980","citations":170433},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'AdaMax'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1412.6980","page":"/paper/adam-a-method-for-stochastic-optimization","syntology_url":"https://syntology.ai/paper/1412.6980","in_graph_layer":true,"samples":37,"ran":27,"n_ran_checked":23,"n_instrument":4,"unverified":10,"phrase":"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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"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.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"a641b45c8459717fb22e0d6b902c9543a65c8614640fe1a3a60195894e67ca55","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}