{"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":"/method/sru","slug":"sru","name":"SRU","full_name":"SRU","full_name_withheld":false,"description_markdown":"**SRU**, or **Simple Recurrent Unit**, is a recurrent neural unit with a light form of recurrence. SRU exhibits the same level of parallelism as [convolution](https://paperswithcode.com/method/convolution) and [feed-forward nets](https://paperswithcode.com/methods/category/feedforward-networks). This is achieved by balancing sequential dependence and independence: while the state computation of SRU is time-dependent, each state dimension is independent. This simplification enables CUDA-level optimizations that parallelize the computation across hidden dimensions and time steps, effectively using the full capacity of modern GPUs. \r\n\r\nSRU also replaces the use of convolutions (i.e., ngram filters), as in [QRNN](https://paperswithcode.com/method/qrnn) and KNN, with more recurrent connections. This retains modeling capacity, while using less computation (and hyper-parameters). Additionally, SRU improves the training of deep recurrent models by employing [highway connections](https://paperswithcode.com/method/highway-layer) and a parameter initialization scheme tailored for gradient propagation in deep architectures.\r\n\r\nA single layer of SRU involves the following computation:\r\n\r\n$$\r\n\\mathbf{f}\\_{t} =\\sigma\\left(\\mathbf{W}\\_{f} \\mathbf{x}\\_{t}+\\mathbf{v}\\_{f} \\odot \\mathbf{c}\\_{t-1}+\\mathbf{b}\\_{f}\\right) \r\n$$\r\n\r\n$$\r\n\\mathbf{c}\\_{t} =\\mathbf{f}\\_{t} \\odot \\mathbf{c}\\_{t-1}+\\left(1-\\mathbf{f}\\_{t}\\right) \\odot\\left(\\mathbf{W} \\mathbf{x}\\_{t}\\right) \\\\\r\n$$\r\n\r\n$$\r\n\\mathbf{r}\\_{t} =\\sigma\\left(\\mathbf{W}\\_{r} \\mathbf{x}\\_{t}+\\mathbf{v}\\_{r} \\odot \\mathbf{c}\\_{t-1}+\\mathbf{b}\\_{r}\\right) \\\\\r\n$$\r\n\r\n$$\r\n\\mathbf{h}\\_{t} =\\mathbf{r}\\_{t} \\odot \\mathbf{c}\\_{t}+\\left(1-\\mathbf{r}\\_{t}\\right) \\odot \\mathbf{x}\\_{t}\r\n$$\r\n\r\nwhere $\\mathbf{W}, \\mathbf{W}\\_{f}$ and $\\mathbf{W}\\_{r}$ are parameter matrices and $\\mathbf{v}\\_{f}, \\mathbf{v}\\_{r}, \\mathbf{b}\\_{f}$ and $\\mathbf{b}_{v}$ are parameter vectors to be learnt during training. The complete architecture decomposes to two sub-components: a light recurrence and a highway network,\r\n\r\nThe light recurrence component successively reads the input vectors $\\mathbf{x}\\_{t}$ and computes the sequence of states $\\mathbf{c}\\_{t}$ capturing sequential information. The computation resembles other recurrent networks such as [LSTM](https://paperswithcode.com/method/lstm), [GRU](https://paperswithcode.com/method/gru) and RAN. Specifically, a forget gate $\\mathbf{f}\\_{t}$ controls the information flow and the state vector $\\mathbf{c}\\_{t}$ is determined by adaptively averaging the previous state $\\mathbf{c}\\_{t-1}$ and the current observation $\\mathbf{W} \\mathbf{x}_{+}$according to $\\mathbf{f}\\_{t}$.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Simple Recurrent Units for Highly Parallelizable Recurrence","paper":"/paper/simple-recurrent-units-for-highly","first_author":"Tao Lei","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/simple-recurrent-units-for-highly"},"source":{"url":"http://arxiv.org/abs/1709.02755v5","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Recurrent Neural Networks","url":"/methods/category/recurrent-neural-networks","pwc_aliases":[]}],"n_papers_tagged":16,"archive_num_papers":16,"papers_newest_first":[{"paper":"/paper/selective-stereo-adaptive-frequency","slug":"selective-stereo-adaptive-frequency","title":"Selective-Stereo: Adaptive Frequency Information Selection for Stereo Matching","date":"2024-03-01","arxiv_id":"2403.00486","n_code_links":1,"syntology":{"ran":10,"of":13,"n_ran_checked":2,"n_instrument":8,"unverified":3,"pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","official":{"repos":["windsrain/selective-stereo"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-effectiveness-of-unlearning-in-session","slug":"on-the-effectiveness-of-unlearning-in-session","title":"On the Effectiveness of Unlearning in Session-Based Recommendation","date":"2023-12-22","arxiv_id":"2312.14447","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["shirryliu/sru-code"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/neural-machine-translation-models-with","slug":"neural-machine-translation-models-with","title":"Neural Machine Translation Models with Attention-Based Dropout Layer","date":"2023-05-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/scconv-spatial-and-channel-reconstruction","slug":"scconv-spatial-and-channel-reconstruction","title":"SCConv: Spatial and Channel Reconstruction Convolution for Feature Redundancy","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"a-robust-approach-for-the-decomposition-of","title":"A Robust Approach for the Decomposition of High-Energy-Consuming Industrial Loads with Deep Learning","date":"2022-03-11","arxiv_id":"2203.07075","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-objective-recurrent-neural-networks","title":"MOHAQ: Multi-Objective Hardware-Aware Quantization of Recurrent Neural Networks","date":"2021-08-02","arxiv_id":"2108.01192","n_code_links":0,"syntology":null},{"paper":null,"slug":"intelligent-reflecting-surface-enhanced-5","title":"Intelligent Reflecting Surface Enhanced Indoor Robot Path Planning: A Radio Map based Approach","date":"2020-09-27","arxiv_id":"2009.12804","n_code_links":0,"syntology":null},{"paper":"/paper/asapp-asr-multistream-cnn-and-self-attentive","slug":"asapp-asr-multistream-cnn-and-self-attentive","title":"ASAPP-ASR: Multistream CNN and Self-Attentive SRU for SOTA Speech Recognition","date":"2020-05-21","arxiv_id":"2005.10469","n_code_links":0,"syntology":null},{"paper":null,"slug":"multistream-cnn-for-robust-acoustic-modeling","title":"Multistream CNN for Robust Acoustic Modeling","date":"2020-05-21","arxiv_id":"2005.10470","n_code_links":0,"syntology":null},{"paper":null,"slug":"utterance-level-sequential-modeling-for-deep","title":"Utterance-level Sequential Modeling For Deep Gaussian Process Based Speech Synthesis Using Simple Recurrent Unit","date":"2020-04-22","arxiv_id":"2004.10823","n_code_links":0,"syntology":null},{"paper":"/paper/wavecrn-an-efficient-convolutional-recurrent","slug":"wavecrn-an-efficient-convolutional-recurrent","title":"WaveCRN: An Efficient Convolutional Recurrent Neural Network for End-to-end Speech Enhancement","date":"2020-04-06","arxiv_id":"2004.04098","n_code_links":5,"syntology":null},{"paper":"/paper/economy-statistical-recurrent-units-for-1","slug":"economy-statistical-recurrent-units-for-1","title":"Economy Statistical Recurrent Units For Inferring Nonlinear Granger Causality","date":"2019-11-22","arxiv_id":"1911.09879","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sakhanna/SRU_for_GCI"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/fastfusionnet-new-state-of-the-art-for","slug":"fastfusionnet-new-state-of-the-art-for","title":"FastFusionNet: New State-of-the-Art for DAWNBench SQuAD","date":"2019-02-28","arxiv_id":"1902.11291","n_code_links":2,"syntology":null},{"paper":null,"slug":"single-stream-parallelization-of-recurrent","title":"Single Stream Parallelization of Recurrent Neural Networks for Low Power and Fast Inference","date":"2018-03-30","arxiv_id":"1803.11389","n_code_links":0,"syntology":null},{"paper":"/paper/training-rnns-as-fast-as-cnns","slug":"training-rnns-as-fast-as-cnns","title":"Training RNNs as Fast as CNNs","date":"2018-01-01","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":"/paper/simple-recurrent-units-for-highly","slug":"simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","arxiv_id":"1709.02755","n_code_links":11,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["asappresearch/sru"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":16,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":16,"with_a_code_link":9,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/sru/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/sru/papers/ran/1","json":"/method/sru/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/speech-recognition","name":"Speech Recognition","papers":4},{"task":"/task/speech-recognition-1","name":"speech-recognition","papers":4},{"task":"/task/translation","name":"Translation","papers":3},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":2},{"task":"/task/classification","name":"General Classification","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/machine-translation","name":"Machine Translation","papers":2},{"task":"/task/question-answering","name":"Question Answering","papers":2},{"task":null,"name":"CPU","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/nmt","name":"NMT","papers":1},{"task":"/task/quantization","name":"Quantization","papers":1},{"task":"/task/reading-comprehension","name":"Reading Comprehension","papers":1},{"task":"/task/retrieval","name":"Retrieval","papers":1},{"task":"/task/robot-navigation","name":"Robot Navigation","papers":1},{"task":"/task/session-based-recommendations","name":"Session-Based Recommendations","papers":1},{"task":"/task/speech-denoising","name":"Speech Denoising","papers":1},{"task":"/task/speech-enhancement","name":"Speech Enhancement","papers":1}],"tasks_shown":20,"n_tasks":27,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":2},{"year":"2019","papers":2},{"year":"2020","papers":5},{"year":"2021","papers":1},{"year":"2022","papers":1},{"year":"2023","papers":3},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/sru"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=SRU","read_at":"2026-10-05T01:02:31+00:00","query":"SRU","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1709.02755","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"2403.00486","title":"Selective-Stereo: Adaptive Frequency Information Selection for Stereo Matching","citations":166,"named_by":["acronym_expansion"],"bearer_name":"Selective Recurrent Unit (SRU)","ask_with":"have('2403.00486')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'SRU' by name, but 2 thing(s) here DECLARE that name -- most cited: 'Selective Recurrent Unit (SRU)', a method in 'Selective-Stereo: Adaptive Frequency Information Selection for Stereo Matching' (arXiv:2403.00486, 166 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is “Selective Recurrent Unit (SRU)”, a method in the paper “Selective-Stereo: Adaptive Frequency Information Selection for Stereo Matching” (arXiv:2403.00486, 166 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":["SRU++","SRU-Pix2Pix","Selective Recurrent Unit (SRU)","Single Request Untwinning (SRU)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"e55635ae376365be7ba81acbb646299a0fa0887b26334b7f60d5d0c869bf928c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}