mlsanityData to 7 Oct 2026

CoG: a Two-View Co-training Framework for Defending Adversarial Attacks on Graph

arXiv 2109.05558 ↗First posted 12 Sep 2021cs.LG cs.CRcited by 1

Not on the map. Why?

Abstract (arXiv)

Graph neural networks exhibit remarkable performance in graph data analysis. However, the robustness of GNN models remains a challenge. As a result, they are not reliable enough to be deployed in critical applications. Recent studies demonstrate that GNNs could be easily fooled with adversarial perturbations, especially structural perturbations. Such vulnerability is attributed to the excessive dependence on the structure information to make predictions. To achieve better robustness, it is desirable to build the prediction of GNNs with more comprehensive features. Graph data, in most cases, has two views of information, namely structure information and feature information. In this paper, we propose CoG, a simple yet effective co-training framework to combine these two views for the purpose of robustness. CoG trains sub-models from the feature view and the structure view independently and allows them to distill knowledge from each other by adding their most confident unlabeled data into the training set. The orthogonality of these two views diversifies the sub-models, thus enhancing the robustness of their ensemble. We evaluate our framework on three popular datasets, and results show that CoG significantly improves the robustness of graph models against adversarial attacks without sacrificing their performance on clean data. We also show that CoG still achieves good robustness when both node features and graph structures are perturbed.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 40 references that are in the map. First posted on arXiv 12 Sep 2021.

Builds on

22 of 40 references.

References · 22

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2017On Calibration of Modern Neural Networkscited by 4,860
  5. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  6. 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 420
  7. 2018Adversarial Attacks on Neural Networks for Graph Datacited by 395
  8. 2020Graph Structure Learning for Robust Graph Neural Networkscited by 368
  9. 2018Adversarial Attack on Graph Structured Datacited by 300
  10. 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
  11. 2019Improving Adversarial Robustness via Promoting Ensemble Diversitycited by 213
  12. 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
10 more
  1. 2020GNNGuard: Defending Graph Neural Networks against Adversarial Attackscited by 195
  2. 2017The Space of Transferable Adversarial Examplescited by 156
  3. 2020Learning to Drop: Robust Graph Neural Network via Topological Denoisingcited by 127
  4. 2020Node Similarity Preserving Graph Convolutional Networkscited by 112
  5. 2018Adversarial Attacks on Node Embeddings via Graph Poisoningcited by 109
  6. 2020DeepRobust: A PyTorch Library for Adversarial Attacks and Defensescited by 78
  7. 2020DVERGE: Diversifying Vulnerabilities for Enhanced Robust Generation of Ensemblescited by 73
  8. 2019Improving Adversarial Robustness of Ensembles with Diversity Trainingcited by 69
  9. 2019Are Graph Neural Networks Miscalibrated?cited by 14
  10. 2020Uncertainty-Matching Graph Neural Networks to Defend Against Poisoning Attackscited by 7

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.