gnn-adversarial-robustness-eval
Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach — Zhao et al. (2023) (arXiv:2310.06396, 2023)
What this evaluates
Evaluates the adversarial robustness of Graph Neural Networks against node/edge injection and modification attacks, comparing Hamiltonian-based models against standard GNNs and defense baselines.
Datasets
- Cora, Citeseer, Pubmed, Coauthor, Computers, Ogbn-Arxiv, Polblogs — total ?; splits: train (-1), val (-1), test (-1)
Metrics
accuracy (primary) — range: [0, 1]
- Standard node classification accuracy: the fraction of correctly predicted node labels out of the total test nodes. Computed as (predictions == labels).mean().
Input / output format
Input: Graph adjacency matrix and node feature matrix, potentially perturbed by adversarial attacks (node/edge injection or edge modification).
Output: Predicted class label for each node in the graph.
Scoring recipe
def compute_accuracy(predictions, labels):
correct = (predictions == labels).sum()
total = len(labels)
return correct / total
Common pitfalls
- Black-box attacks use a surrogate model to generate perturbations, which may differ from white-box gradient-based attacks.
- Perturbation rates for modification attacks are varied in 5% increments from 0% to 25%, not fixed.
- Dataset splits follow an inductive 60/10/20 protocol for some datasets, while others use standard transductive splits.
Evidence (verbatim from paper)
Our datasets include citation networks (Cora, Citeseer, Pubmed) [51], the Coauthor academic network [52], an Amazon co-purchase network (Computers) [52], and the Ogbn-Arxiv dataset [53]. For inductive learning, we follow the data splitting method in the GRB framework [54], with 60% for training, 10% for validation, and 20% for testing.
Citation
@misc{zhao2023hamiltoniangnn,
title={Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach},
author={Zhao et al. (2023)},
year={2023},
note={arXiv:2310.06396}
}
1---2name: gnn-adversarial-robustness-eval3description: Evaluates the adversarial robustness of Graph Neural Networks against node/edge injection and modification attacks, comparing Hamiltonian-based models against standard GNNs and defense baselines. Use when the user wants to benchmark on Cora, Citeseer, Pubmed, Coauthor, Computers, Ogbn-Arxiv, Polblogs, or asks about evaluating this task. Reports accuracy.4---56# gnn-adversarial-robustness-eval78> Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach — Zhao et al. (2023) (arXiv:2310.06396, 2023)910## What this evaluates1112Evaluates the adversarial robustness of Graph Neural Networks against node/edge injection and modification attacks, comparing Hamiltonian-based models against standard GNNs and defense baselines.1314## Datasets1516- **Cora, Citeseer, Pubmed, Coauthor, Computers, Ogbn-Arxiv, Polblogs** — total ?; splits: train (-1), val (-1), test (-1)1718## Metrics1920- `accuracy` **(primary)** — range: [0, 1]21 - Standard node classification accuracy: the fraction of correctly predicted node labels out of the total test nodes. Computed as (predictions == labels).mean().2223## Input / output format2425**Input**: Graph adjacency matrix and node feature matrix, potentially perturbed by adversarial attacks (node/edge injection or edge modification).2627**Output**: Predicted class label for each node in the graph.2829## Scoring recipe3031```python32def compute_accuracy(predictions, labels):33 correct = (predictions == labels).sum()34 total = len(labels)35 return correct / total36```3738## Common pitfalls3940- Black-box attacks use a surrogate model to generate perturbations, which may differ from white-box gradient-based attacks.41- Perturbation rates for modification attacks are varied in 5% increments from 0% to 25%, not fixed.42- Dataset splits follow an inductive 60/10/20 protocol for some datasets, while others use standard transductive splits.4344## Evidence (verbatim from paper)4546> Our datasets include citation networks (Cora, Citeseer, Pubmed) [51], the Coauthor academic network [52], an Amazon co-purchase network (Computers) [52], and the Ogbn-Arxiv dataset [53]. For inductive learning, we follow the data splitting method in the GRB framework [54], with 60% for training, 10% for validation, and 20% for testing.4748## Citation4950```bibtex51@misc{zhao2023hamiltoniangnn,52 title={Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach},53 author={Zhao et al. (2023)},54 year={2023},55 note={arXiv:2310.06396}56}57```5859- arXiv: 2310.06396