{"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/adaptive-gradient-methods-with-dynamic-bound","title":"Adaptive Gradient Methods with Dynamic Bound of Learning Rate","arxiv_id":"1902.09843","date":"2019-02-26","proceeding":"ICLR 2019 5","authors":["Liangchen Luo","Yuanhao Xiong","Yan Liu","Xu sun"],"abstract":"Adaptive optimization methods such as AdaGrad, RMSprop and Adam have been\nproposed to achieve a rapid training process with an element-wise scaling term\non learning rates. Though prevailing, they are observed to generalize poorly\ncompared with SGD or even fail to converge due to unstable and extreme learning\nrates. Recent work has put forward some algorithms such as AMSGrad to tackle\nthis issue but they failed to achieve considerable improvement over existing\nmethods. In our paper, we demonstrate that extreme learning rates can lead to\npoor performance. We provide new variants of Adam and AMSGrad, called AdaBound\nand AMSBound respectively, which employ dynamic bounds on learning rates to\nachieve a gradual and smooth transition from adaptive methods to SGD and give a\ntheoretical proof of convergence. We further conduct experiments on various\npopular tasks and models, which is often insufficient in previous work.\nExperimental results show that new variants can eliminate the generalization\ngap between adaptive methods and SGD and maintain higher learning speed early\nin training at the same time. Moreover, they can bring significant improvement\nover their prototypes, especially on complex deep networks. The implementation\nof the algorithm can be found at https://github.com/Luolc/AdaBound .","url_abs":"http://arxiv.org/abs/1902.09843v1","url_pdf":"http://arxiv.org/pdf/1902.09843v1.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":"adaptive-gradient-methods-with-dynamic-bound","repo_url":"https://github.com/Luolc/AdaBound","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"adaptive-gradient-methods-with-dynamic-bound","repo_url":"https://github.com/201419/Optimizer-PyTorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"adaptive-gradient-methods-with-dynamic-bound","repo_url":"https://github.com/wri/restoration-mapper","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"adaptive-gradient-methods-with-dynamic-bound","repo_url":"https://github.com/wri/sentinel-tree-cover","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"adaptive-gradient-methods-with-dynamic-bound","repo_url":"https://github.com/taki0112/AdaBound-Tensorflow","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[],"methods":[{"method_slug":"amsbound","method_name":"AMSBound"},{"method_slug":"adabound","method_name":"AdaBound"},{"method_slug":"adagrad","method_name":"AdaGrad"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"rmsprop","method_name":"RMSProp"},{"method_slug":"sgd","method_name":"SGD"},{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[{"slug":"amsbound","name":"AMSBound","full_name":"AMSBound"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.09843","atlas_url":"https://app.syntology.ai/?focus=1902.09843","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":"1902.09843"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.09843\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.09843"},"call":"get_concepts_for_paper(arxiv_id=\"1902.09843\")"}],"by_repo":[{"repo":"Luolc/AdaBound","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"201419/Optimizer-PyTorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1908.03265"],"harvested_for_calls":[{"arxiv_id":"1908.03265","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1908.03265"},"call":"get_harvested_code_for_paper(arxiv_id=\"1908.03265\")"}]},{"repo":"wri/restoration-mapper","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1607.06450"],"harvested_for_calls":[{"arxiv_id":"1607.06450","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.06450"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.06450\")"}]},{"repo":"wri/sentinel-tree-cover","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"taki0112/AdaBound-Tensorflow","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"115e261abbee0c1529692866216a6581c593d3711af69847159dae80fabca327","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}