{"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/nadam","slug":"nadam","name":"NADAM","full_name":"NADAM","full_name_withheld":false,"description_markdown":"**NADAM**, or **Nesterov-accelerated Adaptive Moment Estimation**, combines [Adam](https://paperswithcode.com/method/adam) and [Nesterov Momentum](https://paperswithcode.com/method/nesterov-accelerated-gradient). The update rule is of the form:\r\n\r\n$$ \\theta\\_{t+1} = \\theta\\_{t} - \\frac{\\eta}{\\sqrt{\\hat{v}\\_{t}}+\\epsilon}\\left(\\beta\\_{1}\\hat{m}\\_{t} + \\frac{(1-\\beta\\_{t})g\\_{t}}{1-\\beta^{t}\\_{1}}\\right)$$\r\n\r\nImage Source: [Incorporating Nesterov Momentum into Adam](http://cs229.stanford.edu/proj2015/054_report.pdf)","description_state":"present","introduced_year":2015,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":"https://github.com/Dawn-Of-Eve/nadir","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":7,"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":"non-convergence-to-global-minimizers-in-data","title":"Non-convergence to global minimizers in data driven supervised deep learning: Adam and stochastic gradient descent optimization provably fail to converge to global minimizers in the training of deep neural networks with ReLU activation","date":"2024-10-14","arxiv_id":"2410.10533","n_code_links":0,"syntology":null},{"paper":null,"slug":"comparison-of-optimizers-for-fault-isolation","title":"Comparison of Optimizers for Fault Isolation and Diagnostics of Control Rod Drives","date":"2024-07-09","arxiv_id":"2407.06557","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":"/paper/mish-a-self-regularized-non-monotonic-neural","slug":"mish-a-self-regularized-non-monotonic-neural","title":"Mish: A Self Regularized Non-Monotonic Activation Function","date":"2019-08-23","arxiv_id":"1908.08681","n_code_links":9,"syntology":{"ran":9,"of":12,"n_ran_checked":7,"n_instrument":2,"unverified":3,"pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["digantamisra98/Mish"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/namsg-an-efficient-method-for-training-neural","slug":"namsg-an-efficient-method-for-training-neural","title":"An Adaptive Remote Stochastic Gradient Method for Training Neural Networks","date":"2019-05-04","arxiv_id":"1905.01422","n_code_links":1,"syntology":null},{"paper":"/paper/on-the-convergence-of-adam-and-beyond-1","slug":"on-the-convergence-of-adam-and-beyond-1","title":"On the Convergence of Adam and Beyond","date":"2019-04-19","arxiv_id":"1904.09237","n_code_links":3,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":3,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":7,"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/nadam/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/nadam/papers/ran/1","json":"/method/nadam/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":1},{"task":"/task/cancer-classification","name":"Cancer Classification","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/fault-detection","name":"Fault Detection","papers":1},{"task":"/task/intrusion-detection","name":"Intrusion Detection","papers":1},{"task":"/task/object-detection","name":"Object Detection","papers":1},{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":1},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1},{"task":"/task/object-detection-1","name":"object-detection","papers":1}],"tasks_shown":12,"n_tasks":12,"usage_by_year":[{"year":"2019","papers":3},{"year":"2023","papers":1},{"year":"2024","papers":3}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/nadam"},"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=NADAM","read_at":"2026-10-05T00:59:29+00:00","query":"NADAM","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'NADAM' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"1b23966463cd73826af345fe17a9555e75a2e9e3d30798700ebeb1cf25f846ba","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}