{"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/task-agnostic-graph-neural-network-evaluation","title":"Task-Agnostic Graph Neural Network Evaluation via Adversarial Collaboration","arxiv_id":"2301.11517","date":"2023-01-27","proceeding":null,"authors":["Xiangyu Zhao","Hannes Stärk","Dominique Beaini","Yiren Zhao","Pietro Liò"],"abstract":"It has been increasingly demanding to develop reliable methods to evaluate the progress of Graph Neural Network (GNN) research for molecular representation learning. Existing GNN benchmarking methods for molecular representation learning focus on comparing the GNNs' performances on some node/graph classification/regression tasks on certain datasets. However, there lacks a principled, task-agnostic method to directly compare two GNNs. Additionally, most of the existing self-supervised learning works incorporate handcrafted augmentations to the data, which has several severe difficulties to be applied on graphs due to their unique characteristics. To address the aforementioned issues, we propose GraphAC (Graph Adversarial Collaboration) -- a conceptually novel, principled, task-agnostic, and stable framework for evaluating GNNs through contrastive self-supervision. We introduce a novel objective function: the Competitive Barlow Twins, that allow two GNNs to jointly update themselves from direct competitions against each other. GraphAC succeeds in distinguishing GNNs of different expressiveness across various aspects, and has demonstrated to be a principled and reliable GNN evaluation method, without necessitating any augmentations.","url_abs":"https://arxiv.org/abs/2301.11517v3","url_pdf":"https://arxiv.org/pdf/2301.11517v3.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":"task-agnostic-graph-neural-network-evaluation","repo_url":"https://github.com/victorzxy/graphac","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"},{"task_slug":"molecular-representation","task_name":"molecular representation"}],"methods":[{"method_slug":"barlow-twins","method_name":"Barlow Twins"},{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2301.11517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11517"}},"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/VictorZXY/GraphAC","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/victorzxy/graphac","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":1,"ran_honours":2,"ran_draft_wrong":1},"by_repo_kind":{"official":{"samples":4,"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":"de16c530f8ef01f6","entry":"CLASSBarlowTwinsLoss","repo":"victorzxy/graphac","repo_kind":"official","path":"commons/losses.py","file_url":"https://github.com/victorzxy/graphac/blob/HEAD/commons/losses.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"de16c530f8ef01f6"}},{"code_sha256_prefix":"9e32d933d9ffb5ad","entry":"cov_loss","repo":"victorzxy/graphac","repo_kind":"official","path":"commons/losses.py","file_url":"https://github.com/victorzxy/graphac/blob/HEAD/commons/losses.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9e32d933d9ffb5ad"}},{"code_sha256_prefix":"d5f4961bb667c18c","entry":"std_loss","repo":"victorzxy/graphac","repo_kind":"official","path":"commons/losses.py","file_url":"https://github.com/victorzxy/graphac/blob/HEAD/commons/losses.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d5f4961bb667c18c"}},{"code_sha256_prefix":"313626fa3230b213","entry":"uniformity_loss","repo":"victorzxy/graphac","repo_kind":"official","path":"commons/losses.py","file_url":"https://github.com/victorzxy/graphac/blob/HEAD/commons/losses.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"313626fa3230b213"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}