{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T11:55:59Z","timestamp":1782388559462,"version":"3.54.5"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGKDD Explor. Newsl."],"published-print":{"date-parts":[[2025,12,30]]},"abstract":"<jats:p>The rise of self-supervised learning(SSL), which operates without the need for labeled data, has garnered significant interest within the graph learning community. This enthusiasm has led to the development of numerous self-supervised learning methods, such as Graph Contrastive Learning (GCL) techniques, all aiming to create a versatile graph encoder that leverages the wealth of unlabeled data for various downstream tasks. However, the current evaluation standards for GCL approaches are flawed due to the need for extensive hyper-parameter tuning during pre-training and the reliance on a single downstream task for assessment. These flaws can skew the evaluation away from the intended goals, potentially leading to misleading conclusions. In our paper, we thoroughly examine these shortcomings and o!er fresh perspectives on how GCL methods are a!ected by hyperparameter choices and the choice of downstream tasks for their evaluation. Additionally, we introduce an enhanced evaluation framework designed to more accurately gauge the e!ectiveness, consistency, and overall capability of GCL methods. Our code implementation is available to ease reproducibility on https:\/\/github.com\/GraphTL-Bench\/BGPM.<\/jats:p>","DOI":"10.1145\/3787470.3787479","type":"journal-article","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:46:21Z","timestamp":1767228381000},"page":"97-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Overcoming Pitfalls in Graph Contrastive Learning Evaluation: Toward Comprehensive Benchmarks"],"prefix":"10.1145","volume":"27","author":[{"given":"Qian","family":"Ma","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongliang","family":"Chi","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, , APO AA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hengrui","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kay","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suhang","family":"Wang","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yao","family":"Ma","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,12,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109631"},{"key":"e_1_2_1_2_1","first-page":"1597","volume-title":"International conference on machine learning","author":"Chen Ting","year":"2020","unstructured":"Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geo!rey Hinton. A simple framework for contrastive learning of visual representations. In International conference on machine learning, pages 1597--1607. PMLR, 2020."},{"issue":"5","key":"e_1_2_1_3_1","first-page":"4908","article-title":"Graph transfer learning via adversarial domain adaptation with graph convolution","volume":"35","author":"Dai Quanyu","year":"2022","unstructured":"Quanyu Dai, Xiao-Ming Wu, Jiaren Xiao, Xiao Shen, and Dan Wang. Graph transfer learning via adversarial domain adaptation with graph convolution. IEEE Transactions on Knowledge and Data Engineering, 35(5):4908--4922, 2022.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_1_4_1","volume-title":"Convolutional networks on graphs for learning molecular fingerprints. Advances in neural information processing systems, 28","author":"Duvenaud David K","year":"2015","unstructured":"David K Duvenaud, Dougal Maclaurin, Jorge Iparraguirre, Rafael Bombarell, Timothy Hirzel, Al\u00b4an Aspuru-Guzik, and Ryan P Adams. Convolutional networks on graphs for learning molecular fingerprints. Advances in neural information processing systems, 28, 2015."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347011"},{"key":"e_1_2_1_6_1","first-page":"52464","article-title":"Universal prompt tuning for graph neural networks","volume":"36","author":"Fang Taoran","year":"2023","unstructured":"Taoran Fang, Yunchao Zhang, Yang Yang, Chunping Wang, and Lei Chen. Universal prompt tuning for graph neural networks. Advances in Neural Information Processing Systems, 36:52464--52489, 2023.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_7_1","volume-title":"Simcse: Simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821","author":"Gao Tianyu","year":"2021","unstructured":"Tianyu Gao, Xingcheng Yao, and Danqi Chen. Simcse: Simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821, 2021."},{"key":"e_1_2_1_8_1","first-page":"1263","volume-title":"International conference on machine learning","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. Neural message passing for quantum chemistry. In International conference on machine learning, pages 1263--1272. PMLR, 2017."},{"key":"e_1_2_1_9_1","volume-title":"Social network analysis: From graph theory to applications with python. arXiv preprint arXiv:2102.10014","author":"Goldenberg Dmitri","year":"2021","unstructured":"Dmitri Goldenberg. Social network analysis: From graph theory to applications with python. arXiv preprint arXiv:2102.10014, 2021."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01588-5"},{"key":"e_1_2_1_11_1","first-page":"4116","volume-title":"International conference on machine learning","author":"Hassani Kaveh","year":"2020","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. Contrastive multi-view representation learning on graphs. In International conference on machine learning, pages 4116--4126. PMLR, 2020."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"e_1_2_1_13_1","volume-title":"Molecular graph convolutions: moving beyond fingerprints. Journal of computer-aided molecular design, 30:595--608","author":"Kearnes Steven","year":"2016","unstructured":"Steven Kearnes, Kevin McCloskey, Marc Berndl, Vijay Pande, and Patrick Riley. Molecular graph convolutions: moving beyond fingerprints. Journal of computer-aided molecular design, 30:595--608, 2016."},{"key":"e_1_2_1_14_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016."},{"key":"e_1_2_1_15_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016."},{"key":"e_1_2_1_16_1","volume-title":"Data-driven tra\"c forecasting. arXiv preprint arXiv:1707.01926","author":"Li Yaguang","year":"2017","unstructured":"Yaguang Li, Rose Yu, Cyrus Shahabi, and Yan Liu. Di!usion convolutional recurrent neural network: Data-driven tra\"c forecasting. arXiv preprint arXiv:1707.01926, 2017."},{"key":"e_1_2_1_17_1","volume-title":"Gated graph sequence neural networks. arXiv preprint arXiv:1511.05493","author":"Li Yujia","year":"2015","unstructured":"Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard Zemel. Gated graph sequence neural networks. arXiv preprint arXiv:1511.05493, 2015."},{"issue":"6","key":"e_1_2_1_18_1","first-page":"5879","article-title":"Graph selfsupervised learning: A survey","volume":"35","author":"Liu Yixin","year":"2022","unstructured":"Yixin Liu, Ming Jin, Shirui Pan, Chuan Zhou, Yu Zheng, Feng Xia, and S Yu Philip. Graph selfsupervised learning: A survey. IEEE Transactions on Knowledge and Data Engineering, 35(6):5879--5900, 2022.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583386"},{"key":"e_1_2_1_20_1","volume-title":"andWenwu Zhu. Learning disentangled representations for recommendation. Advances in neural information processing systems, 32","author":"Ma Jianxin","year":"2019","unstructured":"Jianxin Ma, Chang Zhou, Peng Cui, Hongxia Yang, andWenwu Zhu. Learning disentangled representations for recommendation. Advances in neural information processing systems, 32, 2019."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614910"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20748"},{"key":"e_1_2_1_23_1","volume-title":"Geometric matrix completion with recurrent multigraph neural networks. Advances in neural information processing systems, 30","author":"Monti Federico","year":"2017","unstructured":"Federico Monti, Michael Bronstein, and Xavier Bresson. Geometric matrix completion with recurrent multigraph neural networks. Advances in neural information processing systems, 30, 2017."},{"key":"e_1_2_1_24_1","volume-title":"Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00a8unnemann. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868, 2018."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599256"},{"key":"e_1_2_1_26_1","volume-title":"Mehdi Azabou, Eva L Dyer, Remi Munos, Petar Velickovi\u00b4c, and Michal Valko. Large-scale representation learning on graphs via bootstrapping. arXiv preprint arXiv:2102.06514","author":"Thakoor Shantanu","year":"2021","unstructured":"Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Mehdi Azabou, Eva L Dyer, Remi Munos, Petar Velickovi\u00b4c, and Michal Valko. Large-scale representation learning on graphs via bootstrapping. arXiv preprint arXiv:2102.06514, 2021."},{"key":"e_1_2_1_27_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Velickovi\u00b4c Petar","year":"2017","unstructured":"Petar Velickovi\u00b4c, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. Graph attention networks. arXiv preprint arXiv:1710.10903, 2017."},{"key":"e_1_2_1_28_1","volume-title":"Deep graph infomax. arXiv preprint arXiv:1809.10341","author":"Velickovi\u00b4c Petar","year":"2018","unstructured":"Petar Velickovi\u00b4c, William Fedus, William L Hamilton, Pietro Li'o, Yoshua Bengio, and R Devon Hjelm. Deep graph infomax. arXiv preprint arXiv:1809.10341, 2018."},{"key":"e_1_2_1_29_1","volume-title":"Graph wavenet for deep spatial-temporal graph modeling. arXiv preprint arXiv:1906.00121","author":"Wu Zonghan","year":"2019","unstructured":"Zonghan Wu, Shirui Pan, Guodong Long, Jing Jiang, and Chengqi Zhang. Graph wavenet for deep spatial-temporal graph modeling. arXiv preprint arXiv:1906.00121, 2019."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"e_1_2_1_31_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018."},{"key":"e_1_2_1_32_1","first-page":"40","volume-title":"International conference on machine learning","author":"Yang Zhilin","year":"2016","unstructured":"Zhilin Yang, William Cohen, and Ruslan Salakhudinov. Revisiting semi-supervised learning with graph embeddings. In International conference on machine learning, pages 40--48. PMLR, 2016."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_2_1_34_1","volume-title":"Graph convolutional policy network for goal-directed molecular graph generation. Advances in neural information processing systems, 31","author":"You Jiaxuan","year":"2018","unstructured":"Jiaxuan You, Bowen Liu, Zhitao Ying, Vijay Pande, and Jure Leskovec. Graph convolutional policy network for goal-directed molecular graph generation. Advances in neural information processing systems, 31, 2018."},{"key":"e_1_2_1_35_1","volume-title":"Graph contrastive learning with augmentations. Advances in neural information processing systems, 33:5812--5823","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. Graph contrastive learning with augmentations. Advances in neural information processing systems, 33:5812--5823, 2020."},{"key":"e_1_2_1_36_1","first-page":"76","article-title":"From canonical correlation analysis to self-supervised graph neural networks","volume":"34","author":"Zhang Hengrui","year":"2021","unstructured":"Hengrui Zhang, Qitian Wu, Junchi Yan, David Wipf, and Philip S Yu. From canonical correlation analysis to self-supervised graph neural networks. Advances in Neural Information Processing Systems, 34:76--89, 2021.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00088"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539425"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26336"},{"key":"e_1_2_1_40_1","volume-title":"Alan Hanjalic, and Megha Khosla. Multi-label node classification on graphstructured data. arXiv preprint arXiv:2304.10398","author":"Zhao Tianqi","year":"2023","unstructured":"Tianqi Zhao, Ngan Thi Dong, Alan Hanjalic, and Megha Khosla. Multi-label node classification on graphstructured data. arXiv preprint arXiv:2304.10398, 2023."},{"key":"e_1_2_1_41_1","volume-title":"An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116","author":"Zhu Yanqiao","year":"2021","unstructured":"Yanqiao Zhu, Yichen Xu, Qiang Liu, and Shu Wu. An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116, 2021."},{"key":"e_1_2_1_42_1","volume-title":"An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116","author":"Zhu Yanqiao","year":"2021","unstructured":"Yanqiao Zhu, Yichen Xu, Qiang Liu, and Shu Wu. An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116, 2021."},{"key":"e_1_2_1_43_1","volume-title":"Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131","author":"Zhu Yanqiao","year":"2020","unstructured":"Yanqiao Zhu, Yichen Xu, Feng Yu, Qiang Liu, Shu Wu, and LiangWang. Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131, 2020."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx252"}],"container-title":["ACM SIGKDD Explorations Newsletter"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3787470.3787479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:43:07Z","timestamp":1768264987000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3787470.3787479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,30]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,12,30]]}},"alternative-id":["10.1145\/3787470.3787479"],"URL":"https:\/\/doi.org\/10.1145\/3787470.3787479","relation":{},"ISSN":["1931-0145","1931-0153"],"issn-type":[{"value":"1931-0145","type":"print"},{"value":"1931-0153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,30]]},"assertion":[{"value":"2025-12-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}