Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Power up! Robust Graph Convolutional Network via Graph Powering

About

Graph convolutional networks (GCNs) are powerful tools for graph-structured data. However, they have been recently shown to be vulnerable to topological attacks. To enhance adversarial robustness, we go beyond spectral graph theory to robust graph theory. By challenging the classical graph Laplacian, we propose a new convolution operator that is provably robust in the spectral domain and is incorporated in the GCN architecture to improve expressivity and interpretability. By extending the original graph to a sequence of graphs, we also propose a robust training paradigm that encourages transferability across graphs that span a range of spatial and spectral characteristics. The proposed approaches are demonstrated in extensive experiments to simultaneously improve performance in both benign and adversarial situations.

Ming Jin, Heng Chang, Wenwu Zhu, Somayeh Sojoudi• 2019

Related benchmarks

TaskDatasetResultRank
Node ClassificationPubmed
Accuracy79.6
742
Node ClassificationCora-ML
Accuracy81.89
228
Node ClassificationReddit (test)
Accuracy74
134
Node ClassificationACTIVSg500
Accuracy96.23
18
Node ClassificationACTIVSg200
Accuracy79.89
18
Node ClassificationIEEE 118-Bus
Accuracy82.19
16
Node ClassificationACTIVSg 2000
Accuracy86.87
16
Node ClassificationPubmed
Accuracy (0% Ptb)77.92
6
Node ClassificationREDDIT
Accuracy (0% Ptb)95.91
6
Node ClassificationYelp-Large (test)
Accuracy72.09
6
Showing 10 of 12 rows

Other info

Follow for update