{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/greedy-infomax-for-biologically-plausible","title":"Putting An End to End-to-End: Gradient-Isolated Learning of Representations","arxiv_id":"1905.11786","date":"2019-05-28","proceeding":"NeurIPS 2019 12","authors":["Sindy Löwe","Peter O'Connor","Bastiaan S. Veeling"],"abstract":"We propose a novel deep learning method for local self-supervised representation learning that does not require labels nor end-to-end backpropagation but exploits the natural order in data instead. Inspired by the observation that biological neural networks appear to learn without backpropagating a global error signal, we split a deep neural network into a stack of gradient-isolated modules. Each module is trained to maximally preserve the information of its inputs using the InfoNCE bound from Oord et al. [2018]. Despite this greedy training, we demonstrate that each module improves upon the output of its predecessor, and that the representations created by the top module yield highly competitive results on downstream classification tasks in the audio and visual domain. The proposal enables optimizing modules asynchronously, allowing large-scale distributed training of very deep neural networks on unlabelled datasets.","url_abs":"https://arxiv.org/abs/1905.11786v3","url_pdf":"https://arxiv.org/pdf/1905.11786v3.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":"greedy-infomax-for-biologically-plausible","repo_url":"https://github.com/loeweX/Greedy_InfoMax","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"self-supervised-audio-classification","task_name":"Self-Supervised Audio Classification"},{"task_slug":"self-supervised-image-classification","task_name":"Self-Supervised Image Classification"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"feedforward-network","method_name":"Feedforward Network"},{"method_slug":"gru","method_name":"GRU"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"infonce","method_name":"InfoNCE"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-stl-10","task":"Image Classification","dataset":"STL-10","model":"Greedy InfoMax (GIM)","rank_in_archive_order":59,"of":117,"metrics":{"Percentage correct":"81.9"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1905.11786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11786"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/loeweX/Greedy_InfoMax","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_honours":1,"unverified":3},"by_repo_kind":{"official":{"samples":4,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"3f736c50902c4519","entry":"genOrthgonal","repo":"loeweX/Greedy_InfoMax","repo_kind":"official","path":"GreedyInfoMax/utils/model_utils.py","file_url":"https://github.com/loeweX/Greedy_InfoMax/blob/HEAD/GreedyInfoMax/utils/model_utils.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3f736c50902c4519"}},{"code_sha256_prefix":"fcdd3f17c00b4c2a","entry":"distribute_over_GPUs","repo":"loeweX/Greedy_InfoMax","repo_kind":"official","path":"GreedyInfoMax/utils/model_utils.py","file_url":"https://github.com/loeweX/Greedy_InfoMax/blob/HEAD/GreedyInfoMax/utils/model_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fcdd3f17c00b4c2a"}},{"code_sha256_prefix":"4788aa6d84fb2b52","entry":"reload_weights","repo":"loeweX/Greedy_InfoMax","repo_kind":"official","path":"GreedyInfoMax/utils/model_utils.py","file_url":"https://github.com/loeweX/Greedy_InfoMax/blob/HEAD/GreedyInfoMax/utils/model_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4788aa6d84fb2b52"}},{"code_sha256_prefix":"a039271bfdab388d","entry":"val_by_InfoNCELoss","repo":"loeweX/Greedy_InfoMax","repo_kind":"official","path":"GreedyInfoMax/audio/validation/val_by_InfoNCELoss.py","file_url":"https://github.com/loeweX/Greedy_InfoMax/blob/HEAD/GreedyInfoMax/audio/validation/val_by_InfoNCELoss.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a039271bfdab388d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}