Pith. sign in

REVIEW 1 cited by

A Survey of Graph Prompting Methods: Techniques, Applications, and Challenges

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 2303.07275 v2 pith:KSZJIML5 submitted 2023-03-13 cs.LG cs.AIcs.SI

classification cs.LGcs.AIcs.SI
keywords graphpromptingpromptsurveyapplicationschallengesdatadesign
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The recent "pre-train, prompt, predict training" paradigm has gained popularity as a way to learn generalizable models with limited labeled data. The approach involves using a pre-trained model and a prompting function that applies a template to input samples, adding indicative context and reformulating target tasks as the pre-training task. However, the design of prompts could be a challenging and time-consuming process in complex tasks. The limitation can be addressed by using graph data, as graphs serve as structured knowledge repositories by explicitly modeling the interaction between entities. In this survey, we review prompting methods from the graph perspective, where prompting functions are augmented with graph knowledge. In particular, we introduce the basic concepts of graph prompt learning, organize the existing work of designing graph prompting functions, and describe their applications and future challenges. This survey will bridge the gap between graphs and prompt design to facilitate future methodology development.

Discussion (0). Sign in 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. Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding

    cs.LG 2026-02 conditional novelty 5.0 of 10

    GPH^2 pre-trains one expert per graph on edge-dropped or meta-path views and fuses frozen experts with class-wise attention, outperforming type-specific graph pre-training baselines.

Pith tools