Pith. sign in

REVIEW 2 cited by

A Survey of Adversarial Learning on Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.05730 v3 pith:QOK7UN43 submitted 2020-03-10 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords graphadversariallearningtasksworksanalysisattackcomprehensive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep learning models on graphs have achieved remarkable performance in various graph analysis tasks, e.g., node classification, link prediction, and graph clustering. However, they expose uncertainty and unreliability against the well-designed inputs, i.e., adversarial examples. Accordingly, a line of studies has emerged for both attack and defense addressed in different graph analysis tasks, leading to the arms race in graph adversarial learning. Despite the booming works, there still lacks a unified problem definition and a comprehensive review. To bridge this gap, we investigate and summarize the existing works on graph adversarial learning tasks systemically. Specifically, we survey and unify the existing works w.r.t. attack and defense in graph analysis tasks, and give appropriate definitions and taxonomies at the same time. Besides, we emphasize the importance of related evaluation metrics, investigate and summarize them comprehensively. Hopefully, our works can provide a comprehensive overview and offer insights for the relevant researchers. Latest advances in graph adversarial learning are summarized in our GitHub repository https://github.com/EdisonLeeeee/Graph-Adversarial-Learning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PEANUT: Perturbations by Eigenvector Alignment for Attacking Graph Neural Networks Under Topology-Driven Message Passing

    cs.LG 2026-03 conditional novelty 6.0 of 10

    Injecting virtual nodes along the dominant eigenvector of a GNN's own output embeddings degrades task performance in a single black-box query, with no gradients or surrogate models.

  2. Budgeted Indirect Adversarial Attack on Graph-Based Anomaly Detection in Sensor Networks

    cs.LG 2025-09 conditional novelty 5.0 of 10

    BETA, a budget-limited indirect attack, uses a graph explainer and centrality ranking to pick sensors to perturb, cutting F1 scores of GDN and TopoGDN anomaly detectors by large margins across three sensor datasets.

Pith tools