FROG: Fair Removal on Graphs

As compliance with privacy regulations becomes increasingly critical, the growing demand for data privacy has highlighted the significance of machine unlearning in many real world applications, such as social network and recommender systems, many of which can be represented as graph-structured data. However, existing graph unlearning algorithms indiscriminately modify edges or nodes from well-trained models without considering the potential impact of such structural modifications on fairness. For example, forgetting links between nodes with different genders in a social network may exacerbate group disparities, leading to significant fairness concerns. To address these challenges, we propose a novel approach that jointly optimizes the graph structure and the corresponding model for fair unlearning tasks. Specifically,our approach rewires the graph to enhance unlearning efficiency by removing redundant edges that hinder forgetting while preserving fairness through targeted edge augmentation. Additionally, we introduce a worst-case evaluation mechanism to assess the reliability of fair unlearning performance. Extensive experiments on real-world datasets demonstrate the effectiveness of the proposed approach in achieving superior unlearning outcomes.

@article{chen2025_2503.18197,
  title={ FROG: Fair Removal on Graphs },
  author={ Ziheng Chen and Jiali Cheng and Gabriele Tolomei and Sijia Liu and Hadi Amiri and Yu Wang and Kaushiki Nag and Lu Lin },
  journal={arXiv preprint arXiv:2503.18197},
  year={ 2025 }
}