{"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":"/paper/nostalgic-adam-weighting-more-of-the-past","title":"Nostalgic Adam: Weighting more of the past gradients when designing the adaptive learning rate","arxiv_id":"1805.07557","date":"2018-05-19","proceeding":null,"authors":["Haiwen Huang","Chang Wang","Bin Dong"],"abstract":"First-order optimization algorithms have been proven prominent in deep\nlearning. In particular, algorithms such as RMSProp and Adam are extremely\npopular. However, recent works have pointed out the lack of ``long-term memory\"\nin Adam-like algorithms, which could hamper their performance and lead to\ndivergence. In our study, we observe that there are benefits of weighting more\nof the past gradients when designing the adaptive learning rate. We therefore\npropose an algorithm called the Nostalgic Adam (NosAdam) with theoretically\nguaranteed convergence at the best known convergence rate. NosAdam can be\nregarded as a fix to the non-convergence issue of Adam in alternative to the\nrecent work of [Reddi et al., 2018]. Our preliminary numerical experiments show\nthat NosAdam is a promising alternative algorithm to Adam. The proofs, code and\nother supplementary materials can be found in an anonymously shared link.","url_abs":"http://arxiv.org/abs/1805.07557v2","url_pdf":"http://arxiv.org/pdf/1805.07557v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"nostalgic-adam-weighting-more-of-the-past","repo_url":"https://github.com/andrehuang/NostalgicAdam-NosAdam","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"nostalgic-adam-weighting-more-of-the-past","repo_url":"https://github.com/andrehuang/NostalgicAdam","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"rmsprop","method_name":"RMSProp"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.07557","atlas_url":"https://app.syntology.ai/?focus=1805.07557","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1805.07557"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.07557\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.07557"},"call":"get_concepts_for_paper(arxiv_id=\"1805.07557\")"}],"by_repo":[{"repo":"andrehuang/NostalgicAdam-NosAdam","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"andrehuang/NostalgicAdam","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"56cd9c1d9feed0dd62477684934135564a8a410ed3839ba3eee10d52369c99b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}