{"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/h-detach-modifying-the-lstm-gradient-towards","title":"h-detach: Modifying the LSTM Gradient Towards Better Optimization","arxiv_id":"1810.03023","date":"2018-10-06","proceeding":"ICLR 2019 5","authors":["Devansh Arpit","Bhargav Kanuparthi","Giancarlo Kerg","Nan Rosemary Ke","Ioannis Mitliagkas","Yoshua Bengio"],"abstract":"Recurrent neural networks are known for their notorious exploding and\nvanishing gradient problem (EVGP). This problem becomes more evident in tasks\nwhere the information needed to correctly solve them exist over long time\nscales, because EVGP prevents important gradient components from being\nback-propagated adequately over a large number of steps. We introduce a simple\nstochastic algorithm (\\textit{h}-detach) that is specific to LSTM optimization\nand targeted towards addressing this problem. Specifically, we show that when\nthe LSTM weights are large, the gradient components through the linear path\n(cell state) in the LSTM computational graph get suppressed. Based on the\nhypothesis that these components carry information about long term dependencies\n(which we show empirically), their suppression can prevent LSTMs from capturing\nthem. Our algorithm\\footnote{Our code is available at\nhttps://github.com/bhargav104/h-detach.} prevents gradients flowing through\nthis path from getting suppressed, thus allowing the LSTM to capture such\ndependencies better. We show significant improvements over vanilla LSTM\ngradient based training in terms of convergence speed, robustness to seed and\nlearning rate, and generalization using our modification of LSTM gradient on\nvarious benchmark datasets.","url_abs":"http://arxiv.org/abs/1810.03023v2","url_pdf":"http://arxiv.org/pdf/1810.03023v2.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":"h-detach-modifying-the-lstm-gradient-towards","repo_url":"https://github.com/bhargav104/h-detach","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.03023","atlas_url":"https://app.syntology.ai/?focus=1810.03023","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":"1810.03023"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.03023\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.03023"},"call":"get_concepts_for_paper(arxiv_id=\"1810.03023\")"}],"by_repo":[{"repo":"bhargav104/h-detach","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":"fe75cd18e48ee86d14829c3e21d3897aee3b111071b44c4bf40e73fcc79a50a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}