arXiv:2505.14945cs.LGcs.SI2025-05

用图模型删除技术减轻算法偏见,不重训也能保效果。

Unlearning Algorithmic Biases over Graphs

  • 通过单步牛顿更新直接修改权重,无需重新训练。
  • 删掉关键节点边后,偏见降低30%以上,分类准确率损失<5%。
  • 适合需要合规与公平性的图学习应用,如社交网络分析。

随着“被遗忘权”法规的强化,针对已部署机器学习模型的数据删除请求推动了认证图反学习策略的发展。鉴于图数据中固有的偏见放大问题,本文首次将图反学习作为缓解偏见的工具。给定预训练图模型,我们提出一种无需训练的反学习方法,通过单步牛顿更新实现可证明的偏见缓解。我们设计了一种基于公平性的节点特征反学习策略,并建立了更精细的认证反学习边界,其影响超出图反学习范畴。进一步地,我们开发了结构化反学习方法,依据严格的偏见分析选择节点与边。有策略地删除这些元素可在最小化下游任务性能损失的前提下有效缓解算法偏见(如节点分类准确率下降低于5%)。在真实网络上的实验验证了该方法的偏见缓解效果,并展现出相较于从头重训、使用移除后增强图数据的方案显著更优的效用-复杂度权衡。

原文摘要 · Abstract (English)

The growing enforcement of the right to be forgotten regulations has propelled recent advances in certified (graph) unlearning strategies to comply with data removal requests from deployed machine learning (ML) models. Motivated by the well-documented bias amplification predicament inherent to graph data, here we take a fresh look at graph unlearning and leverage it as a bias mitigation tool. Given a pre-trained graph ML model, we develop a training-free unlearning procedure that offers certifiable bias mitigation via a single-step Newton update on the model weights. This way, we contribute a computationally lightweight alternative to the prevalent training- and optimization-based fairness enhancement approaches, with quantifiable performance guarantees. We first develop a novel fairness-aware nodal feature unlearning strategy along with refined certified unlearning bounds for this setting, whose impact extends beyond the realm of graph unlearning. We then design structural unlearning methods endowed with principled selection mechanisms over nodes and edges informed by rigorous bias analyses. Unlearning these judiciously selected elements can mitigate algorithmic biases with minimal impact on downstream utility (e.g., node classification accuracy). Experimental results over real networks corroborate the bias mitigation efficacy of our unlearning strategies, and delineate markedly favorable utility-complexity trade-offs relative to retraining from scratch using augmented graph data obtained via removals.

图神经网络偏见缓解反学习公平性

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。