Pith. sign in

REVIEW 3 cited by

Adversarial Defense Framework for Graph Neural Network

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 1905.03679 v2 pith:A3OTBZQW submitted 2019-05-09 cs.LG cs.CRstat.ML

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

Graph neural network (GNN), as a powerful representation learning model on graph data, attracts much attention across various disciplines. However, recent studies show that GNN is vulnerable to adversarial attacks. How to make GNN more robust? What are the key vulnerabilities in GNN? How to address the vulnerabilities and defense GNN against the adversarial attacks? In this paper, we propose DefNet, an effective adversarial defense framework for GNNs. In particular, we first investigate the latent vulnerabilities in every layer of GNNs and propose corresponding strategies including dual-stage aggregation and bottleneck perceptron. Then, to cope with the scarcity of training data, we propose an adversarial contrastive learning method to train the GNN in a conditional GAN manner by leveraging the high-level graph representation. Extensive experiments on three public datasets demonstrate the effectiveness of DefNet in improving the robustness of popular GNN variants, such as Graph Convolutional Network and GraphSAGE, under various types of adversarial attacks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Under a fixed leakage-free protocol, NC→LP transfer reliably helps on homophilic graphs while LP→NC helps mainly when LP is easy and NC is unsaturated; homophily and CoTask Score guide mechanism choice.

  2. REGE: A Method for Incorporating Uncertainty in Graph Embeddings

    cs.LG 2024-12 conditional novelty 6.0 of 10

    REGE adds per-node uncertainty radii to graph embeddings and combines curriculum learning with conformal quantile regression to improve robustness to structural attacks.

  3. Intellectual Property in Graph-Based Machine Learning as a Service: Attacks and Defenses

    cs.CR 2025-08 conditional novelty 4.0 of 10

    A systematic review that organizes graph-ML IP protection into model-level and data-level attacks and defenses, and ships a benchmark library, PyGIP.

Pith tools