{"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/reversible-residual-block","slug":"reversible-residual-block","name":"Reversible Residual Block","full_name":"Reversible Residual Block","full_name_withheld":false,"description_markdown":"**Reversible Residual Blocks** are skip-connection blocks that learn *reversible* residual functions with reference to the layer inputs. It is proposed as part of the [RevNet](https://paperswithcode.com/method/revnet) CNN architecture. Units in each layer are partitioned into two groups, denoted $x\\_{1}$ and $x\\_{2}$; the authors find what works best is partitioning the channels. Each reversible block takes inputs $\\left(x\\_{1}, x\\_{2}\\right)$ and produces outputs $\\left(y\\_{1}, y\\_{2}\\right)$ according to the following additive coupling rules – inspired by the transformation in [NICE](https://paperswithcode.com/method/nice) (nonlinear independent components estimation) – and residual functions $F$ and $G$ analogous to those in standard [ResNets](https://paperswithcode.com/method/resnet):\r\n\r\n$$y\\_{1} = x\\_{1} + F\\left(x\\_{2}\\right)$$\r\n$$y\\_{2} = x\\_{2} + G\\left(y\\_{1}\\right)$$\r\n\r\nEach layer’s activations can be reconstructed from the next layer’s activations as follows:\r\n\r\n$$ x\\_{2} = y\\_{2} − G\\left(y\\_{1}\\right)$$\r\n$$ x\\_{1} = y\\_{1} − F\\left(x\\_{2}\\right)$$","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/1707.04585v1","title":"The Reversible Residual Network: Backpropagation Without Storing Activations","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/osmr/imgclsmob/blob/68335927ba27f2356093b985bada0bc3989836b1/pytorch/pytorchcv/models/revnet.py#L99","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Skip Connection Blocks","url":"/methods/category/skip-connection-blocks","pwc_aliases":[]}],"n_papers_tagged":29,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/cardioformer-advancing-ai-in-ecg-analysis","slug":"cardioformer-advancing-ai-in-ecg-analysis","title":"Cardioformer: Advancing AI in ECG Analysis with Multi-Granularity Patching and ResNet","date":"2025-05-08","arxiv_id":"2505.05538","n_code_links":1,"syntology":null},{"paper":null,"slug":"fast-powerformer-a-memory-efficient","title":"Fast-Powerformer: A Memory-Efficient Transformer for Accurate Mid-Term Wind Power Forecasting","date":"2025-04-15","arxiv_id":"2504.10923","n_code_links":0,"syntology":null},{"paper":null,"slug":"reformer-generating-radio-fakes-for-data","title":"ReFormer: Generating Radio Fakes for Data Augmentation","date":"2024-12-31","arxiv_id":"2501.00282","n_code_links":0,"syntology":null},{"paper":null,"slug":"glmha-a-guided-low-rank-multi-head-self","title":"GLMHA A Guided Low-rank Multi-Head Self-Attention for Efficient Image Restoration and Spectral Reconstruction","date":"2024-10-01","arxiv_id":"2410.00380","n_code_links":0,"syntology":null},{"paper":null,"slug":"masked-face-recognition-with-generative-to","title":"Masked Face Recognition with Generative-to-Discriminative Representations","date":"2024-05-27","arxiv_id":"2405.16761","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-transformer-based-approach-for-soil","title":"A novel transformer-based approach for soil temperature prediction","date":"2023-11-20","arxiv_id":"2311.11626","n_code_links":0,"syntology":null},{"paper":"/paper/diffusion-models-beat-gans-on-image","slug":"diffusion-models-beat-gans-on-image","title":"Diffusion Models Beat GANs on Image Classification","date":"2023-07-17","arxiv_id":"2307.08702","n_code_links":1,"syntology":null},{"paper":null,"slug":"legalrelectra-mixed-domain-language-modeling","title":"LegalRelectra: Mixed-domain Language Modeling for Long-range Legal Text Comprehension","date":"2022-12-16","arxiv_id":"2212.08204","n_code_links":0,"syntology":null},{"paper":"/paper/fecam-frequency-enhanced-channel-attention","slug":"fecam-frequency-enhanced-channel-attention","title":"FECAM: Frequency Enhanced Channel Attention Mechanism for Time Series Forecasting","date":"2022-12-02","arxiv_id":"2212.01209","n_code_links":1,"syntology":null},{"paper":"/paper/non-stationary-transformers-rethinking-the","slug":"non-stationary-transformers-rethinking-the","title":"Non-stationary Transformers: Exploring the Stationarity in Time Series Forecasting","date":"2022-05-28","arxiv_id":"2205.14415","n_code_links":2,"syntology":null},{"paper":"/paper/conditional-injective-flows-for-bayesian","slug":"conditional-injective-flows-for-bayesian","title":"Conditional Injective Flows for Bayesian Imaging","date":"2022-04-15","arxiv_id":"2204.07664","n_code_links":1,"syntology":null},{"paper":null,"slug":"discovering-material-information-using","title":"Discovering material information using hierarchical Reformer model on financial regulatory filings","date":"2022-03-28","arxiv_id":"2204.05979","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-token-normalization-improves-vision-1","slug":"dynamic-token-normalization-improves-vision-1","title":"Dynamic Token Normalization Improves Vision Transformers","date":"2021-12-05","arxiv_id":"2112.02624","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","official":{"repos":["wqshao126/dtn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/level-set-learning-with-pseudo-reversible","slug":"level-set-learning-with-pseudo-reversible","title":"Level set learning with pseudo-reversible neural networks for nonlinear dimension reduction in function approximation","date":"2021-12-02","arxiv_id":"2112.01438","n_code_links":2,"syntology":null},{"paper":"/paper/end-to-end-user-behavior-retrieval-in-click","slug":"end-to-end-user-behavior-retrieval-in-click","title":"End-to-End User Behavior Retrieval in Click-Through RatePrediction Model","date":"2021-08-10","arxiv_id":"2108.04468","n_code_links":1,"syntology":null},{"paper":"/paper/reformer-the-relational-transformer-for-image","slug":"reformer-the-relational-transformer-for-image","title":"ReFormer: The Relational Transformer for Image Captioning","date":"2021-07-29","arxiv_id":"2107.14178","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-split-reversible-transformers-can","title":"Multi-split Reversible Transformers Can Enhance Neural Machine Translation","date":"2021-04-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"a-practical-survey-on-faster-and-lighter","title":"A Practical Survey on Faster and Lighter Transformers","date":"2021-03-26","arxiv_id":"2103.14636","n_code_links":0,"syntology":null},{"paper":null,"slug":"reassert-deep-learning-for-assert-generation","title":"ReAssert: Deep Learning for Assert Generation","date":"2020-11-19","arxiv_id":"2011.09784","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-unknot","title":"Learning to Unknot","date":"2020-10-28","arxiv_id":"2010.16263","n_code_links":0,"syntology":null},{"paper":null,"slug":"robustification-of-segmentation-models","title":"Robustification of Segmentation Models Against Adversarial Perturbations In Medical Imaging","date":"2020-09-23","arxiv_id":"2009.11090","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-transformers-a-survey","title":"Efficient Transformers: A Survey","date":"2020-09-14","arxiv_id":"2009.06732","n_code_links":0,"syntology":null},{"paper":"/paper/big-gans-are-watching-you-towards","slug":"big-gans-are-watching-you-towards","title":"Object Segmentation Without Labels with Large-Scale Generative Models","date":"2020-06-08","arxiv_id":"2006.04988","n_code_links":1,"syntology":null},{"paper":"/paper/neural-machine-translation-with-joint","slug":"neural-machine-translation-with-joint","title":"Neural Machine Translation with Joint Representation","date":"2020-02-16","arxiv_id":"2002.06546","n_code_links":1,"syntology":null},{"paper":null,"slug":"reconstructing-natural-scenes-from-fmri","title":"Reconstructing Natural Scenes from fMRI Patterns using BigBiGAN","date":"2020-01-31","arxiv_id":"2001.11761","n_code_links":0,"syntology":null},{"paper":"/paper/reformer-the-efficient-transformer-1","slug":"reformer-the-efficient-transformer-1","title":"Reformer: The Efficient Transformer","date":"2020-01-13","arxiv_id":"2001.04451","n_code_links":10,"syntology":{"ran":6,"of":8,"n_ran_checked":1,"n_instrument":5,"unverified":2,"pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","official":{"repos":["google/trax"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/large-scale-adversarial-representation","slug":"large-scale-adversarial-representation","title":"Large Scale Adversarial Representation Learning","date":"2019-07-04","arxiv_id":"1907.02544","n_code_links":4,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":null,"slug":"beyond-finite-layer-neural-networks-bridging","title":"Beyond Finite Layer Neural Networks: Bridging Deep Architectures and Numerical Differential Equations","date":"2017-10-27","arxiv_id":"1710.10121","n_code_links":0,"syntology":null},{"paper":"/paper/the-reversible-residual-network","slug":"the-reversible-residual-network","title":"The Reversible Residual Network: Backpropagation Without Storing Activations","date":"2017-07-14","arxiv_id":"1707.04585","n_code_links":9,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["renmengye/revnet-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}],"papers_shown":29,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":29,"with_a_code_link":14,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":29,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"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":4,"papers_where_code_ran_first_page":"/method/reversible-residual-block/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/reversible-residual-block/papers/ran/1","json":"/method/reversible-residual-block/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":3},{"task":"/task/image-generation","name":"Image Generation","papers":3},{"task":"/task/image-classification","name":"image-classification","papers":3},{"task":"/task/attribute","name":"Attribute","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":2},{"task":"/task/image-restoration","name":"Image Restoration","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/machine-translation","name":"Machine Translation","papers":2},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":2},{"task":"/task/segmentation","name":"Segmentation","papers":2},{"task":"/task/sentence","name":"Sentence","papers":2},{"task":"/task/survey","name":"Survey","papers":2},{"task":"/task/time-series-1","name":"Time Series","papers":2},{"task":"/task/time-series","name":"Time Series Analysis","papers":2},{"task":"/task/time-series-forecasting","name":"Time Series Forecasting","papers":2},{"task":"/task/translation","name":"Translation","papers":2},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/binary-classification","name":"Binary Classification","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/click-through-rate-prediction","name":"Click-Through Rate Prediction","papers":1}],"tasks_shown":20,"n_tasks":74,"usage_by_year":[{"year":"2017","papers":2},{"year":"2019","papers":1},{"year":"2020","papers":8},{"year":"2021","papers":6},{"year":"2022","papers":5},{"year":"2023","papers":2},{"year":"2024","papers":3},{"year":"2025","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/reversible-residual-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=Reversible%20Residual%20Block","read_at":"2026-10-05T01:01:14+00:00","query":"Reversible Residual 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":null,"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 'Reversible Residual 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":["Reversible Residual Normalization (RRN)","Residual-MII","Residual-ICM","Residual SODAP","Ladder-Residual","Residual Paving","Residual Algebra","horizon residual"],"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":"3c72ba26e4d86ca38443b1ae4ae96566d3b9018e0f600168a4de0a49bed029f6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}