GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks

Zemin Liu, Xingtong Yu, Yuan Fang, Xinming Zhang
2/16/2023
cs.LGcs.CL

No official code found. Best implementation: Starlien95/GraphPrompt (169 stars, last commit 2024-10-25).

Abstract

Graphs can model complex relationships between objects, enabling a myriad of Web applications such as online page/article classification and social recommendation. While graph neural networks(GNNs) have emerged as a powerful tool for graph representation learning, in an end-to-end supervised setting, their performance heavily rely on a large amount of task-specific supervision. To reduce labeling requirement, the "pre-train, fine-tune" and "pre-train, prompt" paradigms have become increasingly common. In particular, prompting is a popular alternative to fine-tuning in natural language processing, which is designed to narrow the gap between pre-training and downstream objectives in a task-specific manner. However, existing study of prompting on graphs is still limited, lacking a universal treatment to appeal to different downstream tasks. In this paper, we propose GraphPrompt, a novel pre-training and prompting framework on graphs. GraphPrompt not only unifies pre-training and downstream tasks into a common task template, but also employs a learnable prompt to assist a downstream task in locating the most relevant knowledge from the pre-train model in a task-specific manner. Finally, we conduct extensive experiments on five public datasets to evaluate and analyze GraphPrompt.

View on arXivView PDF

Code Implementations(1)

GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks

16918PythonFeb 19, 20231 years ago

Similar Papers

Cite this paper

@article{liu2023graphprompt,
  title  = {GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks},
  author = {Zemin Liu and Xingtong Yu and Yuan Fang and Xinming Zhang},
  year   = {2023},
  eprint = {2302.08043},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.08043v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.08043.svg)](https://codeofpaper.com/paper/2302.08043)

Discussion