{"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/gradient-gating-for-deep-multi-rate-learning","title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","arxiv_id":"2210.00513","date":"2022-10-02","proceeding":null,"authors":["T. Konstantin Rusch","Benjamin P. Chamberlain","Michael W. Mahoney","Michael M. Bronstein","Siddhartha Mishra"],"abstract":"We present Gradient Gating (G$^2$), a novel framework for improving the performance of Graph Neural Networks (GNNs). Our framework is based on gating the output of GNN layers with a mechanism for multi-rate flow of message passing information across nodes of the underlying graph. Local gradients are harnessed to further modulate message passing updates. Our framework flexibly allows one to use any basic GNN layer as a wrapper around which the multi-rate gradient gating mechanism is built. We rigorously prove that G$^2$ alleviates the oversmoothing problem and allows the design of deep GNNs. Empirical results are presented to demonstrate that the proposed framework achieves state-of-the-art performance on a variety of graph learning tasks, including on large-scale heterophilic graphs.","url_abs":"https://arxiv.org/abs/2210.00513v2","url_pdf":"https://arxiv.org/pdf/2210.00513v2.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":"gradient-gating-for-deep-multi-rate-learning","repo_url":"https://github.com/tk-rusch/gradientgating","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-arxiv-year","task":"Node Classification","dataset":"arXiv-year","model":"G^2-GraphSAGE","rank_in_archive_order":4,"of":12,"metrics":{"Accuracy":"63.30±1.84"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-genius","task":"Node Classification","dataset":"genius","model":"G^2-GraphSAGE","rank_in_archive_order":7,"of":26,"metrics":{"Accuracy":"90.85±0.64"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2210.00513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00513"}},"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/tk-rusch/gradientgating","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"ran":0,"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":"43c3683988baee08","entry":"get_data","repo":"tk-rusch/gradientgating","repo_kind":"official","path":"heterophilic_graphs/data_handling.py","file_url":"https://github.com/tk-rusch/gradientgating/blob/HEAD/heterophilic_graphs/data_handling.py","link_basis":"harvester_set","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":"43c3683988baee08"}},{"code_sha256_prefix":"9b8779fbea15921c","entry":"get_data","repo":"tk-rusch/gradientgating","repo_kind":"official","path":"node_regression/data_handling.py","file_url":"https://github.com/tk-rusch/gradientgating/blob/HEAD/node_regression/data_handling.py","link_basis":"harvester_set","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":"9b8779fbea15921c"}},{"code_sha256_prefix":"e6b0462c472c3407","entry":"get_data","repo":"tk-rusch/gradientgating","repo_kind":"official","path":"synthetic_cora/data_handling.py","file_url":"https://github.com/tk-rusch/gradientgating/blob/HEAD/synthetic_cora/data_handling.py","link_basis":"harvester_set","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":"e6b0462c472c3407"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}