mlsanityData to 14 Oct 2026

Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias

arXiv 2510.23469 ↗First posted 27 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 47 of its 64 references that are in the map. First posted on arXiv 27 Oct 2025.

Builds on

47 of 64 references.

References · 47

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Inductive Representation Learning on Large Graphscited by 6,320
  4. 2017Squeeze-and-Excitation Networkscited by 4,789
  5. 2018How Powerful are Graph Neural Networks?cited by 4,393
  6. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  7. 2021Learning to Prompt for Vision-Language Modelscited by 2,281
  8. 2022Visual Prompt Tuningcited by 1,681
  9. 2016Variational Graph Auto-Encoderscited by 1,382
  10. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  11. 2018Deep Graph Infomaxcited by 1,106
  12. 2019Strategies for Pre-training Graph Neural Networkscited by 971
35 more
  1. 2020Simple and Deep Graph Convolutional Networkscited by 860
  2. 2022MaPLe: Multi-modal Prompt Learningcited by 687
  3. 2017Spectrally-normalized margin bounds for neural networkscited by 686
  4. 2020Deep Graph Contrastive Representation Learningcited by 539
  5. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
  6. 2020Graph Structure Learning for Robust Graph Neural Networkscited by 371
  7. 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 369
  8. 2019Learning Discrete Structures for Graph Neural Networkscited by 231
  9. 2020Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddingscited by 214
  10. 2020Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Informationcited by 168
  11. 2020Graph Information Bottleneckcited by 168
  12. 2018Invariant Representations without Adversarial Trainingcited by 112
  13. 2022Universal Prompt Tuning for Graph Neural Networkscited by 100
  14. 2021EDITS: Modeling and Mitigating Data Bias for Graph Neural Networkscited by 92
  15. 2019Conditional Learning of Fair Representationscited by 78
  16. 2022Fairness in Graph Mining: A Surveycited by 76
  17. 2022Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminationcited by 69
  18. 2021FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learningcited by 68
  19. 2023Graph Prompt Learning: A Comprehensive Survey and Beyondcited by 61
  20. 2022Learning Fair Node Representations with Graph Counterfactual Fairnesscited by 58
  21. 2023GraphCare: Enhancing Healthcare Predictions with Personalized Knowledge Graphscited by 58
  22. 2023Improving Visual Prompt Tuning for Self-supervised Vision Transformerscited by 57
  23. 2023HGPROMPT: Bridging Homogeneous and Heterogeneous Graphs for Few-shot Prompt Learningcited by 45
  24. 2023Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphscited by 39
  25. 2020On the Stability of Graph Convolutional Neural Networks under Edge Rewiringcited by 25
  26. 2023Fairness-Aware Graph Neural Networks: A Surveycited by 22
  27. 2022FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editingcited by 15
  28. 2023Search to Fine-tune Pre-trained Graph Neural Networks for Graph-level Taskscited by 13
  29. 2023Fine-tuning Graph Neural Networks by Preserving Graph Generative Patternscited by 13
  30. 2023FairGAT: Fairness-aware Graph Attention Networkscited by 12
  31. 2023Explainable Multilayer Graph Neural Network for Cancer Gene Predictioncited by 8
  32. 2023Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networkscited by 8
  33. 2022On Graph Neural Network Fairness in the Presence of Heterophilous Neighborhoodscited by 6
  34. 2024All in One: Multi-Task Prompting for Graph Neural Networks (Extended Abstract)cited by 3
  35. 2025Improving Fairness in Graph Neural Networks via Counterfactual Debiasingcited by 1

Built on by

Not cited yet.