Robust Graph Fine-Tuning with Adversarial Graph Prompting
Ziyan Zhang, Bo Jiang, Jin Tang

TL;DR
This paper introduces a novel adversarial graph prompting framework that enhances the robustness of pre-trained GNN models against noise and attacks through a min-max optimization approach.
Contribution
It proposes the first adversarial graph prompting method with a min-max formulation and an alternating optimization scheme for robust graph fine-tuning.
Findings
AGP improves robustness against graph noise and attacks
Experimental results outperform state-of-the-art methods
Theoretical analysis confirms effectiveness against topology and feature noise
Abstract
Parameter-Efficient Fine-Tuning (PEFT) method has emerged as a dominant paradigm for adapting pre-trained GNN models to downstream tasks. However, existing PEFT methods usually exhibit significant vulnerability to various noise and attacks on graph topology and node attributes/features. To address this issue, for the first time, we propose integrating adversarial learning into graph prompting and develop a novel Adversarial Graph Prompting (AGP) framework to achieve robust graph fine-tuning. Our AGP has two key aspects. First, we propose the general problem formulation of AGP as a min-max optimization problem and develop an alternating optimization scheme to solve it. For inner maximization, we propose Joint Projected Gradient Descent (JointPGD) algorithm to generate strong adversarial noise. For outer minimization, we employ a simple yet effective module to learn the optimal node…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Adversarial Robustness in Machine Learning · Explainable Artificial Intelligence (XAI)
