Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.15680 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913243929247744 |
|---|---|
| author | Ma, Qian Chi, Hongliang Zhang, Hengrui Liu, Kay Zhang, Zhiwei Cheng, Lu Wang, Suhang Yu, Philip S. Ma, Yao |
| author_facet | Ma, Qian Chi, Hongliang Zhang, Hengrui Liu, Kay Zhang, Zhiwei Cheng, Lu Wang, Suhang Yu, Philip S. Ma, Yao |
| contents | The rise of self-supervised learning, 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 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 offer fresh perspectives on how GCL methods are affected by hyper-parameter choices and the choice of downstream tasks for their evaluation. Additionally, we introduce an enhanced evaluation framework designed to more accurately gauge the effectiveness, consistency, and overall capability of GCL methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_15680 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Overcoming Pitfalls in Graph Contrastive Learning Evaluation: Toward Comprehensive Benchmarks Ma, Qian Chi, Hongliang Zhang, Hengrui Liu, Kay Zhang, Zhiwei Cheng, Lu Wang, Suhang Yu, Philip S. Ma, Yao Machine Learning The rise of self-supervised learning, 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 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 offer fresh perspectives on how GCL methods are affected by hyper-parameter choices and the choice of downstream tasks for their evaluation. Additionally, we introduce an enhanced evaluation framework designed to more accurately gauge the effectiveness, consistency, and overall capability of GCL methods. |
| title | Overcoming Pitfalls in Graph Contrastive Learning Evaluation: Toward Comprehensive Benchmarks |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2402.15680 |