{"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/long-short-term-memory-with-dynamic-skip","title":"Long Short-Term Memory with Dynamic Skip Connections","arxiv_id":"1811.03873","date":"2018-11-09","proceeding":null,"authors":["Tao Gui","Qi Zhang","Lujun Zhao","Yaosong Lin","Minlong Peng","Jingjing Gong","Xuanjing Huang"],"abstract":"In recent years, long short-term memory (LSTM) has been successfully used to\nmodel sequential data of variable length. However, LSTM can still experience\ndifficulty in capturing long-term dependencies. In this work, we tried to\nalleviate this problem by introducing a dynamic skip connection, which can\nlearn to directly connect two dependent words. Since there is no dependency\ninformation in the training data, we propose a novel reinforcement\nlearning-based method to model the dependency relationship and connect\ndependent words. The proposed model computes the recurrent transition functions\nbased on the skip connections, which provides a dynamic skipping advantage over\nRNNs that always tackle entire sentences sequentially. Our experimental results\non three natural language processing tasks demonstrate that the proposed method\ncan achieve better performance than existing methods. In the number prediction\nexperiment, the proposed model outperformed LSTM with respect to accuracy by\nnearly 20%.","url_abs":"http://arxiv.org/abs/1811.03873v1","url_pdf":"http://arxiv.org/pdf/1811.03873v1.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":"long-short-term-memory-with-dynamic-skip","repo_url":"https://github.com/lecholin/DynamicLSTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"named-entity-recognition-ner","task_name":"Named Entity Recognition (NER)"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"}],"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":[{"leaderboard":"/sota/named-entity-recognition-ner-on-conll-2003","task":"Named Entity Recognition (NER)","dataset":"CoNLL 2003 (English)","model":"LSTM with dynamic skip","rank_in_archive_order":60,"of":73,"metrics":{"F1":"91.56"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-imdb","task":"Sentiment Analysis","dataset":"IMDb","model":"LSTM with dynamic skip","rank_in_archive_order":37,"of":49,"metrics":{"Accuracy":"90.1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.03873","atlas_url":"https://app.syntology.ai/?focus=1811.03873","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":"1811.03873"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.03873\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.03873"},"call":"get_concepts_for_paper(arxiv_id=\"1811.03873\")"}],"by_repo":[{"repo":"lecholin/DynamicLSTM","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":"010d644d9c4a7445cac1fd4363e948fcefa697ae7bb44abf8155768c3afd5863","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}