dorsal/arxiv
View SchemaFairGU: Fairness-aware Graph Unlearning in Social Network
| Authors | Renqiang Luo, Yongshuai Yang, Huafei Huang, Qing Qing, Mingliang Hou, Ziqi Xu, Yi Yu, Jingjing Zhou, Feng Xia |
|---|---|
| Categories | |
| ArXiv ID | 2601.09469vv1 |
| URL | https://arxiv.org/abs/2601.09469 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
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.
{
"annotation_id": "b5661d29-9459-446f-aca2-56868a6aafb9",
"date_created": "2026-02-17T05:53:20.295000Z",
"date_modified": "2026-02-17T05:53:20.295000Z",
"file_hash": "3a078c6b4189199bd047e87df5e2a7db03f0609f4d7205f0ed9a105105103f1b",
"private": false,
"record": {
"abstract": "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.",
"arxiv_id": "2601.09469",
"authors": [
"Renqiang Luo",
"Yongshuai Yang",
"Huafei Huang",
"Qing Qing",
"Mingliang Hou",
"Ziqi Xu",
"Yi Yu",
"Jingjing Zhou",
"Feng Xia"
],
"categories": [
"cs.LG",
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "FairGU: Fairness-aware Graph Unlearning in Social Network",
"url": "https://arxiv.org/abs/2601.09469",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "87dbe436-b9a9-4f0f-8dba-dcd572a74fbd",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}