{"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/graph-self-supervised-learning-with-accurate","title":"Graph Self-supervised Learning with Accurate Discrepancy Learning","arxiv_id":"2202.02989","date":"2022-02-07","proceeding":null,"authors":["DongKi Kim","Jinheon Baek","Sung Ju Hwang"],"abstract":"Self-supervised learning of graph neural networks (GNNs) aims to learn an accurate representation of the graphs in an unsupervised manner, to obtain transferable representations of them for diverse downstream tasks. Predictive learning and contrastive learning are the two most prevalent approaches for graph self-supervised learning. However, they have their own drawbacks. While the predictive learning methods can learn the contextual relationships between neighboring nodes and edges, they cannot learn global graph-level similarities. Contrastive learning, while it can learn global graph-level similarities, its objective to maximize the similarity between two differently perturbed graphs may result in representations that cannot discriminate two similar graphs with different properties. To tackle such limitations, we propose a framework that aims to learn the exact discrepancy between the original and the perturbed graphs, coined as Discrepancy-based Self-supervised LeArning (D-SLA). Specifically, we create multiple perturbations of the given graph with varying degrees of similarity, and train the model to predict whether each graph is the original graph or the perturbed one. Moreover, we further aim to accurately capture the amount of discrepancy for each perturbed graph using the graph edit distance. We validate our D-SLA on various graph-related downstream tasks, including molecular property prediction, protein function prediction, and link prediction tasks, on which ours largely outperforms relevant baselines.","url_abs":"https://arxiv.org/abs/2202.02989v5","url_pdf":"https://arxiv.org/pdf/2202.02989v5.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":"graph-self-supervised-learning-with-accurate","repo_url":"https://github.com/dongkikim95/d-sla","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"contrastive-learning","task_name":"Contrastive Learning"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"molecular-property-prediction","task_name":"Molecular Property Prediction"},{"task_slug":"property-prediction","task_name":"Property Prediction"},{"task_slug":"protein-function-prediction","task_name":"Protein Function Prediction"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"}],"methods":[{"method_slug":"contrastive-learning","method_name":"Contrastive Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2202.02989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02989"}},"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/dongkikim95/d-sla","reach":null}],"summary":{"ran":1,"ran_honours":1,"unverified":1},"by_repo_kind":{"official":{"samples":3,"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":"6b570150633aafe0","entry":"DSLA","repo":"dongkikim95/d-sla","repo_kind":"official","path":"linkPrediction_TU/pretrain_DSLA.py","file_url":"https://github.com/dongkikim95/d-sla/blob/HEAD/linkPrediction_TU/pretrain_DSLA.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":"6b570150633aafe0"}},{"code_sha256_prefix":"944d6bd632975f5b","entry":"train","repo":"DongkiKim95/D-SLA","repo_kind":"official","path":"linkPrediction_TU/pretrain_DSLA.py","file_url":"https://github.com/DongkiKim95/D-SLA/blob/HEAD/linkPrediction_TU/pretrain_DSLA.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"944d6bd632975f5b"}},{"code_sha256_prefix":"6929fdd668e120ca","entry":"train","repo":"DongkiKim95/D-SLA","repo_kind":"official","path":"transferLearning_MoleculeNet_PPI/chem/pretrain_DSLA.py","file_url":"https://github.com/DongkiKim95/D-SLA/blob/HEAD/transferLearning_MoleculeNet_PPI/chem/pretrain_DSLA.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6929fdd668e120ca"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}