A dynamic ensemble learning model for robust Graph Neural Networks

Chenyu Zhou, Yabin Peng, Wei Huang, Xinyuan Miao, Yi Cao, Xinghao Wang, Xianglong Kong

Abstract: Recent studies have shown that Graph Neural Networks (GNNs) are vulnerable to adversarial attacks. While various defense models have been proposed, they often fail to account for the variability in both data and attacks, limiting their effectiveness in dynamic environments. Therefore, we propose DERG, a dynamic ensemble learning model for robust GNNs, which leverages multiple graph data and dynamically changing submodels for defense. Specifically, we first propose the graph sampling strategy to purify the perturbed graph, and generate multiple subgraphs to simulate the various potential variations that may occur in the graph. Then, we propose the mutual information-based diversity enhancement strategy to increase the variability among submodels, ensuring that each submodel focuses on a distinct defense direction and avoids being deceived by the same attack. Finally, we propose the game theory-based decision strategy to dynamically assign weights to submodels, with the goal of selecting the optimal submodels for different scenarios and adapting to the changing environment. Experiments on widely used datasets demonstrate that DERG exhibits significant robustness against a wide range of attacks, including graph modification attacks, backdoor poisoning attacks, and double attacks.

External IDs:dblp:journals/nn/ZhouPHMCWK25