Efficient Knowledge Graph Unlearning with Zeroth-order Information
Yang Xiao, Ruimeng Ye, Bohan Liu, Xiaolong Ma, Bo Hui

TL;DR
This paper introduces a novel, efficient method for unlearning data from knowledge graphs by approximating influence functions using zeroth-order optimization, significantly reducing computational costs while maintaining high unlearning quality.
Contribution
The paper proposes the first efficient KG unlearning algorithm leveraging zeroth-order optimization and influence function approximation, addressing computational challenges in large-scale graphs.
Findings
Outperforms existing methods in unlearning efficiency
Maintains high unlearning quality with reduced computation
Effective for large-scale knowledge graphs
Abstract
Due to regulations like the Right to be Forgotten, there is growing demand for removing training data and its influence from models. Since full retraining is costly, various machine unlearning methods have been proposed. In this paper, we firstly present an efficient knowledge graph (KG) unlearning algorithm. We remark that KG unlearning is nontrivial due to the distinctive structure of KG and the semantic relations between entities. Also, unlearning by estimating the influence of removed components incurs significant computational overhead when applied to large-scale knowledge graphs. To this end, we define an influence function for KG unlearning and propose to approximate the model's sensitivity without expensive computation of first-order and second-order derivatives for parameter updates. Specifically, we use Taylor expansion to estimate the parameter changes caused by data removal.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
