GPT4Graph: Can Large Language Models Understand Graph Structured Data? An Empirical Evaluation and Benchmarking

Jiayan Guo, Lun Du, Hengyu Liu

Main figure for GPT4Graph: Can Large Language Models Understand Graph Structured Data? An Empirical Evaluation and Benchmarking

Abstract

Large language models (LLM) like ChatGPT have become indispensable to artificial general intelligence (AGI), demonstrating excellent performance in various natural language processing tasks. Graph data is ubiquitous and an essential part of AGI. The training corpus of large language models often includes some algorithmic components, which allows them to achieve certain effects on some graph data-related problems. However, there is still little research on their performance on a broader range of graph-structured data. In this paper, we conduct an empirical study to assess the proficiency of LLMs in comprehending graph data, employing a diverse range of structural and semantic-related tasks that evaluate the LLMs' capabilities in graph understanding. Through our study, we uncover current limitations and future directions of LLMs in comprehending graph and performing associated reasoning tasks.

Benchmark Results

Tested on 1 dataset

Tables show presented results in global context (best 3 papers + GCN + MLP).

OGB

#ModelROC-AUC ↑Paper
1
Multi-RF Fusion with Multi-GNN Blending
0.8476 ±0.0002
2
HyperFusion
0.8475 ±0.0003
3
PAS+FPs
0.8420 ±0.0015
9
GatedGCN
0.8090 ±0.0160
109
GIN
0.7780 ±0.0182
298
1-shot-cot
0.6765
This paper
301
1-shot-tot
0.6687
This paper
308
0-shot-cot
0.5976
This paper
SOTA performance (not significantly different from the best) Baseline / comparison (this paper) Global context (other papers)