Fetching the paper…
Reading the bibliography…
Graph unlearning has emerged as a pivotal method to delete information from a pre-trained graph neural network (GNN).
S. Kullback and R. A. Leibler, “On information and sufficiency,” The annals of mathematical statistics , vol. 22, no. 1, pp. 79–86, 1951
1951
Earlier work this paper cites.
2015
Earlier work this paper cites.
N. Papernot, P. McDaniel, X. Wu, S. Jha, and A. Swami, “Distillation as a defense to adversarial perturbations against deep neural networks,” in 2016 IEEE symposium on security and privacy (SP) . IEEE, 2016, pp. 582–597
2016
Earlier work this paper cites.
Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in International conference on machine learning . PMLR, 2016, pp. 40–48
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations , 2016
2016
Earlier work this paper cites.
P. Voigt and A. Von dem Bussche, “The eu general data protection regulation (gdpr),” A Practical Guide, 1st Ed., Cham: Springer International Publishing , 2017
2017
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” stat , vol. 1050, no. 20, pp. 10–48 550, 2017
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
J. Wang, W. Bao, L. Sun, X. Zhu, B. Cao, and S. Y. Philip, “Private model compression via knowledge distillation,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 33, no. 01, 2019, pp. 1190–1197
2019
Earlier work this paper cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in International Conference on Learning Representations , 2019. [Online]. Available: https://openreview.net/forum?id=ryGs6iA5Km
2019
Earlier work this paper cites.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,” Advances in neural information processing systems , vol. 33, pp. 22 118–22 133, 2020
2020
Earlier work this paper cites.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE transactions on neural networks and learning systems , vol. 32, no. 1, pp. 4–24, 2020
2020
Earlier work this paper cites.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI open , vol. 1, pp. 57–81, 2020
2020
Earlier work this paper cites.
E. Goldman, “An introduction to the california consumer privacy act (ccpa),” Santa Clara Univ. Legal Studies Research Paper , 2020
2020
Earlier work this paper cites.
A. Golatkar, A. Achille, and S. Soatto, “Eternal sunshine of the spotless net: Selective forgetting in deep networks,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2020, pp. 9304–9312
2020
Cited alongside, same era.
X. Fu, J. Zhang, Z. Meng, and I. King, “Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding,” in Proceedings of The Web Conference 2020 , 2020, pp. 2331–2341
2020
Cited alongside, same era.
L. Bourtoule, V. Chandrasekaran, C. A. Choquette-Choo, H. Jia, A. Travers, B. Zhang, D. Lie, and N. Papernot, “Machine unlearning,” in 2021 IEEE Symposium on Security and Privacy (SP) , 2021, pp. 141–159
2021
Cited alongside, same era.
M. Ramezani, W. Cong, M. Mahdavi, M. Kandemir, and A. Sivasubramaniam, “Learn locally, correct globally: A distributed algorithm for training graph neural networks,” in International Conference on Learning Representations , 2021
2021
Cited alongside, same era.
C.-L. Wang, M. Huai, and D. Wang, “Inductive graph unlearning,” in USENIX Security Symposium , 2023
2023
Closest in time.
K. Koch and M. Soll, “No matter how you slice it: Machine unlearning with sisa comes at the expense of minority classes,” in 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML) , 2023, pp. 622–637
2023
Closest in time.
W. Cong and M. Mehrdad, “Efficiently forgetting what you have learned in graph representation learning via projection,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2023, pp. 6674–6703
2023
Closest in time.
J. Wu, Y. Yang, Y. Qian, Y. Sui, X. Wang, and X. He, “Gif: A general graph unlearning strategy via influence function,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 651–661
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. E. Olatunji, W. Nejdl, and M. Khosla, “Membership inference attack on graph neural networks,” in 2021 Third IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) . IEEE, 2021, pp. 11–20
2021
Cited alongside, same era.
J. Gou, B. Yu, S. J. Maybank, and D. Tao, “Knowledge distillation: A survey,” International Journal of Computer Vision , vol. 129, pp. 1789–1819, 2021
2021
Cited alongside, same era.
L. Wang and K.-J. Yoon, “Knowledge distillation and student-teacher learning for visual intelligence: A review and new outlooks,” IEEE transactions on pattern analysis and machine intelligence , vol. 44, no. 6, pp. 3048–3068, 2021
2021
Cited alongside, same era.
S. Neel, A. Roth, and S. Sharifi-Malvajerdi, “Descent-to-delete: Gradient-based methods for machine unlearning,” in Algorithmic Learning Theory . PMLR, 2021, pp. 931–962
2021
Cited alongside, same era.
T. Hoffmann and P. L. P. d. M. Vargas, “Lgpd et al.–report on the law of data disclosure in brazil,” University Of Passau Irdg Research Paper Series , no. 22-06, 2022
2022
Cited alongside, same era.
2022
Cited alongside, same era.
M. Chen, Z. Zhang, T. Wang, M. Backes, M. Humbert, and Y. Zhang, “Graph unlearning,” in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security , 2022, pp. 499–513
2022
Cited alongside, same era.
W. Cong and M. Mahdavi, “Grapheditor: An efficient graph representation learning and unlearning approach,” 2022
2022
Cited alongside, same era.
E. Chien, C. Pan, and M. Olgica, “Efficient model updates for approximate unlearning of graph-structured data,” in The Eleventh International Conference on Learning Representations , 2023. [Online]. Available: https://openreview.net/forum?id=fhcu4FBLciL
2023
Closest in time.
K. Wu, J. Shen, Y. Ning, T. Wang, and W. H. Wang, “Certified edge unlearning for graph neural networks,” in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , 2023, pp. 2606–2617
2023
Closest in time.
J. Cheng, G. Dasoulas, H. He, C. Agarwal, and M. Zitnik, “Gnndelete: A general strategy for unlearning in graph neural networks,” 2023
2023
Closest in time.
A. K. Tarun, V. S. Chundawat, M. Mandal, and M. Kankanhalli, “Fast yet effective machine unlearning,” IEEE Transactions on Neural Networks and Learning Systems , 2023
2023
Closest in time.
V. S. Chundawat, A. K. Tarun, M. Mandal, and M. Kankanhalli, “Can bad teaching induce forgetting? unlearning in deep networks using an incompetent teacher,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 37, no. 6, 2023, pp. 7210–7217
2023
Closest in time.
V. Chundawat, A. K. Tarun, M. Mandal, and M. Kankanhalli, “Zero-shot machine unlearning,” IEEE Transactions on Information Forensics and Security , vol. 18, pp. 2345–2354, 2023
2023
Closest in time.
A. K. Tarun, V. S. Chundawat, M. Mandal, and M. Kankanhalli, “Deep regression unlearning,” in International Conference on Machine Learning . PMLR, 2023, pp. 33 921–33 939
2023
Closest in time.
C. Pan, E. Chien, and O. Milenkovic, “Unlearning graph classifiers with limited data resources,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 716–726
2023
Closest in time.
X. Zhu, G. Li, and W. Hu, “Heterogeneous federated knowledge graph embedding learning and unlearning,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 2444–2454
2023
Closest in time.
Y. Dukler, B. Bowman, A. Achille, A. Golatkar, A. Swaminathan, and S. Soatto, “Safe: Machine unlearning with shard graphs,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2023, pp. 17 108–17 118
2023
Closest in time.