{"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/nosmog-learning-noise-robust-and-structure","title":"NOSMOG: Learning Noise-robust and Structure-aware MLPs on Graphs","arxiv_id":"2208.10010","date":"2022-08-22","proceeding":null,"authors":["Yijun Tian","Chuxu Zhang","Zhichun Guo","Xiangliang Zhang","Nitesh V. Chawla"],"abstract":"While Graph Neural Networks (GNNs) have demonstrated their efficacy in dealing with non-Euclidean structural data, they are difficult to be deployed in real applications due to the scalability constraint imposed by multi-hop data dependency. Existing methods attempt to address this scalability issue by training multi-layer perceptrons (MLPs) exclusively on node content features using labels derived from trained GNNs. Even though the performance of MLPs can be significantly improved, two issues prevent MLPs from outperforming GNNs and being used in practice: the ignorance of graph structural information and the sensitivity to node feature noises. In this paper, we propose to learn NOise-robust Structure-aware MLPs On Graphs (NOSMOG) to overcome the challenges. Specifically, we first complement node content with position features to help MLPs capture graph structural information. We then design a novel representational similarity distillation strategy to inject structural node similarities into MLPs. Finally, we introduce the adversarial feature augmentation to ensure stable learning against feature noises and further improve performance. Extensive experiments demonstrate that NOSMOG outperforms GNNs and the state-of-the-art method in both transductive and inductive settings across seven datasets, while maintaining a competitive inference efficiency. Codes are available at https://github.com/meettyj/NOSMOG.","url_abs":"https://arxiv.org/abs/2208.10010v2","url_pdf":"https://arxiv.org/pdf/2208.10010v2.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":"nosmog-learning-noise-robust-and-structure","repo_url":"https://github.com/meettyj/nosmog","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"nosmog-learning-noise-robust-and-structure","repo_url":"https://github.com/rufaim/routing-by-memory","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2208.10010","atlas_url":"https://app.syntology.ai/?focus=2208.10010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10010"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/meettyj/NOSMOG","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/meettyj/nosmog","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/rufaim/routing-by-memory","reach":null}],"summary":{"ran":3,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"listed":{"samples":5,"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":0,"samples":[{"code_sha256_prefix":"2b2af13772d022f7","entry":"BatchNorm1dBypassWrapper","repo":"rufaim/routing-by-memory","repo_kind":"listed","path":"models.py","file_url":"https://github.com/rufaim/routing-by-memory/blob/HEAD/models.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":"2b2af13772d022f7"}},{"code_sha256_prefix":"7aeeb36e30080680","entry":"Dispatcher","repo":"rufaim/routing-by-memory","repo_kind":"listed","path":"models.py","file_url":"https://github.com/rufaim/routing-by-memory/blob/HEAD/models.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":"7aeeb36e30080680"}},{"code_sha256_prefix":"4ca0fe0732be42d0","entry":"RbMLayer","repo":"rufaim/routing-by-memory","repo_kind":"listed","path":"models.py","file_url":"https://github.com/rufaim/routing-by-memory/blob/HEAD/models.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":"4ca0fe0732be42d0"}},{"code_sha256_prefix":"48775a7d3313bb98","entry":"cv_squared","repo":"rufaim/routing-by-memory","repo_kind":"listed","path":"models.py","file_url":"https://github.com/rufaim/routing-by-memory/blob/HEAD/models.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"48775a7d3313bb98"}},{"code_sha256_prefix":"e068740132bfa99f","entry":"RbM","repo":"rufaim/routing-by-memory","repo_kind":"listed","path":"models.py","file_url":"https://github.com/rufaim/routing-by-memory/blob/HEAD/models.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":"e068740132bfa99f"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}