TY - JOUR
T1 - Graph Unlearning for MLaaS
T2 - Toward Flexible Privacy Adjustment via Influenced Subgraph
AU - Li, Yang
AU - Zhao, Yi
AU - Tan, Qi
AU - Wang, Yinggui
AU - Wang, Lei
AU - Wei, Tao
AU - Zhu, Min
AU - Xu, Ke
AU - Zhao, Youjian
N1 - Publisher Copyright:
© 2004 IEEE.
PY - 2026/9/1
Y1 - 2026/9/1
N2 - Graph unlearning focuses on removing specific information from graph neural networks (GNNs). Existing methods often assume full access to training data, which is impractical in machine learning-as-a-service (MLaaS) scenarios, where data owners, model developers, and service providers operate separately. Since service providers typically lack access to training data, graph unlearning can only be performed by model developers. In this paper, we introduce an innovative subgraph-based certified graph unlearning (SCGU) method for MLaaS scenarios, enabling service providers to directly modify model parameters to achieve graph unlearning. Specifically, we first define the influenced subgraph, which is only closely related to the unlearning target. Based on the message-passing mechanism of GNNs, we then localize the computation of the gradient difference to the influenced subgraph. Moreover, we introduce an indicator, L-CODEC, to identify the most important parameters for unlearning and compute only their Hessian matrix via finite differences, thereby localizing all parameter estimation within the influenced subgraph. Once an unlearning request is received, the service provider only requires the influenced subgraph to compute relevant variables and then directly modifies the model parameters to achieve graph unlearning. We evaluate the model utility, unlearning efficiency, and efficacy of our SCGU across multiple datasets and GNN architectures. Experimental results show that SCGU is at least 4 times faster than retraining, achieves a parameter approximation to the retrained model that is 3%- 5% closer, and outperforms all baselines except retraining in model utility and unlearning efficacy across most scenarios.
AB - Graph unlearning focuses on removing specific information from graph neural networks (GNNs). Existing methods often assume full access to training data, which is impractical in machine learning-as-a-service (MLaaS) scenarios, where data owners, model developers, and service providers operate separately. Since service providers typically lack access to training data, graph unlearning can only be performed by model developers. In this paper, we introduce an innovative subgraph-based certified graph unlearning (SCGU) method for MLaaS scenarios, enabling service providers to directly modify model parameters to achieve graph unlearning. Specifically, we first define the influenced subgraph, which is only closely related to the unlearning target. Based on the message-passing mechanism of GNNs, we then localize the computation of the gradient difference to the influenced subgraph. Moreover, we introduce an indicator, L-CODEC, to identify the most important parameters for unlearning and compute only their Hessian matrix via finite differences, thereby localizing all parameter estimation within the influenced subgraph. Once an unlearning request is received, the service provider only requires the influenced subgraph to compute relevant variables and then directly modifies the model parameters to achieve graph unlearning. We evaluate the model utility, unlearning efficiency, and efficacy of our SCGU across multiple datasets and GNN architectures. Experimental results show that SCGU is at least 4 times faster than retraining, achieves a parameter approximation to the retrained model that is 3%- 5% closer, and outperforms all baselines except retraining in model utility and unlearning efficacy across most scenarios.
KW - MLaaS
KW - Machine learning
KW - graph neural networks
KW - graph unlearning
KW - security and protection
UR - https://www.scopus.com/pages/publications/105045723508
U2 - 10.1109/TDSC.2026.3715465
DO - 10.1109/TDSC.2026.3715465
M3 - Article
AN - SCOPUS:105045723508
SN - 1545-5971
VL - 23
SP - 11598
EP - 11613
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
IS - 5
ER -