MAGPrompt: Message-Adaptive Graph Prompt Tuning for Graph Neural Networks
Abstract
Pre-trained graph neural networks (GNNs) transfer well, but adapting them to downstream tasks remains challenging due to mismatches between pre-training objectives and task requirements. Graph prompt tuning offers a parameter-efficient alternative to fine-tuning, yet most methods only modify inputs or representations and leave message passing unchanged, limiting their ability to adapt neighborhood interactions. We propose message-adaptive graph prompt tuning, which injects learnable prompts into the message passing step to reweight incoming neighbor messages and add task-specific prompt vectors during message aggregation, while keeping the backbone GNN frozen. The approach is compatible with common GNN backbones and pre-training strategies, and applicable across downstream settings. Experiments on diverse node- and graph-level datasets show consistent gains over prior graph prompting methods in few-shot settings, while achieving performance competitive with fine-tuning in full-shot regimes.
Benchmark Results
Tested on 7 datasets 3 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 44 | GCN | 0.8033
±0.0088 | |
| 350 | MLP | 0.7289
±0.0010 | |
| 603 | GPPT | 0.7031
±0.0039 best reported | |
| 832 | GPF-plus | 0.5967
±0.1187 best reported | best at pub: ProG: A Graph Prompt Learning Benchmark (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 862 | MAGPrompt+ | 0.5282
±0.0418 | This paper |
| 866 | EdgePrompt+ | 0.4971
±0.0225 | prev best: One Prompt Fits All: Universal Graph Adaptation for Pretrained Models (NeurIPS 2025) |
| 869 | GPF | 0.4902
±0.0453 | prev best: One Prompt Fits All: Universal Graph Adaptation for Pretrained Models (NeurIPS 2025) Improvement within reported uncertainty; not highlighted. |
| 871 | GraphPrompt | 0.4707
±0.0309 | prev best: GCoT: Chain-of-Thought Prompt Learning for Graphs (KDD 2025) Improvement within reported uncertainty; not highlighted. |
| 882 | All-In-One | 0.4436
±0.0252 | prev best: ProG: A Graph Prompt Learning Benchmark (NeurIPS 2024) Improvement within reported uncertainty; not highlighted. |
| 886 | GraphTOP | 0.4113
±0.0159 | This paper |
| 887 | Linear Probe | 0.4045
±0.0355 | This paper |
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 | |
| 3 | GCN | 0.9727 | |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 516 | EdgePrompt+ | 0.6630
±0.0254 | This paper |
| 531 | GPF-plus | 0.6456
±0.0110 | This paper |
| 538 | GraphPrompt | 0.6319
±0.0171 | This paper |
| 539 | GPF | 0.6266
±0.0183 | This paper |
| 542 | Linear Probe | 0.6249
±0.0195 | This paper |
| 560 | All-In-One | 0.5914
±0.0212 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GMN | 0.7866 | |
| 2 | MemGNN | 0.7550 | |
| 3 | TFGW SP | 0.7510
±0.0500 | |
| 17 | GatedGCN | 0.7000
±0.0494 | |
| 26 | GraphSAGE | 0.6817
±0.0545 | |
| 124 | MLP | 0.5583
±0.0352 | |
| 205 | MAGPrompt+ | 0.3719
±0.0279 | This paper |
MoleculeNet
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | ProtoMol | 0.9140
±0.0030 | |
| 2 | MMSG | 0.9080
±0.0050 | |
| 3 | MemGNN | 0.9070 | |
| 35 | MAGPrompt+ | 0.8682
±0.0521 | This paper |
| 43 | GIN | 0.8646
±0.0081 |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | MAGPrompt+ | 0.9432
±0.0238 | This paper |
| 2 | CamS-LLaMA | 0.9420 | |
| 3 | SE(3)-I MPPH | 0.9400
±0.0210 | |
| 6 | GPF-plus | 0.9319
±0.0206 | prev best: Universal Prompt Tuning for Graph Neural Networks (NeurIPS 2022) |
| 7 | Fine-tune | 0.9299
±0.0371 | This paper |
| 8 | EdgePrompt+ | 0.9279
±0.0357 | This paper |
| 9 | GPF | 0.9273
±0.0282 | prev best: Universal Prompt Tuning for Graph Neural Networks (NeurIPS 2022) |
| 34 | GIN | 0.8875
±0.0049 |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | SE(3)-I MPPH | 0.9930
±0.0040 | |
| 2 | KA-GCN | 0.9920
±0.0050 | |
| 3 | KA-GAT | 0.9910
±0.0050 | |
| 19 | GCN | 0.9130
±0.0170 | |
| 119 | GPF-plus | 0.7617
±0.0298 best reported | best at pub: Universal Prompt Tuning for Graph Neural Networks (NeurIPS 2022) Difference within reported uncertainty; not counted as underperformance. |
| 129 | GPF | 0.7506
±0.0102 best reported | best at pub: Universal Prompt Tuning for Graph Neural Networks (NeurIPS 2022) Difference within reported uncertainty; not counted as underperformance. |
| 161 | MAGPrompt+ | 0.7181
±0.1158 | This paper |
| 189 | EdgePrompt+ | 0.6791
±0.1273 | This paper |
| 202 | Fine-tune | 0.6499
±0.1310 | This paper |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | KA-GAT | 0.8470
±0.0020 | |
| 2 | KA-GCN | 0.8420
±0.0010 | |
| 3 | GraphKAN | 0.8370
±0.0010 | |
| 8 | GPF | 0.6913
±0.0116 best reported | best at pub: Universal Prompt Tuning for Graph Neural Networks (NeurIPS 2022) |
| 11 | GPF-plus | 0.6865
±0.0072 best reported | best at pub: Universal Prompt Tuning for Graph Neural Networks (NeurIPS 2022) |
| 66 | GIN | 0.6403
±0.0104 | |
| 105 | Fine-tune | 0.6217
±0.0427 | This paper |
| 107 | MAGPrompt+ | 0.6201
±0.0436 | This paper |
| 150 | EdgePrompt+ | 0.6076
±0.0495 | This paper |
| 180 | DGI | 0.6009
±0.0582 | prev best: Graph Self-Contrast Representation Learning (2023) Improvement within reported uncertainty; not highlighted. |
