{"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/adaptive-propagation-graph-convolutional","title":"Adaptive Propagation Graph Convolutional Network","arxiv_id":"2002.10306","date":"2020-02-24","proceeding":null,"authors":["Indro Spinelli","Simone Scardapane","Aurelio Uncini"],"abstract":"Graph convolutional networks (GCNs) are a family of neural network models that perform inference on graph data by interleaving vertex-wise operations and message-passing exchanges across nodes. Concerning the latter, two key questions arise: (i) how to design a differentiable exchange protocol (e.g., a 1-hop Laplacian smoothing in the original GCN), and (ii) how to characterize the trade-off in complexity with respect to the local updates. In this paper, we show that state-of-the-art results can be achieved by adapting the number of communication steps independently at every node. In particular, we endow each node with a halting unit (inspired by Graves' adaptive computation time) that after every exchange decides whether to continue communicating or not. We show that the proposed adaptive propagation GCN (AP-GCN) achieves superior or similar results to the best proposed models so far on a number of benchmarks, while requiring a small overhead in terms of additional parameters. We also investigate a regularization term to enforce an explicit trade-off between communication and accuracy. The code for the AP-GCN experiments is released as an open-source library.","url_abs":"https://arxiv.org/abs/2002.10306v3","url_pdf":"https://arxiv.org/pdf/2002.10306v3.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":"adaptive-propagation-graph-convolutional","repo_url":"https://github.com/spindro/AP-GCN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.10306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10306"}},"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/spindro/AP-GCN","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"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":"2b47e13833729e6e","entry":"create_subgraph","repo":"spindro/AP-GCN","repo_kind":"official","path":"sparsegraph.py","file_url":"https://github.com/spindro/AP-GCN/blob/HEAD/sparsegraph.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":"2b47e13833729e6e"}},{"code_sha256_prefix":"95c286604696f55a","entry":"gen_seeds","repo":"spindro/AP-GCN","repo_kind":"official","path":"seeds.py","file_url":"https://github.com/spindro/AP-GCN/blob/HEAD/seeds.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":"95c286604696f55a"}},{"code_sha256_prefix":"f696fb0f5b7895f8","entry":"largest_connected_components","repo":"spindro/AP-GCN","repo_kind":"official","path":"sparsegraph.py","file_url":"https://github.com/spindro/AP-GCN/blob/HEAD/sparsegraph.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":"f696fb0f5b7895f8"}},{"code_sha256_prefix":"fb4d68470e0d7707","entry":"normalize_attributes","repo":"spindro/AP-GCN","repo_kind":"official","path":"data.py","file_url":"https://github.com/spindro/AP-GCN/blob/HEAD/data.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":"fb4d68470e0d7707"}},{"code_sha256_prefix":"d22abf00bf0257bb","entry":"remove_self_loops","repo":"spindro/AP-GCN","repo_kind":"official","path":"sparsegraph.py","file_url":"https://github.com/spindro/AP-GCN/blob/HEAD/sparsegraph.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":"d22abf00bf0257bb"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}