mlsanityData to 7 Oct 2026

Spatio-Temporal Sparsification for General Robust Graph Convolution Networks

arXiv 2103.12256 ↗First posted 23 Mar 2021cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have attracted increasing attention due to its successful applications on various graph-structure data. However, recent studies have shown that adversarial attacks are threatening the functionality of GNNs. Although numerous works have been proposed to defend adversarial attacks from various perspectives, most of them can be robust against the attacks only on specific scenarios. To address this shortage of robust generalization, we propose to defend the adversarial attacks on GNN through applying the Spatio-Temporal sparsification (called ST-Sparse) on the GNN hidden node representation. ST-Sparse is similar to the Dropout regularization in spirit. Through intensive experiment evaluation with GCN as the target GNN model, we identify the benefits of ST-Sparse as follows: (1) ST-Sparse shows the defense performance improvement in most cases, as it can effectively increase the robust accuracy by up to 6% improvement; (2) ST-Sparse illustrates its robust generalization capability by integrating with the existing defense methods, similar to the integration of Dropout into various deep learning models as a standard regularization technique; (3) ST-Sparse also shows its ordinary generalization capability on clean datasets, in that ST-SparseGCN (the integration of ST-Sparse and the original GCN) even outperform the original GCN, while the other three representative defense methods are inferior to the original GCN.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 33 references that are in the map. First posted on arXiv 23 Mar 2021.

Builds on

25 of 33 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  5. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  6. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
  7. 2018Robustness May Be at Odds with Accuracycited by 873
  8. 2018Adversarial Attacks on Neural Networks for Graph Datacited by 395
  9. 2018Deep Learning on Graphs: A Surveycited by 393
  10. 2018Adversarial Attack on Graph Structured Datacited by 300
  11. 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
  12. 2019Adversarial Attacks and Defenses in Images, Graphs and Text: A Reviewcited by 234
13 more
  1. 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
  2. 2018Adversarial Attack and Defense on Graph Data: A Surveycited by 166
  3. 2019Graph Adversarial Training: Dynamically Regularizing Based on Graph Structurecited by 93
  4. 2020DeepRobust: A PyTorch Library for Adversarial Attacks and Defensescited by 78
  5. 2016Hiding Individuals and Communities in a Social Networkcited by 77
  6. 2018Sparse DNNs with Improved Adversarial Robustnesscited by 71
  7. 2019Certifiable Robustness to Graph Perturbationscited by 62
  8. 2019Enhancing Adversarial Defense by k-Winners-Take-Allcited by 51
  9. 2019How Can We Be So Dense? The Benefits of Using Highly Sparse Representationscited by 45
  10. 2020Adversarial Attacks and Defenses on Graphs: A Review, A Tool and Empirical Studiescited by 42
  11. 2019The Search for Sparse, Robust Neural Networkscited by 11
  12. 2019Can Adversarial Network Attack be Defended?cited by 10
  13. 2019Adversarial Defense Framework for Graph Neural Networkcited by 8

Built on by

Not cited yet.