Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs
Reviewed by Pithpith:VRJZIC4Aopen to challenge →
read the original abstract
Learning on Graphs has attracted immense attention due to its wide real-world applications. The most popular pipeline for learning on graphs with textual node attributes primarily relies on Graph Neural Networks (GNNs), and utilizes shallow text embedding as initial node representations, which has limitations in general knowledge and profound semantic understanding. In recent years, Large Language Models (LLMs) have been proven to possess extensive common knowledge and powerful semantic comprehension abilities that have revolutionized existing workflows to handle text data. In this paper, we aim to explore the potential of LLMs in graph machine learning, especially the node classification task, and investigate two possible pipelines: LLMs-as-Enhancers and LLMs-as-Predictors. The former leverages LLMs to enhance nodes' text attributes with their massive knowledge and then generate predictions through GNNs. The latter attempts to directly employ LLMs as standalone predictors. We conduct comprehensive and systematical studies on these two pipelines under various settings. From comprehensive empirical results, we make original observations and find new insights that open new possibilities and suggest promising directions to leverage LLMs for learning on graphs. Our codes and datasets are available at https://github.com/CurryTang/Graph-LLM.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs
CANE estimates cluster-specific reliability of noisy LLM pseudo-labels on graphs without ground truth to improve label-free node classification.
-
Handling Feature Heterogeneity with Learnable Graph Patches
Learnable graph patches enable domain-agnostic pre-training of graph models by decomposing heterogeneous graphs into transferable semantic units via patch encoders and aggregators.
-
Probabilistic Salary Prediction with Graph Attention Networks and a Mixture Density Network
GAT-MDN uses domain-specific graphs with GATs plus an MDN head to output conditional salary distributions and reports better NLL and MSE than an MLP-MDN baseline on a Dutch job dataset of over 1M records.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.