Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.08645 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909960728739840 |
|---|---|
| author | Chen, Boqi Marussy, Kristóf Semeráth, Oszkár Mussbacher, Gunter Varró, Dániel |
| author_facet | Chen, Boqi Marussy, Kristóf Semeráth, Oszkár Mussbacher, Gunter Varró, Dániel |
| contents | Graph convolutional neural networks (GCNs) are powerful tools for learning graph-based knowledge representations from training data. However, they are vulnerable to small perturbations in the input graph, which makes them susceptible to input faults or adversarial attacks. This poses a significant problem for GCNs intended to be used in critical applications, which need to provide certifiably robust services even in the presence of adversarial perturbations. We propose an improved GCN robustness certification technique for node classification in the presence of node feature perturbations. We introduce a novel polyhedra-based abstract interpretation approach to tackle specific challenges of graph data and provide tight upper and lower bounds for the robustness of the GCN. Experiments show that our approach simultaneously improves the tightness of robustness bounds as well as the runtime performance of certification. Moreover, our method can be used during training to further improve the robustness of GCNs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_08645 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation Chen, Boqi Marussy, Kristóf Semeráth, Oszkár Mussbacher, Gunter Varró, Dániel Machine Learning Formal Languages and Automata Theory Graph convolutional neural networks (GCNs) are powerful tools for learning graph-based knowledge representations from training data. However, they are vulnerable to small perturbations in the input graph, which makes them susceptible to input faults or adversarial attacks. This poses a significant problem for GCNs intended to be used in critical applications, which need to provide certifiably robust services even in the presence of adversarial perturbations. We propose an improved GCN robustness certification technique for node classification in the presence of node feature perturbations. We introduce a novel polyhedra-based abstract interpretation approach to tackle specific challenges of graph data and provide tight upper and lower bounds for the robustness of the GCN. Experiments show that our approach simultaneously improves the tightness of robustness bounds as well as the runtime performance of certification. Moreover, our method can be used during training to further improve the robustness of GCNs. |
| title | Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation |
| topic | Machine Learning Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2405.08645 |