Power up! Robust Graph Convolutional Network via Graph Powering
Abstract
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.
Benchmark Results
Tested on 2 datasets 1 baseline value reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 | |
| 95 | RGCN | 0.8801
±0.0047 best reported | best at pub: Deep Learning on Graphs: A Survey (2018) |
| 113 | MixHop | 0.8761
±0.0203 best reported | |
| 223 | SGC | 0.8509
±0.0648 best reported | best at pub: Deep Learning on Graphs: A Survey (2018) Difference within reported uncertainty; not counted as underperformance. |
| 435 | DeepWalk | 0.8290 best reported | best at pub: Geometric deep learning on graphs and manifolds using mixture model CNNs (2016) best today: Graph Representation Learning: A Survey (2019) |
| 490 | VPN | 0.8230
±0.0030 | This paper |
| 575 | vanilla GCN | 0.8150 | This paper |
| 600 | IGCN(AR) | 0.8110 | This paper |
| 632 | PowerLaplacian | 0.8050 | This paper |
| 677 | LNet | 0.7950
±0.0180 | This paper |
| 724 | MLP | 0.7768 | |
| 762 | Planetoid | 0.7570 | This paper |
| 775 | ICA | 0.7510 | This paper |
| 835 | LP | 0.6820 best reported | best at pub: Revisiting Semi-Supervised Learning with Graph Embeddings (ICML 2016) best today: Transformers from Diffusion: A Unified Framework for Neural Message Passing (JMLR 2024) |
| 875 | ManiReg | 0.6040
±0.0080 best reported | best at pub: Revisiting Semi-Supervised Learning with Graph Embeddings (ICML 2016) best today: Transformers from Diffusion: A Unified Framework for Neural Message Passing (JMLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 880 | SemiEmb | 0.5900 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 | |
| 70 | MixHop | 0.9004
±0.0141 best reported | best today: Language is All a Graph Needs (2023) Difference within reported uncertainty; not counted as underperformance. |
| 141 | SGC | 0.8832
±0.0055 best reported | best at pub: Deep Learning on Graphs: A Survey (2018) |
| 210 | MLP | 0.8690
±0.0074 | |
| 223 | DeepWalk | 0.8652
±0.0012 best reported | |
| 476 | VPN | 0.7980
±0.4000 | This paper |
| 543 | R-GCN | 0.7930
±0.3000 | This paper |
| 586 | vanilla GCN | 0.7900 | This paper |
| 655 | PowerLaplacian | 0.7830 | This paper |
| 656 | LNet | 0.7830
±0.3000 | This paper |
| 663 | IGCN(AR) | 0.7820 | This paper |
| 727 | Planetoid | 0.7720 | This paper |
| 811 | ICA | 0.7390 | This paper |
| 826 | SemiEmb | 0.7170 best reported | best at pub: Graph Attention Networks (ICLR 2017) |
| 831 | ManiReg | 0.7130
±0.0140 best reported | best at pub: Geometric deep learning on graphs and manifolds using mixture model CNNs (2016) best today: Discovering Data Geometry: Energy-Driven Neural Diffusion (ICLR 2023) Difference within reported uncertainty; not counted as underperformance. |
| 861 | LP | 0.6580 best reported | best at pub: Geometric deep learning on graphs and manifolds using mixture model CNNs (2016) best today: Discovering Data Geometry: Energy-Driven Neural Diffusion (ICLR 2023) |
