{"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/rsu-benes-block","slug":"rsu-benes-block","name":"RSU Beneš Block","full_name":"Beneš Block with Residual Switch Units","full_name_withheld":false,"description_markdown":"The **Beneš block** is a computation-efficient alternative to dense attention, enabling the modelling of long-range dependencies in O(n log n) time. In comparison, dense attention which is commonly used in Transformers has O(n^2) complexity.\r\n\r\nIn music, dependencies occur on several scales, including on a coarse scale which requires processing very long sequences. Beneš blocks have been used in Residual Shuffle-Exchange Networks to achieve state-of-the-art results in music transcription.\r\n\r\nBeneš blocks have a ‘receptive field’ of the size of the whole sequence, and it has no bottleneck. These properties hold for dense attention but have not been shown for many sparse attention and dilated convolutional architectures.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Residual Shuffle-Exchange Networks for Fast Processing of Long Sequences","paper":"/paper/residual-shuffle-exchange-networks-for-fast","first_author":"Andis Draguns","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/residual-shuffle-exchange-networks-for-fast"},"source":{"url":"https://arxiv.org/abs/2004.04662v4","title":"Residual Shuffle-Exchange Networks for Fast Processing of Long Sequences","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Audio","area_id":"audio","collection":"Audio Model Blocks","url":"/methods/category/audio-model-blocks","pwc_aliases":[]}],"n_papers_tagged":5,"archive_num_papers":5,"papers_newest_first":[{"paper":null,"slug":"nash-equilibrium-between-consumer-electronic","title":"Nash Equilibrium Between Consumer Electronic Devices and DoS Attacker for Distributed IoT-enabled RSE Systems","date":"2025-04-13","arxiv_id":"2504.09415","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-radius-of-statistical-efficiency","title":"The radius of statistical efficiency","date":"2024-05-15","arxiv_id":"2405.09676","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-multi-modal-machine-learning-approach-to","title":"A Multi-Modal Machine Learning Approach to Detect Extreme Rainfall Events in Sicily","date":"2022-12-14","arxiv_id":"2212.08102","n_code_links":0,"syntology":null},{"paper":null,"slug":"attack-resilient-state-estimation-with","title":"Attack-Resilient State Estimation with Intermittent Data Authentication","date":"2020-05-16","arxiv_id":"2005.08122","n_code_links":0,"syntology":null},{"paper":"/paper/residual-shuffle-exchange-networks-for-fast","slug":"residual-shuffle-exchange-networks-for-fast","title":"Residual Shuffle-Exchange Networks for Fast Processing of Long Sequences","date":"2020-04-06","arxiv_id":"2004.04662","n_code_links":2,"syntology":null}],"papers_shown":5,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":5,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":5,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/state-estimation","name":"State Estimation","papers":2},{"task":"/task/lambada","name":"LAMBADA","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/matrix-completion","name":"Matrix Completion","papers":1},{"task":"/task/music-transcription","name":"Music Transcription","papers":1},{"task":"/task/q-learning","name":"Q-Learning","papers":1},{"task":"/task/retrieval","name":"Retrieval","papers":1}],"tasks_shown":7,"n_tasks":7,"usage_by_year":[{"year":"2020","papers":2},{"year":"2022","papers":1},{"year":"2024","papers":1},{"year":"2025","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/rsu-benes-block"},"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=RSU%20Bene%C5%A1%20Block","read_at":"2026-10-05T01:01:26+00:00","query":"RSU Beneš Block","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":"2004.04662","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'RSU Beneš Block' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"dd4a45a5e24403a75dfe02eb5411a9af04c835ae6e54d10274f8ddc009e7ccf5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}