2021
DOI: 10.1109/tkde.2019.2957786
|View full text |Cite
|
Sign up to set email alerts
|

Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure

Abstract: Recent efforts show that neural networks are vulnerable to small but intentional perturbations on input features in visual classification tasks. Due to the additional consideration of connections between examples (e.g., articles with citation link tend to be in the same class), graph neural networks could be more sensitive to the perturbations, since the perturbations from connected examples exacerbate the impact on a target example. Adversarial Training (AT), a dynamic regularization technique, can resist the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
93
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 143 publications
(94 citation statements)
references
References 32 publications
1
93
0
Order By: Relevance
“…Some defending works have already appeared. Many of them are inspired by the popular defense methodology in image classification, using adversarial training to protect GNN models, (Feng et al, 2019;Xu et al, 2019), which provides moderate robustness.…”
Section: Defending Graph Neural Networkmentioning
confidence: 99%
“…Some defending works have already appeared. Many of them are inspired by the popular defense methodology in image classification, using adversarial training to protect GNN models, (Feng et al, 2019;Xu et al, 2019), which provides moderate robustness.…”
Section: Defending Graph Neural Networkmentioning
confidence: 99%
“…These links which aim characterize anomalous objects and relationships [8]. Graph structure can also be used in adversarial training [9].…”
Section: Introductionmentioning
confidence: 99%
“…The framework encodes the topological structure and node content in a graph to a compact representation, on which a decoder is trained to reconstruct the graph structure. Freund et al [28] proposed an approach based on adversarial regularization of the latent space for generating graph structured data. They could demonstrate the ability of the model to embed graph-based data coherently, and at the same time, generate meaningful samples.…”
Section: Related Workmentioning
confidence: 99%