{"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/qrnn","slug":"qrnn","name":"QRNN","full_name":"Quasi-Recurrent Neural Network","full_name_withheld":false,"description_markdown":"A **QRNN**, or **Quasi-Recurrent Neural Network**, is a type of recurrent neural network that alternates convolutional layers, which apply in parallel across timesteps, and a minimalist recurrent pooling function that applies in parallel across channels. Due to their increased parallelism, they can be up to 16 times faster at train and test time than [LSTMs](https://paperswithcode.com/method/lstm).\r\n\r\nGiven an input sequence $\\mathbf{X} \\in \\mathbb{R}^{T\\times{n}}$ of $T$ n-dimensional vectors $\\mathbf{x}\\_{1}, \\dots, \\mathbf{x}\\_{T}$, the convolutional subcomponent of a QRNN performs convolutions in the timestep dimension with a bank of $m$ filters, producing a sequence $\\mathbf{Z} \\in \\mathbb{R}^{T\\times{m}}$ of m-dimensional candidate vectors $\\mathbf{z}\\_{t}$. Masked convolutions are used so filters can not access information from future timesteps (implementing with left padding).\r\n\r\nAdditional convolutions are applied with separate filter banks to obtain sequences of vectors for the\r\nelementwise gates that are needed for the pooling function. While the candidate vectors are passed\r\nthrough a $\\tanh$ nonlinearity, the gates use an elementwise sigmoid. If the pooling function requires a\r\nforget gate $f\\_{t}$ and an output gate $o\\_{t}$ at each timestep, the full set of computations in the convolutional component is then:\r\n\r\n$$ \\mathbf{Z} = \\tanh\\left(\\mathbf{W}\\_{z} ∗ \\mathbf{X}\\right) $$\r\n$$ \\mathbf{F} = \\sigma\\left(\\mathbf{W}\\_{f} ∗ \\mathbf{X}\\right) $$\r\n$$ \\mathbf{O} = \\sigma\\left(\\mathbf{W}\\_{o} ∗ \\mathbf{X}\\right) $$\r\n\r\nwhere $\\mathbf{W}\\_{z}$, $\\mathbf{W}\\_{f}$, and $\\mathbf{W}\\_{o}$, each in $\\mathbb{R}^{k×n×m}$, are the convolutional filter banks and ∗ denotes a [masked convolution](https://paperswithcode.com/method/masked-convolution) along the timestep dimension.  Dynamic [average pooling](https://paperswithcode.com/method/average-pooling) by Balduzzi & Ghifary (2016) is used, which uses only a forget gate:\r\n\r\n$$ \\mathbf{h}\\_{t} = \\mathbf{f}\\_{t} \\odot{\\mathbf{h}\\_{t−1}} + \\left(1 − \\mathbf{f}\\_{t}\\right) \\odot{\f\\mathbf{z}\\_{t}} $$ \r\n\r\nWhich is denoted f-pooling. The function may also include an output gate:\r\n\r\n$$ \\mathbf{c}\\_{t} = \\mathbf{f}\\_{t} \\odot{\\mathbf{c}\\_{t−1}} + \\left(1 − \\mathbf{f}\\_{t}\\right) \\odot{\f\\mathbf{z}\\_{t}} $$ \r\n\r\n$$ \\mathbf{h}\\_{t} = \\mathbf{o}\\_{t} \\odot{\\mathbf{c}\\_{t}} $$\r\n\r\nWhich is denoted fo-pooling. Or the recurrence relation may include an independent input and forget gate:\r\n\r\n$$ \\mathbf{c}\\_{t} = \\mathbf{f}\\_{t} \\odot{\\mathbf{c}\\_{t−1}} + \\mathbf{i}\\_{t}\\odot{\f\\mathbf{z}\\_{t}} $$ \r\n\r\n$$ \\mathbf{h}\\_{t} = \\mathbf{o}\\_{t} \\odot{\\mathbf{c}\\_{t}} $$\r\n\r\nWhich is denoted ifo-pooling. In each case $h$ or $c$ is initialized to zero. The recurrent part sof these functions must be calculated for each timestep in the sequence, but parallelism along feature dimensions means evaluating them even over long sequences requires a negligible amount of computation time.\r\n\r\nA single QRNN layer thus performs an input-dependent pooling, followed by a gated linear combination of convolutional features. As with convolutional neural networks, two or more QRNN layers should be stacked to create a model with the capacity to approximate more complex functions.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"http://arxiv.org/abs/1611.01576v2","title":"Quasi-Recurrent Neural Networks","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":15,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"obtaining-optimal-spiking-neural-network-in","title":"Obtaining Optimal Spiking Neural Network in Sequence Learning via CRNN-SNN Conversion","date":"2024-08-18","arxiv_id":"2408.09403","n_code_links":0,"syntology":null},{"paper":null,"slug":"uncertainty-estimation-in-spatial","title":"Ensemble learning for predictive uncertainty estimation with application to the correction of satellite precipitation products","date":"2024-03-14","arxiv_id":"2403.10567","n_code_links":0,"syntology":null},{"paper":null,"slug":"machine-learning-for-uncertainty-estimation","title":"Uncertainty estimation of machine learning spatial precipitation predictions from satellite data","date":"2023-11-13","arxiv_id":"2311.07511","n_code_links":0,"syntology":null},{"paper":null,"slug":"density-matrix-emulation-of-quantum-recurrent","title":"Density Matrix Emulation of Quantum Recurrent Neural Networks for Multivariate Time Series Prediction","date":"2023-10-31","arxiv_id":"2310.20671","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-quantum-recurrent-reinforcement","title":"Efficient quantum recurrent reinforcement learning via quantum reservoir computing","date":"2023-09-13","arxiv_id":"2309.07339","n_code_links":0,"syntology":null},{"paper":"/paper/quantum-recurrent-neural-networks-for","slug":"quantum-recurrent-neural-networks-for","title":"Quantum Recurrent Neural Networks for Sequential Learning","date":"2023-02-07","arxiv_id":"2302.03244","n_code_links":1,"syntology":null},{"paper":null,"slug":"time-warping-invariant-quantum-recurrent","title":"Time-Warping Invariant Quantum Recurrent Neural Networks via Quantum-Classical Adaptive Gating","date":"2023-01-19","arxiv_id":"2301.08173","n_code_links":0,"syntology":null},{"paper":null,"slug":"reservoir-computing-via-quantum-recurrent","title":"Reservoir Computing via Quantum Recurrent Neural Networks","date":"2022-11-04","arxiv_id":"2211.02612","n_code_links":0,"syntology":null},{"paper":"/paper/rapid-training-of-quantum-recurrent-neural","slug":"rapid-training-of-quantum-recurrent-neural","title":"Rapid training of quantum recurrent neural networks","date":"2022-07-01","arxiv_id":"2207.00378","n_code_links":1,"syntology":null},{"paper":"/paper/tyolov5-a-temporal-yolov5-detector-based-on","slug":"tyolov5-a-temporal-yolov5-detector-based-on","title":"TYolov5: A Temporal Yolov5 Detector Based on Quasi-Recurrent Neural Networks for Real-Time Handgun Detection in Video","date":"2021-11-17","arxiv_id":"2111.08867","n_code_links":1,"syntology":null},{"paper":null,"slug":"cyber-threat-intelligence-for-secure-smart","title":"Cyber Threat Intelligence for Secure Smart City","date":"2020-07-26","arxiv_id":"2007.13233","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-formal-hierarchy-of-rnn-architectures","title":"A Formal Hierarchy of RNN Architectures","date":"2020-04-18","arxiv_id":"2004.08500","n_code_links":0,"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/dual-rectified-linear-units-drelus-a","slug":"dual-rectified-linear-units-drelus-a","title":"Dual Rectified Linear Units (DReLUs): A Replacement for Tanh Activation Functions in Quasi-Recurrent Neural Networks","date":"2017-07-25","arxiv_id":"1707.08214","n_code_links":2,"syntology":null},{"paper":"/paper/quasi-recurrent-neural-networks","slug":"quasi-recurrent-neural-networks","title":"Quasi-Recurrent Neural Networks","date":"2016-11-05","arxiv_id":"1611.01576","n_code_links":7,"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, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}}],"papers_shown":15,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":15,"with_a_code_link":5,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":15,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"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":1,"papers_where_code_ran_first_page":"/method/qrnn/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/qrnn/papers/ran/1","json":"/method/qrnn/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/time-series-prediction","name":"Time Series Prediction","papers":3},{"task":"/task/decision-making","name":"Decision Making","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/sentiment-analysis","name":"Sentiment Analysis","papers":2},{"task":"/task/sentiment-classification","name":"Sentiment Classification","papers":2},{"task":"/task/spatial-interpolation","name":"Spatial Interpolation","papers":2},{"task":"/task/time-series-1","name":"Time Series","papers":2},{"task":"/task/time-series","name":"Time Series Analysis","papers":2},{"task":"/task/quantile-regression","name":"quantile regression","papers":2},{"task":"/task/regression-1","name":"regression","papers":2},{"task":"/task/benchmarking","name":"Benchmarking","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/collision-avoidance","name":"Collision Avoidance","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/ensemble-learning","name":"Ensemble Learning","papers":1},{"task":"/task/feature-engineering","name":"Feature Engineering","papers":1},{"task":"/task/feature-importance","name":"Feature Importance","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/image-augmentation","name":"Image Augmentation","papers":1}],"tasks_shown":20,"n_tasks":34,"usage_by_year":[{"year":"2016","papers":1},{"year":"2017","papers":1},{"year":"2018","papers":1},{"year":"2020","papers":2},{"year":"2021","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":5},{"year":"2024","papers":2}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/qrnn"},"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=QRNN","read_at":"2026-10-05T01:00:49+00:00","query":"QRNN","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":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":1,"served":null,"leading_other_bearer":{"arxiv_id":"2601.03654","title":"Hybrid Quantum-Classical Ridgelet Neural Network for Portfolio Optimization","citations":null,"named_by":["acronym_expansion"],"bearer_name":"Quantum Ridgelet Neural Network (QRNN)","ask_with":"have('2601.03654')"},"n_other_bearers_listed":1,"note":"Nothing resolved to 'QRNN' by name, but 1 thing(s) here DECLARE that name -- most cited: 'Quantum Ridgelet Neural Network (QRNN)', a method in 'Hybrid Quantum-Classical Ridgelet Neural Network for Portfolio Optimization' (arXiv:2601.03654, citations not recorded). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is “Quantum Ridgelet Neural Network (QRNN)”, a method in the paper “Hybrid Quantum-Classical Ridgelet Neural Network for Portfolio Optimization” (arXiv:2601.03654, citations not recorded). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":["Quantum Ridgelet Neural Network (QRNN)"],"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":"e1b21745d61a8d041f844645a16c8679960714640bf1b7ee4429fcc1c9eb9760","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}