{"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/recurrent-highway-networks-with-grouped","title":"Recurrent Highway Networks with Grouped Auxiliary Memory","arxiv_id":null,"date":"2019-12-13","proceeding":"IEEE Access 2019 12","authors":["Wei Luo ; Feng Yu"],"abstract":"Recurrent neural networks (RNNs) are challenging to train, let alone those with deep spatial structures. Architectures built upon highway connections such as Recurrent Highway Network (RHN) were developed to allow larger step-to-step transition depth, leading to more expressive models. However, problems that require capturing long-term dependencies still can not be well addressed by these models. Moreover, the ability to keep long-term memories tends to diminish when the spatial depth increases, since deeper structure may accelerate gradient vanishing. In this paper, we address these issues by proposing a novel RNN architecture based on RHN, namely the Recurrent Highway Network with Grouped Auxiliary Memory (GAM-RHN). The proposed architecture interconnects the RHN with a set of auxiliary memory units specifically for storing long-term information via reading and writing operations, which is analogous to Memory Augmented Neural Networks (MANNs). Experimental results on artificial long time lag tasks show that GAM-RHNs can be trained efficiently while being deep in both time and space. We also evaluate the proposed architecture on a variety of tasks, including language modeling, sequential image classification, and financial market forecasting. The potential of our approach is demonstrated by achieving state-of-the-art results on these tasks.","url_abs":"https://ieeexplore.ieee.org/document/8932404","url_pdf":"https://ieeexplore.ieee.org/document/8932404","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":"recurrent-highway-networks-with-grouped","repo_url":"https://github.com/MindCode-4/code-13/tree/main/recurrent-highway-network","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"recurrent-highway-networks-with-grouped","repo_url":"https://github.com/MindCode-4/code-8/tree/main/recurrent-highway-network","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"recurrent-highway-networks-with-grouped","repo_url":"https://github.com/MindSpore-scientific/code-5/tree/main/recurrent-highway-network","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"recurrent-highway-networks-with-grouped","repo_url":"https://github.com/WilliamRo/gam_rhn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"sequential-image-classification","task_name":"Sequential Image Classification"},{"task_slug":"stock-trend-prediction","task_name":"Stock Trend Prediction"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[{"method_slug":"highway-layer","method_name":"Highway Layer"},{"method_slug":"highway-network","method_name":"Highway Network"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/language-modelling-on-penn-treebank-character","task":"Language Modelling","dataset":"Penn Treebank (Character Level)","model":"GAM-RHN-5","rank_in_archive_order":3,"of":20,"metrics":{"Bit per Character (BPC)":"1.147","Number of params":"16.0M"},"uses_additional_data":false},{"leaderboard":"/sota/language-modelling-on-text8","task":"Language Modelling","dataset":"Text8","model":"GAM-RHN-10","rank_in_archive_order":12,"of":24,"metrics":{"Bit per Character (BPC)":"1.157","Number of params":"44.7M"},"uses_additional_data":false},{"leaderboard":"/sota/sequential-image-classification-on-sequential","task":"Sequential Image Classification","dataset":"Sequential MNIST","model":"GAM-RHN-1","rank_in_archive_order":17,"of":30,"metrics":{"Permuted Accuracy":"96.8%"},"uses_additional_data":false},{"leaderboard":"/sota/stock-trend-prediction-on-fi-2010","task":"Stock Trend Prediction","dataset":"FI-2010","model":"BL-GAM-RHN-7","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (H50)":"0.8202","F1 (H50)":"0.8088"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"MindCode-4/code-13","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2212.08663"],"harvested_for_calls":[{"arxiv_id":"2212.08663","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.08663"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.08663\")"}]},{"repo":"MindCode-4/code-8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2103.13843"],"harvested_for_calls":[{"arxiv_id":"2103.13843","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.13843"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.13843\")"}]},{"repo":"MindSpore-scientific/code-5","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2305.06329"],"harvested_for_calls":[{"arxiv_id":"2305.06329","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.06329"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.06329\")"}]},{"repo":"WilliamRo/gam_rhn","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":"00aca11e9db9279da83823305ef1894590b2b348f2280fd142d2bc928323da20","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}