{"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/rra-recurrent-residual-attention-for-sequence","title":"RRA: Recurrent Residual Attention for Sequence Learning","arxiv_id":"1709.03714","date":"2017-09-12","proceeding":null,"authors":["Cheng Wang"],"abstract":"In this paper, we propose a recurrent neural network (RNN) with residual\nattention (RRA) to learn long-range dependencies from sequential data. We\npropose to add residual connections across timesteps to RNN, which explicitly\nenhances the interaction between current state and hidden states that are\nseveral timesteps apart. This also allows training errors to be directly\nback-propagated through residual connections and effectively alleviates\ngradient vanishing problem. We further reformulate an attention mechanism over\nresidual connections. An attention gate is defined to summarize the individual\ncontribution from multiple previous hidden states in computing the current\nstate. We evaluate RRA on three tasks: the adding problem, pixel-by-pixel MNIST\nclassification and sentiment analysis on the IMDB dataset. Our experiments\ndemonstrate that RRA yields better performance, faster convergence and more\nstable training compared to a standard LSTM network. Furthermore, RRA shows\nhighly competitive performance to the state-of-the-art methods.","url_abs":"http://arxiv.org/abs/1709.03714v1","url_pdf":"http://arxiv.org/pdf/1709.03714v1.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":"rra-recurrent-residual-attention-for-sequence","repo_url":"https://github.com/JRC1995/Abstractive-Summarization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"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":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1709.03714","atlas_url":"https://app.syntology.ai/?focus=1709.03714","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":"1709.03714"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1709.03714\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1709.03714"},"call":"get_concepts_for_paper(arxiv_id=\"1709.03714\")"}],"by_repo":[{"repo":"JRC1995/Abstractive-Summarization","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":"8a498338974c063970b521334c268f3daee398d7c95210ce0a62892a3bb82dc0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}