{"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/nodemixup-tackling-under-reaching-for-graph","title":"NodeMixup: Tackling Under-Reaching for Graph Neural Networks","arxiv_id":"2312.13032","date":"2023-12-20","proceeding":null,"authors":["Weigang Lu","Ziyu Guan","Wei Zhao","Yaming Yang","Long Jin"],"abstract":"Graph Neural Networks (GNNs) have become mainstream methods for solving the semi-supervised node classification problem. However, due to the uneven location distribution of labeled nodes in the graph, labeled nodes are only accessible to a small portion of unlabeled nodes, leading to the \\emph{under-reaching} issue. In this study, we firstly reveal under-reaching by conducting an empirical investigation on various well-known graphs. Then, we demonstrate that under-reaching results in unsatisfactory distribution alignment between labeled and unlabeled nodes through systematic experimental analysis, significantly degrading GNNs' performance. To tackle under-reaching for GNNs, we propose an architecture-agnostic method dubbed NodeMixup. The fundamental idea is to (1) increase the reachability of labeled nodes by labeled-unlabeled pairs mixup, (2) leverage graph structures via fusing the neighbor connections of intra-class node pairs to improve performance gains of mixup, and (3) use neighbor label distribution similarity incorporating node degrees to determine sampling weights for node mixup. Extensive experiments demonstrate the efficacy of NodeMixup in assisting GNNs in handling under-reaching. The source code is available at \\url{https://github.com/WeigangLu/NodeMixup}.","url_abs":"https://arxiv.org/abs/2312.13032v2","url_pdf":"https://arxiv.org/pdf/2312.13032v2.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":"nodemixup-tackling-under-reaching-for-graph","repo_url":"https://github.com/weiganglu/nodemixup","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2312.13032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13032"}},"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/weiganglu/nodemixup","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":6,"ran_draft_wrong":1},"by_repo_kind":{"official":{"samples":7,"ran":7,"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":"01fe608f304f43c8","entry":"Accuracy","repo":"weiganglu/nodemixup","repo_kind":"official","path":"utils.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"01fe608f304f43c8"}},{"code_sha256_prefix":"cea0e3de8fd3ce1e","entry":"Cross_entropy_loss","repo":"weiganglu/nodemixup","repo_kind":"official","path":"utils.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cea0e3de8fd3ce1e"}},{"code_sha256_prefix":"463f1b1322eb1a81","entry":"cosine_similarity_matrix","repo":"weiganglu/nodemixup","repo_kind":"official","path":"mixer.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/mixer.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"463f1b1322eb1a81"}},{"code_sha256_prefix":"da80a2b9fd449bd2","entry":"index_to_mask","repo":"weiganglu/nodemixup","repo_kind":"official","path":"dataset.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/dataset.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"code_sha256_prefix":"7a3d133bfad4e522","entry":"random_splits","repo":"weiganglu/nodemixup","repo_kind":"official","path":"dataset.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/dataset.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7a3d133bfad4e522"}},{"code_sha256_prefix":"91e85d5760e9546f","entry":"random_splits_CS","repo":"weiganglu/nodemixup","repo_kind":"official","path":"dataset.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/dataset.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"91e85d5760e9546f"}},{"code_sha256_prefix":"05a6e0bd80de935b","entry":"sharpen","repo":"weiganglu/nodemixup","repo_kind":"official","path":"utils.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"05a6e0bd80de935b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}