Abstract:Self-supervised pre-training on unlabeled graph data has become a common paradigm for Graph Neural Networks (GNNs). However, an objective gap often remains between pre-training objectives and downstream tasks. To bridge this gap, graph prompting methods adapt frozen pre-trained GNNs to specific downstream tasks through learnable prompts. Despite its effectiveness, most existing graph prompting methods primarily focus on improving model performance and largely overlook fairness concerns. As downstream graph data inherently contains biases in both node attributes and graph structures, pre-trained GNNs may produce representations that differ across demographic subgroups. To address this limitation, we propose Adaptive Dual Prompting (ADPrompt), a fairness-aware graph prompting framework for adapting pre-trained GNNs. ADPrompt incorporates two complementary components: Adaptive Feature Rectification, which learns personalized attribute prompts to suppress sensitive information at the input level, and Adaptive Message Calibration, which introduces layer-wise structure prompts to dynamically regulate information propagation from neighboring nodes. By jointly optimizing these two modules, ADPrompt adapts the pre-trained GNN while mitigating both attribute-level and structural bias. Experiments on four benchmark datasets with multiple pre-training strategies demonstrate that ADPrompt consistently outperforms seven competitive baselines in node classification tasks.
From: Yuhan Yang [view email]
[v1]
Mon, 27 Oct 2025 16:07:36 UTC (236 KB)
[v2]
Tue, 2 Jun 2026 15:31:54 UTC (241 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。