Fixed-point graph convolutional networks against adversarial attacks
Not on the map. Why?
Abstract (arXiv)
Adversarial attacks present a significant risk to the integrity and performance of graph neural networks, particularly in tasks where graph structure and node features are vulnerable to manipulation. In this paper, we present a novel model, called fixed-point iterative graph convolutional network (Fix-GCN), which achieves robustness against adversarial perturbations by effectively capturing higher-order node neighborhood information in the graph without additional memory or computational complexity. Specifically, we introduce a versatile spectral modulation filter and derive the feature propagation rule of our model using fixed-point iteration. Unlike traditional defense mechanisms that rely on additional design elements to counteract attacks, the proposed graph filter provides a flexible-pass filtering approach, allowing it to selectively attenuate high-frequency components while preserving low-frequency structural information in the graph signal. By iteratively updating node representations, our model offers a flexible and efficient framework for preserving essential graph information while mitigating the impact of adversarial manipulation. We demonstrate the effectiveness of the proposed model through extensive experiments on various benchmark graph datasets, showcasing its resilience against adversarial attacks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 42 references that are in the map. First posted on arXiv 29 Oct 2025.
Builds on
25 of 42 references.
References · 25
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2019Multi-scale Attributed Node Embeddingcited by 548
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
- 2018T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Predictioncited by 401
- 2018Adversarial Attacks on Neural Networks for Graph Datacited by 397
- 2020Graph Structure Learning for Robust Graph Neural Networkscited by 371
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2022GraphCast: Learning skillful medium-range global weather forecastingcited by 267
13 more
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2020GNNGuard: Defending Graph Neural Networks against Adversarial Attackscited by 195
- 2018Adversarial Attack and Defense on Graph Data: A Surveycited by 167
- 2020Node Similarity Preserving Graph Convolutional Networkscited by 112
- 2021Graph Representation Learning in Biomedicinecited by 80
- 2016Hiding Individuals and Communities in a Social Networkcited by 77
- 2021Elastic Graph Neural Networkscited by 67
- 2020Reliable Graph Neural Networks via Robust Aggregationcited by 43
- 2022EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networkscited by 26
- 2021How does Heterophily Impact the Robustness of Graph Neural Networks? Theoretical Connections and Practical Implicationscited by 21
- 2023Robust Mid-Pass Filtering Graph Convolutional Networkscited by 17
- 2023Illuminati: Towards Explaining Graph Neural Networks for Cybersecurity Analysiscited by 14
- 2023Efficient Low-Rank GNN Defense Against Structural Attackscited by 2
Built on by
Not cited yet.