{"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/iclr-reproducibility-challenge-report-padam","title":"ICLR Reproducibility Challenge Report (Padam : Closing The Generalization Gap Of Adaptive Gradient Methods in Training Deep Neural Networks)","arxiv_id":"1901.09517","date":"2019-01-28","proceeding":null,"authors":["Harshal Mittal","Kartikey Pandey","Yash Kant"],"abstract":"This work is a part of ICLR Reproducibility Challenge 2019, we try to\nreproduce the results in the conference submission PADAM: Closing The\nGeneralization Gap of Adaptive Gradient Methods In Training Deep Neural\nNetworks. Adaptive gradient methods proposed in past demonstrate a degraded\ngeneralization performance than the stochastic gradient descent (SGD) with\nmomentum. The authors try to address this problem by designing a new\noptimization algorithm that bridges the gap between the space of Adaptive\nGradient algorithms and SGD with momentum. With this method a new tunable\nhyperparameter called partially adaptive parameter p is introduced that varies\nbetween [0, 0.5]. We build the proposed optimizer and use it to mirror the\nexperiments performed by the authors. We review and comment on the empirical\nanalysis performed by the authors. Finally, we also propose a future direction\nfor further study of Padam. Our code is available at:\nhttps://github.com/yashkant/Padam-Tensorflow","url_abs":"http://arxiv.org/abs/1901.09517v1","url_pdf":"http://arxiv.org/pdf/1901.09517v1.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":"iclr-reproducibility-challenge-report-padam","repo_url":"https://github.com/yashkant/Padam-Tensorflow","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[],"methods":[{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"yashkant/Padam-Tensorflow","kind":"official","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":"4eb0d2fd302d56b4f532ab3889519761ccec4eb9a3526ff26d1f169b83b544c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}