Topology-aware dynamic co-evolution for robust graph learning

Graph Neural Networks (GNNs) have achieved remarkable success in learning from graph-structured data. However, recent studies have revealed their vulnerability to adversarial attacks, where imperceptible perturbations to the graph structure can easily mislead predictions. Existing defense methods predominantly rely on global heuristic strategies, which often lead to over-smoothing in deep architectures and fail to capture localized, fine-grained structural anomalies. In this paper, we propose Topology-Aware Dynamic Co-evolution (TADC), a novel framework that reformulates graph defense as a closed-loop optimization process. Unlike static purification paradigms, TADC introduces a closed-loop dynamic co-evolution framework, in which graph topology and model parameters are jointly optimized through validation-guided meta-gradients, enabling continuous and adaptive structural refinement during training. To further ensure the reliability of topology updates, we identify the topology-agnostic limitation of conventional meta-gradients and propose a topology-aware gradient calibration mechanism, which incorporates structural priors to guide gradient directions toward more plausible and semantically consistent graph modifications. Concretely, TADC first localizes vulnerable nodes via a structural-semantic consistency probe and constructs an initialized graph through topology-aware refinement. It then performs structure decoupling to disentangle reliable and potentially adversarial edges into distinct channels. Building upon this decomposition, a fully differentiable attention-based architecture DeepGCN enables end-to-end optimization of the co-evolution process. Extensive experiments on multiple benchmark datasets demonstrate that TADC consistently outperforms state-of-the-art methods across various attack settings, with particularly pronounced advantages under strong adversarial perturbations and high perturbation rates. Our code is available at https://github.com/robustgcn/TADC.

Authors

Institutions

Publication Details

Journal
Neural Networks
Published
2026-10-14
DOI
https://doi.org/10.1016/j.neunet.2026.109736
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Topology-aware dynamic co-evolution for robust graph learning

Shuxia Lu, Bin Liu, Tingting Zhang, Mengru Wang
Neural Networks
Adversarial Robustness in Machine Learning
article

Topology-aware dynamic co-evolution for robust graph learning

Shuxia Lu, Bin Liu, Tingting Zhang, Mengru Wang
article en

Abstract

Graph Neural Networks (GNNs) have achieved remarkable success in learning from graph-structured data. However, recent studies have revealed their vulnerability to adversarial attacks, where imperceptible perturbations to the graph structure can easily mislead predictions. Existing defense methods predominantly rely on global heuristic strategies, which often lead to over-smoothing in deep architectures and fail to capture localized, fine-grained structural anomalies. In this paper, we propose Topology-Aware Dynamic Co-evolution (TADC), a novel framework that reformulates graph defense as a closed-loop optimization process. Unlike static purification paradigms, TADC introduces a closed-loop dynamic co-evolution framework, in which graph topology and model parameters are jointly optimized through validation-guided meta-gradients, enabling continuous and adaptive structural refinement during training. To further ensure the reliability of topology updates, we identify the topology-agnostic limitation of conventional meta-gradients and propose a topology-aware gradient calibration mechanism, which incorporates structural priors to guide gradient directions toward more plausible and semantically consistent graph modifications. Concretely, TADC first localizes vulnerable nodes via a structural-semantic consistency probe and constructs an initialized graph through topology-aware refinement. It then performs structure decoupling to disentangle reliable and potentially adversarial edges into distinct channels. Building upon this decomposition, a fully differentiable attention-based architecture DeepGCN enables end-to-end optimization of the co-evolution process. Extensive experiments on multiple benchmark datasets demonstrate that TADC consistently outperforms state-of-the-art methods across various attack settings, with particularly pronounced advantages under strong adversarial perturbations and high perturbation rates. Our code is available at https://github.com/robustgcn/TADC.

Neural NetworksVol. 206(Pt A)
Hebei University (CN), Tsinghua University (CN)
Openalex Percentile: Top 13%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.