Adding perturbations directly to every hidden embedding of a GNN is claimed to subsume existing feature-, edge-, and weight-perturbation defenses, but the claim rests on simplifications that the experiments do not actually test.
Batch Virtual Adversarial Training for Graph Convolutional Networks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We present batch virtual adversarial training (BVAT), a novel regularization method for graph convolutional networks (GCNs). BVAT addresses the shortcoming of GCNs that do not consider the smoothness of the model's output distribution against local perturbations around the input. We propose two algorithms, sample-based BVAT and optimization-based BVAT, which are suitable to promote the smoothness of the model for graph-structured data by either finding virtual adversarial perturbations for a subset of nodes far from each other or generating virtual adversarial perturbations for all nodes with an optimization process. Extensive experiments on three citation network datasets Cora, Citeseer and Pubmed and a knowledge graph dataset Nell validate the effectiveness of the proposed method, which establishes state-of-the-art results in the semi-supervised node classification tasks.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Unifying Adversarial Perturbation for Graph Neural Networks
Adding perturbations directly to every hidden embedding of a GNN is claimed to subsume existing feature-, edge-, and weight-perturbation defenses, but the claim rests on simplifications that the experiments do not actually test.