{"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/decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","arxiv_id":"2201.07858","date":"2022-01-19","proceeding":"NeurIPS 2021 12","authors":["Hanqing Zeng","Muhan Zhang","Yinglong Xia","Ajitesh Srivastava","Andrey Malevich","Rajgopal Kannan","Viktor Prasanna","Long Jin","Ren Chen"],"abstract":"State-of-the-art Graph Neural Networks (GNNs) have limited scalability with respect to the graph and model sizes. On large graphs, increasing the model depth often means exponential expansion of the scope (i.e., receptive field). Beyond just a few layers, two fundamental challenges emerge: 1. degraded expressivity due to oversmoothing, and 2. expensive computation due to neighborhood explosion. We propose a design principle to decouple the depth and scope of GNNs -- to generate representation of a target entity (i.e., a node or an edge), we first extract a localized subgraph as the bounded-size scope, and then apply a GNN of arbitrary depth on top of the subgraph. A properly extracted subgraph consists of a small number of critical neighbors, while excluding irrelevant ones. The GNN, no matter how deep it is, smooths the local neighborhood into informative representation rather than oversmoothing the global graph into \"white noise\". Theoretically, decoupling improves the GNN expressive power from the perspectives of graph signal processing (GCN), function approximation (GraphSAGE) and topological learning (GIN). Empirically, on seven graphs (with up to 110M nodes) and six backbone GNN architectures, our design achieves significant accuracy improvement with orders of magnitude reduction in computation and hardware cost.","url_abs":"https://arxiv.org/abs/2201.07858v1","url_pdf":"https://arxiv.org/pdf/2201.07858v1.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":"decoupling-the-depth-and-scope-of-graph-1","repo_url":"https://github.com/facebookresearch/shaDow_GNN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-property-prediction","task_name":"Node Property Prediction"}],"methods":[{"method_slug":"gat","method_name":"GAT"},{"method_slug":"gcn","method_name":"GCN"},{"method_slug":"gin","method_name":"GIN"},{"method_slug":"graphsage","method_name":"GraphSAGE"},{"method_slug":"graphsaint","method_name":"GraphSAINT"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-reddit","task":"Node Classification","dataset":"Reddit","model":"shaDow-GAT","rank_in_archive_order":3,"of":16,"metrics":{"Accuracy":"97.13%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-reddit","task":"Node Classification","dataset":"Reddit","model":"shaDow-SAGE","rank_in_archive_order":4,"of":16,"metrics":{"Accuracy":"97.03%"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"SHADOW-GAT\n(PPR)","rank_in_archive_order":58,"of":86,"metrics":{"Ext. data":"No","Test Accuracy":"0.7274±0.0022"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-papers100m","task":"Node Property Prediction","dataset":"ogbn-papers100M","model":"shaDow-GAT","rank_in_archive_order":12,"of":20,"metrics":{"Ext. data":"No","Number of params":"4205544","Test Accuracy":"0.6708±0.0017","Validation Accuracy":"0.7073± 0.0011"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2201.07858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.07858"}},"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":"deterministic:regex_extraction","url":"https://github.com/facebookresearch/shaDow_GNN","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":2},"by_repo_kind":{"official":{"samples":2,"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":2,"samples":[{"code_sha256_prefix":"e0d2b6a64a4cf10e","entry":"get_torch_act","repo":"facebookresearch/shaDow_GNN","repo_kind":"official","path":"shaDow/layers.py","file_url":"https://github.com/facebookresearch/shaDow_GNN/blob/HEAD/shaDow/layers.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":false,"mcp_get_code":{"code_sha256":"e0d2b6a64a4cf10e"}},{"code_sha256_prefix":"00a1d935e26d9fd6","entry":"preprocess","repo":"facebookresearch/shaDow_GNN","repo_kind":"official","path":"shaDow/postproc_CnS.py","file_url":"https://github.com/facebookresearch/shaDow_GNN/blob/HEAD/shaDow/postproc_CnS.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":false,"mcp_get_code":{"code_sha256":"00a1d935e26d9fd6"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}