{"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/probabilistic-graph-rewiring-via-virtual","title":"Probabilistic Graph Rewiring via Virtual Nodes","arxiv_id":"2405.17311","date":"2024-05-27","proceeding":null,"authors":["Chendi Qian","Andrei Manolache","Christopher Morris","Mathias Niepert"],"abstract":"Message-passing graph neural networks (MPNNs) have emerged as a powerful paradigm for graph-based machine learning. Despite their effectiveness, MPNNs face challenges such as under-reaching and over-squashing, where limited receptive fields and structural bottlenecks hinder information flow in the graph. While graph transformers hold promise in addressing these issues, their scalability is limited due to quadratic complexity regarding the number of nodes, rendering them impractical for larger graphs. Here, we propose implicitly rewired message-passing neural networks (IPR-MPNNs), a novel approach that integrates implicit probabilistic graph rewiring into MPNNs. By introducing a small number of virtual nodes, i.e., adding additional nodes to a given graph and connecting them to existing nodes, in a differentiable, end-to-end manner, IPR-MPNNs enable long-distance message propagation, circumventing quadratic complexity. Theoretically, we demonstrate that IPR-MPNNs surpass the expressiveness of traditional MPNNs. Empirically, we validate our approach by showcasing its ability to mitigate under-reaching and over-squashing effects, achieving state-of-the-art performance across multiple graph datasets. Notably, IPR-MPNNs outperform graph transformers while maintaining significantly faster computational efficiency.","url_abs":"https://arxiv.org/abs/2405.17311v3","url_pdf":"https://arxiv.org/pdf/2405.17311v3.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":"probabilistic-graph-rewiring-via-virtual","repo_url":"https://github.com/chendiqian/IPR-MPNN","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2405.17311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17311"}},"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/chendiqian/IPR-MPNN","reach":{"status":"ok"}}],"summary":{"ran":4},"by_repo_kind":{"official":{"samples":4,"ran":4,"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":4,"samples":[{"code_sha256_prefix":"1d396b7d44cf37a4","entry":"get_graph_pooling","repo":"chendiqian/IPR-MPNN","repo_kind":"official","path":"models/nn_utils.py","file_url":"https://github.com/chendiqian/IPR-MPNN/blob/HEAD/models/nn_utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1d396b7d44cf37a4"}},{"code_sha256_prefix":"4f68e63a0759204e","entry":"inter_ensemble_pooling","repo":"chendiqian/IPR-MPNN","repo_kind":"official","path":"models/nn_utils.py","file_url":"https://github.com/chendiqian/IPR-MPNN/blob/HEAD/models/nn_utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4f68e63a0759204e"}},{"code_sha256_prefix":"fbe819589c89fc7a","entry":"residual","repo":"chendiqian/IPR-MPNN","repo_kind":"official","path":"models/nn_utils.py","file_url":"https://github.com/chendiqian/IPR-MPNN/blob/HEAD/models/nn_utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"fbe819589c89fc7a"}},{"code_sha256_prefix":"4607350a5f5ca695","entry":"sort_lexico","repo":"chendiqian/IPR-MPNN","repo_kind":"official","path":"models/auxloss.py","file_url":"https://github.com/chendiqian/IPR-MPNN/blob/HEAD/models/auxloss.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4607350a5f5ca695"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}