mlsanityData to 7 Oct 2026

FairGU: Fairness-aware Graph Unlearning in Social Networks

arXiv 2601.09469 ↗First posted 14 Jan 2026cs.LG cs.AIcited by 0

On the map: LLM safety and security → Graph unlearning

Abstract (arXiv)

Graph unlearning has emerged as a critical mechanism for supporting sustainable and privacy-preserving social networks, enabling models to remove the influence of deleted nodes and thereby better safeguard user information. However, we observe that existing graph unlearning techniques insufficiently protect sensitive attributes, often leading to degraded algorithmic fairness compared with traditional graph learning methods. To address this gap, we introduce FairGU, a fairness-aware graph unlearning framework designed to preserve both utility and fairness during the unlearning process. FairGU integrates a dedicated fairness-aware module with effective data protection strategies, ensuring that sensitive attributes are neither inadvertently amplified nor structurally exposed when nodes are removed. Through extensive experiments on multiple real-world datasets, we demonstrate that FairGU consistently outperforms state-of-the-art graph unlearning methods and fairness-enhanced graph learning baselines in terms of both accuracy and fairness metrics. Our findings highlight a previously overlooked risk in current unlearning practices and establish FairGU as a robust and equitable solution for the next generation of socially sustainable networked systems. The codes are available at https://github.com/LuoRenqiang/FairGU.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Graph unlearning, one of 12 directions in LLM safety and security. Builds on 20 of its 41 references that are in the map. First posted on arXiv 14 Jan 2026.

Builds on

20 of 41 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025Graph Unlearning Meets Influence-aware Negative Preference Optimization22 Oct
  2. 2025OpenGU: A Comprehensive Benchmark for Graph Unlearning6 Jan
  3. 2024Erase then Rectify: A Training-Free Parameter Editing Approach for Cost-Effective Graph Unlearning25 Sep
  4. 2024Towards Effective and General Graph Unlearning via Mutual Evolution22 Jan

Other references · 16

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  3. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  4. 2019Machine Unlearningcited by 1,020
  5. 2019Certified Data Removal from Machine Learning Modelscited by 512
  6. 2022A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainabilitycited by 118
  7. 2022Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakagecited by 61
  8. 2024FairGT: A Fairness-aware Graph Transformercited by 29
  9. 2023Fair Attribute Completion on Graph with Missing Attributescited by 22
  10. 2024Endowing Pre-trained Graph Models with Provable Fairnesscited by 10
  11. 2020Assessing Classifier Fairness with Collider Biascited by 8
  12. 2024TikTok and the Art of Personalization: Investigating Exploration and Exploitation on Social Media Feedscited by 7
4 more
  1. 2024Graph Memory Learning: Imitating Lifelong Remembering and Forgetting of Brain Networkscited by 4
  2. 2025Revisiting Pre-processing Group Fairness: A Modular Benchmarking Frameworkcited by 4
  3. 2025Synthetic Forgetting without Access: A Few-shot Zero-glance Framework for Machine Unlearningcited by 3
  4. 2025CUFG: Curriculum Unlearning Guided by the Forgetting Gradientcited by 1

Built on by

Not cited yet.