Gradient Rewiring for Editable Graph Neural Network Training
Not on the map. Why?
Abstract (arXiv)
Deep neural networks are ubiquitously adopted in many applications, such as computer vision, natural language processing, and graph analytics. However, well-trained neural networks can make prediction errors after deployment as the world changes. textitModel editing involves updating the base model to correct prediction errors with less accessible training data and computational resources. Despite recent advances in model editors in computer vision and natural language processing, editable training in graph neural networks (GNNs) is rarely explored. The challenge with editable GNN training lies in the inherent information aggregation across neighbors, which can lead model editors to affect the predictions of other nodes unintentionally. In this paper, we first observe the gradient of cross-entropy loss for the target node and training nodes with significant inconsistency, which indicates that directly fine-tuning the base model using the loss on the target node deteriorates the performance on training nodes. Motivated by the gradient inconsistency observation, we propose a simple yet effective underlineGradient underlineRewiring method for underlineEditable graph neural network training, named GRE. Specifically, we first store the anchor gradient of the loss on training nodes to preserve the locality. Subsequently, we rewire the gradient of the loss on the target node to preserve performance on the training node using anchor gradient. Experiments demonstrate the effectiveness of GRE on various model architectures and graph datasets in terms of multiple editing situations. The source code is available at urlhttps://github.com/zhimengj0326/Gradientrewiringediting
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 21 Oct 2024.
Builds on
28 of 42 references.
References · 28
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2021Editing Factual Knowledge in Language Modelscited by 548
- 2019Meta-Learning with Implicit Gradientscited by 523
- 2021Fast Model Editing at Scalecited by 491
16 more
- 2022Memory-Based Model Editing at Scalecited by 443
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2021Gradient Projection Memory for Continual Learningcited by 338
- 2017Fake News Detection on Social Media: A Data Mining Perspectivecited by 334
- 2023Transformer-Patcher: One Mistake worth One Neuroncited by 196
- 2019Adaptive Gradient-Based Meta-Learning Methodscited by 183
- 2020Editable Neural Networkscited by 154
- 2021Graph Condensation for Graph Neural Networkscited by 150
- 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
- 2021Cross-Domain Gradient Discrepancy Minimization for Unsupervised Domain Adaptationcited by 67
- 2022A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinkingcited by 56
- 2022FMP: Toward Fair Graph Message Passing against Topology Biascited by 35
- 2023Graph Mixup with Soft Alignmentscited by 15
- 2023Class Gradient Projection For Continual Learningcited by 11
- 2024TinyGraph: Joint Feature and Node Condensation for Graph Neural Networkscited by 5
- 2023Editable Graph Neural Network for Node Classificationscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.