arrow
返回

Robust Knowledge Adaptation for Dynamic Graph Neural Networks

delete2024-11-01
delete4
delete
OA
AI
H
Hanjie Li
C
Changsheng Li *
K
Kaituo Feng
袁野 (Ye Yuan)
王国仁 (Guoren Wang)
H
Hongyuan Zha
DOI:10.1109/TKDE.2024.3388453delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Graph structured data often possess dynamic characters in nature, such as the addition of links and nodes, in many real-world applications. Recent years have witnessed the increasing attentions paid to dynamic graph neural networks for modelling graph data. However, almost all existing approaches operate under the assumption that, upon the establishment of a new link, the embeddings of the neighboring nodes should undergo updates to learn temporal dynamics. Nevertheless, these approaches face the following limitation: If the node introduced by a new connection contains noisy information, propagating its knowledge to other nodes becomes unreliable and may even lead to the collapse of the model. In this paper, we propose Ada-DyGNN: a robust knowledge Adaptation framework via reinforcement learning for Dynamic Graph Neural Networks. In contrast to previous approaches, which update the embeddings of the neighbor nodes immediately after adding a new link, Ada-DyGNN adaptively determines which nodes should be updated. Considering that the decision to update the embedding of one neighbor node can significantly impact other neighbor nodes, we conceptualize the node update selection as a sequence decision problem and employ reinforcement learning to address it effectively. By this means, we can adaptively propagate knowledge to other nodes for learning robust node embedding representations. To the best of our knowledge, our approach constitutes the first attempt to explore robust knowledge adaptation via reinforcement learning specifically tailored for dynamic graph neural networks. Extensive experiments on three benchmark datasets demonstrate that Ada-DyGNN achieves the state-of-the-art performance. In addition, we conduct experiments by introducing different degrees of noise into the dataset, quantitatively and qualitatively illustrating the robustness of Ada-DyGNN.
Keyword:
Graph neural networks
Knowledge engineering
Noise
Adaptation models
Reinforcement learning
Noise measurement
Data models
Dynamic graph neural networks
reinforcement learning
robust knowledge adaptation

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.8K
被引数:
3.2W

机构

T
The Chinese University of Hong Kong, Shenzhen
学者数:
4.3K
论文数: 4.0K
被引数: 7
B
beijing institute of technology
学者数:
5.5W
论文数: 4.0W
被引数: 63
引用论文

引用论文

Gold or silver deposited on layered manganese oxide: a functional model for the water-oxidizing complex in photosystem II
err2013-07-30
err0
PREAI
errMohammad Mahdi Najafpour; Fahimeh Rahimi; Davood Jafarian Sedigh; Robert Carpentier; Julian J. Eaton-Rye; Jian-Ren Shen; Suleyman I. Allakhverdiev
err分享
err收藏
Part of Speech Tagging Using Part of Speech Sequence Graph
err2021-11-14
err0
PREAI
errPejman Gholami-Dastgerdi; Mohammad-Reza Feizi-Derakhshi
err分享
err收藏
Mitochondrial Quality Control Governed by Ubiquitin
err2020-04-24
err0
errOAAI
errSonia Ravanelli; Fabian den Brave; Thorsten Hoppe
err分享
err收藏
Quantitative Resilience Assessment of GPS, IMU, and LiDAR Sensor Fusion for Vehicle Localization Using Resilience Engineering Theory
err2023-04-11
err0
PREAI
errJohan Fanas Rojas; Parth Kadav; Nicolas Brown; Rick Meyer; Thomas Bradley; Zachary Asher
err分享
err收藏
Deep Reinforcement Learning: A Brief Survey深度强化学习: 简要综述
err2017-11-01
err2.4K
errOAAI
errArulkumaran, Kai; Deisenroth, Marc Peter; Brundage, Miles; Bharath, Anil Anthony
err分享
err收藏
学者 查看更多内容