{"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/empowering-dual-level-graph-self-supervised","title":"Empowering Dual-Level Graph Self-Supervised Pretraining with Motif Discovery","arxiv_id":"2312.11927","date":"2023-12-19","proceeding":null,"authors":["Pengwei Yan","Kaisong Song","Zhuoren Jiang","Yangyang Kang","Tianqianjin Lin","Changlong Sun","Xiaozhong Liu"],"abstract":"While self-supervised graph pretraining techniques have shown promising results in various domains, their application still experiences challenges of limited topology learning, human knowledge dependency, and incompetent multi-level interactions. To address these issues, we propose a novel solution, Dual-level Graph self-supervised Pretraining with Motif discovery (DGPM), which introduces a unique dual-level pretraining structure that orchestrates node-level and subgraph-level pretext tasks. Unlike prior approaches, DGPM autonomously uncovers significant graph motifs through an edge pooling module, aligning learned motif similarities with graph kernel-based similarities. A cross-matching task enables sophisticated node-motif interactions and novel representation learning. Extensive experiments on 15 datasets validate DGPM's effectiveness and generalizability, outperforming state-of-the-art methods in unsupervised representation learning and transfer learning settings. The autonomously discovered motifs demonstrate the potential of DGPM to enhance robustness and interpretability.","url_abs":"https://arxiv.org/abs/2312.11927v1","url_pdf":"https://arxiv.org/pdf/2312.11927v1.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":"empowering-dual-level-graph-self-supervised","repo_url":"https://github.com/rocccyan/dgpm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2312.11927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.11927"}},"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/rocccyan/dgpm","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":6,"unverified":1},"by_repo_kind":{"official":{"samples":7,"ran":6,"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":"4ed73f40f210983b","entry":"cat_matching_loss","repo":"rocccyan/dgpm","repo_kind":"official","path":"pretrain/models.py","file_url":"https://github.com/rocccyan/dgpm/blob/HEAD/pretrain/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":"4ed73f40f210983b"}},{"code_sha256_prefix":"2f3619ca3da06aa7","entry":"freq_loss_fn","repo":"rocccyan/dgpm","repo_kind":"official","path":"MotiFiesta/src/distributed_sampling.py","file_url":"https://github.com/rocccyan/dgpm/blob/HEAD/MotiFiesta/src/distributed_sampling.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":"2f3619ca3da06aa7"}},{"code_sha256_prefix":"e4646fb743d40f78","entry":"get_gnn_layer","repo":"rocccyan/dgpm","repo_kind":"official","path":"baselines/models.py","file_url":"https://github.com/rocccyan/dgpm/blob/HEAD/baselines/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":"e4646fb743d40f78"}},{"code_sha256_prefix":"2784049bf98582f4","entry":"matching_loss","repo":"rocccyan/dgpm","repo_kind":"official","path":"pretrain/models.py","file_url":"https://github.com/rocccyan/dgpm/blob/HEAD/pretrain/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":"2784049bf98582f4"}},{"code_sha256_prefix":"ea1176be99c145cd","entry":"matrix_cosine","repo":"rocccyan/dgpm","repo_kind":"official","path":"MotiFiesta/src/distributed_sampling.py","file_url":"https://github.com/rocccyan/dgpm/blob/HEAD/MotiFiesta/src/distributed_sampling.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":"ea1176be99c145cd"}},{"code_sha256_prefix":"13b43956feca1602","entry":"matrix_similarity","repo":"rocccyan/dgpm","repo_kind":"official","path":"pretrain/models.py","file_url":"https://github.com/rocccyan/dgpm/blob/HEAD/pretrain/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":"13b43956feca1602"}},{"code_sha256_prefix":"fef85146b508b2e7","entry":"collate_fn","repo":"rocccyan/dgpm","repo_kind":"official","path":"MotiFiesta/src/loading.py","file_url":"https://github.com/rocccyan/dgpm/blob/HEAD/MotiFiesta/src/loading.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":"fef85146b508b2e7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}