{"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/pushnet-efficient-and-adaptive-neural-message","title":"PushNet: Efficient and Adaptive Neural Message Passing","arxiv_id":"2003.02228","date":"2020-03-04","proceeding":null,"authors":["Julian Busch","Jiaxing Pi","Thomas Seidl"],"abstract":"Message passing neural networks have recently evolved into a state-of-the-art approach to representation learning on graphs. Existing methods perform synchronous message passing along all edges in multiple subsequent rounds and consequently suffer from various shortcomings: Propagation schemes are inflexible since they are restricted to $k$-hop neighborhoods and insensitive to actual demands of information propagation. Further, long-range dependencies cannot be modeled adequately and learned representations are based on correlations of fixed locality. These issues prevent existing methods from reaching their full potential in terms of prediction performance. Instead, we consider a novel asynchronous message passing approach where information is pushed only along the most relevant edges until convergence. Our proposed algorithm can equivalently be formulated as a single synchronous message passing iteration using a suitable neighborhood function, thus sharing the advantages of existing methods while addressing their central issues. The resulting neural network utilizes a node-adaptive receptive field derived from meaningful sparse node neighborhoods. In addition, by learning and combining node representations over differently sized neighborhoods, our model is able to capture correlations on multiple scales. We further propose variants of our base model with different inductive bias. Empirical results are provided for semi-supervised node classification on five real-world datasets following a rigorous evaluation protocol. We find that our models outperform competitors on all datasets in terms of accuracy with statistical significance. In some cases, our models additionally provide faster runtime.","url_abs":"https://arxiv.org/abs/2003.02228v4","url_pdf":"https://arxiv.org/pdf/2003.02228v4.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":"pushnet-efficient-and-adaptive-neural-message","repo_url":"https://github.com/buschju/pushnet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"inductive-bias","task_name":"Inductive Bias"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2003.02228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02228"}},"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/buschju/pushnet","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":7},"by_repo_kind":{"official":{"samples":7,"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":"03b3243eaff8a95c","entry":"evaluate_model","repo":"buschju/pushnet","repo_kind":"official","path":"src/training.py","file_url":"https://github.com/buschju/pushnet/blob/HEAD/src/training.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":"03b3243eaff8a95c"}},{"code_sha256_prefix":"613d60256d9e04fc","entry":"flatten_dictionary","repo":"buschju/pushnet","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/buschju/pushnet/blob/HEAD/src/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":"613d60256d9e04fc"}},{"code_sha256_prefix":"ca86a40ede8d9a7f","entry":"get_preprocessed_path","repo":"buschju/pushnet","repo_kind":"official","path":"src/data_utils.py","file_url":"https://github.com/buschju/pushnet/blob/HEAD/src/data_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":"ca86a40ede8d9a7f"}},{"code_sha256_prefix":"3e95ac42238a2d04","entry":"load_adj","repo":"buschju/pushnet","repo_kind":"official","path":"src/data_utils.py","file_url":"https://github.com/buschju/pushnet/blob/HEAD/src/data_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":"3e95ac42238a2d04"}},{"code_sha256_prefix":"dba42869fc139e4a","entry":"load_ppr","repo":"buschju/pushnet","repo_kind":"official","path":"src/data_utils.py","file_url":"https://github.com/buschju/pushnet/blob/HEAD/src/data_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":"dba42869fc139e4a"}},{"code_sha256_prefix":"45d23b9fb662e6cd","entry":"train_random_splits","repo":"buschju/pushnet","repo_kind":"official","path":"src/training.py","file_url":"https://github.com/buschju/pushnet/blob/HEAD/src/training.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":"45d23b9fb662e6cd"}},{"code_sha256_prefix":"4da72336053bb605","entry":"train_single_split","repo":"buschju/pushnet","repo_kind":"official","path":"src/training.py","file_url":"https://github.com/buschju/pushnet/blob/HEAD/src/training.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":"4da72336053bb605"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}