Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.08043 v3 pith:QFC643BG submitted 2023-02-16 cs.LG cs.CL

classification cs.LGcs.CL
keywords downstreamgraphpromptpre-traininggraphgraphspre-trainpromptingtask-specific
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Attacking Graph Foundation Models Through Their Shared Representation

    cs.AI 2026-07 conditional novelty 6.0 of 10

    A shared representation layer in graph foundation models is a distinct attack surface: input edits break three of six models and one spectral tokenizer is uniquely fragile.

Pith tools