提出快速删除电动车充电站数据的图学习方法,保障隐私同时保持攻击定位准确
GDGU: A Gradient Difference-based Graph Unlearning Method for Cyberattack Localization in Electric Vehicle Charging Networks

- 基于梯度差异实现一次参数修正,快速消除指定充电桩数据影响
- 在多个电网网络上保持与重训练相当的攻击定位精度
- 速度比重新训练快10-12倍,内存占用远低于传统方法,适合实际部署
电动车充电站(EVCS)可能使配电馈线面临网络攻击。尽管机器学习方法(包括图神经网络)可定位受攻击节点,但数据共享与模型训练仍面临挑战。例如,隐私法规允许充电站所有者要求从已部署模型中删除其训练数据,但每次请求都重新训练成本过高。为此,我们研究用于EVCS网络攻击定位的图去学习(GU),将其建模为图级多标签分类任务下的特征级去学习问题。具体提出基于梯度差异的图去学习(GDGU),通过一阶参数修正消除目标数据的影响,该修正基于原始数据与仅移除目标充电站功率特征后的修改数据之间的梯度差异计算。随后,通过批量归一化再校准和简短恢复微调步骤恢复定位性能。我们在IEEE 34-bus、123-bus和8500节点配电网络上,针对三种图神经网络主干和累积去学习场景,将GDGU与两个二阶去学习基线对比。结果表明,GDGU在定位性能上匹配最强基线,遗忘保真度接近全重训练,同时去学习速度比从头重训练快10至12倍,且内存消耗远低于二阶基线。
原文摘要 · Abstract (English)
Electric vehicle charging stations (EVCSs) can expose distribution feeders to cyberattacks. While machine learning methods, including graph neural networks, can localize which bus is compromised, significant challenges remain in data sharing and model training. For example, privacy regulations grant EVCS owners the right to delete their training data from a deployed model, yet retraining from scratch on every request is computationally prohibitive. To address this, we study graph unlearning (GU) for EVCS cyberattack localization, formulated as a feature-level unlearning problem on a graph-level multi-label classification task. Specifically, we propose gradient difference-based graph unlearning (GDGU), which removes the influence of the requested deletion data through a first-order parameter correction. The correction is computed from the gradient difference between the original training data and a modified dataset in which only the charging power features at the requested EVCS buses are unlearned. Then, a batch-normalization recalibration and a brief recovery fine-tuning step are applied to restore localization utility. We benchmark GDGU against two second-order GU baselines on the IEEE 34-bus, 123-bus, and 8500-node distribution networks across three graph neural network backbones and cumulative unlearning scenarios. GDGU matches the strongest baseline on localization utility and reaches forgetting fidelity close to full-retraining, while unlearning 10 to 12 times faster than retraining from scratch and using far less memory than the second-order GU baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。