{"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/rethinking-propagation-for-unsupervised-graph","title":"Rethinking Propagation for Unsupervised Graph Domain Adaptation","arxiv_id":"2402.05660","date":"2024-02-08","proceeding":null,"authors":["Meihan Liu","Zeyu Fang","Zhen Zhang","Ming Gu","Sheng Zhou","Xin Wang","Jiajun Bu"],"abstract":"Unsupervised Graph Domain Adaptation (UGDA) aims to transfer knowledge from a labelled source graph to an unlabelled target graph in order to address the distribution shifts between graph domains. Previous works have primarily focused on aligning data from the source and target graph in the representation space learned by graph neural networks (GNNs). However, the inherent generalization capability of GNNs has been largely overlooked. Motivated by our empirical analysis, we reevaluate the role of GNNs in graph domain adaptation and uncover the pivotal role of the propagation process in GNNs for adapting to different graph domains. We provide a comprehensive theoretical analysis of UGDA and derive a generalization bound for multi-layer GNNs. By formulating GNN Lipschitz for k-layer GNNs, we show that the target risk bound can be tighter by removing propagation layers in source graph and stacking multiple propagation layers in target graph. Based on the empirical and theoretical analysis mentioned above, we propose a simple yet effective approach called A2GNN for graph domain adaptation. Through extensive experiments on real-world datasets, we demonstrate the effectiveness of our proposed A2GNN framework.","url_abs":"https://arxiv.org/abs/2402.05660v1","url_pdf":"https://arxiv.org/pdf/2402.05660v1.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":"rethinking-propagation-for-unsupervised-graph","repo_url":"https://github.com/meihan-liu/24aaai-a2gnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"graph-domain-adaptation","task_name":"GRAPH DOMAIN ADAPTATION"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2402.05660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05660"}},"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":"deterministic:regex_extraction","url":"https://github.com/yuntaodu/ASN","reach":null},{"provenance":"deterministic:regex_extraction","url":"https://github.com/Meihan-Liu/24AAAI-A2GNN","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/meihan-liu/24aaai-a2gnn","reach":{"status":"ok"}}],"summary":{"ran":3},"by_repo_kind":{"official":{"samples":1,"ran":1,"repositories":1},"found_in_text":{"samples":2,"ran":2,"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":3,"samples":[{"code_sha256_prefix":"edeab2d0c248f017","entry":"DomainDiscriminator","repo":"meihan-liu/24aaai-a2gnn","repo_kind":"official","path":"A2GNN-adv/layers.py","file_url":"https://github.com/meihan-liu/24aaai-a2gnn/blob/HEAD/A2GNN-adv/layers.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"edeab2d0c248f017"}},{"code_sha256_prefix":"45631a7bbd6520e3","entry":"GCN","repo":"yuntaodu/ASN","repo_kind":"found_in_text","path":"GCN_model.py","file_url":"https://github.com/yuntaodu/ASN/blob/HEAD/GCN_model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"45631a7bbd6520e3"}},{"code_sha256_prefix":"3c5a5e59b0c84eeb","entry":"GraphConvolution","repo":"yuntaodu/ASN","repo_kind":"found_in_text","path":"GCN_model.py","file_url":"https://github.com/yuntaodu/ASN/blob/HEAD/GCN_model.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":"3c5a5e59b0c84eeb"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}