Power up! Robust Graph Convolutional Network via Graph Powering
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 7; 2022: 3; 2023: 3; 2024: 2.
15 papers.
Sort:
- 2021Topological Relational Learning on Graphscited by 27
- 2021threaTrace: Detecting and Tracing Host-based Threats in Node Level Through Provenance Graph Learningcited by 22
- 2021AutoGL: A Library for Automated Graph Learningcited by 14
- 2023Knowledge Graph Completion with Counterfactual Augmentationcited by 13
- 2021Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matchingcited by 11
- 2021Adversarial Attack Framework on Graph Embedding Models with Limited Knowledgecited by 10
- 2022Graph Augmentation Learningcited by 9
- 2023Adversarially Robust Neural Architecture Search for Graph Neural Networkscited by 7
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothingcited by 7
- 2021Node Feature Kernels Increase Graph Convolutional Network Robustnesscited by 5
- 2021Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certificationcited by 2
- 2024Towards Lightweight Graph Neural Network Search with Curriculum Graph Sparsificationcited by 2
3 more
- 2022Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentationcited by 1
- 2022T- Hop: Tensor representation of paths in graph convolutional networkscited by 0
- 2024T- Hop: A framework for studying the importance path information in molecular graphs for chemical property predictioncited by 0
- 2024T- Hop: A framework for studying the importance path information in molecular graphs for chemical property prediction29 Jun 2024
- 2024Towards Lightweight Graph Neural Network Search with Curriculum Graph Sparsification24 Jun 2024
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing14 Apr 2023
- 2023Adversarially Robust Neural Architecture Search for Graph Neural Networks9 Apr 2023
- 2023Knowledge Graph Completion with Counterfactual Augmentation25 Feb 2023
- 2022Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentation15 Nov 2022
- 2022T- Hop: Tensor representation of paths in graph convolutional networks11 Apr 2022
- 2022Graph Augmentation Learning17 Mar 2022
- 2021Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching16 Dec 2021
- 2021threaTrace: Detecting and Tracing Host-based Threats in Node Level Through Provenance Graph Learning8 Nov 2021
- 2021Topological Relational Learning on Graphs29 Oct 2021
- 2021Node Feature Kernels Increase Graph Convolutional Network Robustness4 Sep 2021
- 2021Topological Relational Learning on Graphscited by 27
- 2021threaTrace: Detecting and Tracing Host-based Threats in Node Level Through Provenance Graph Learningcited by 22
- 2021AutoGL: A Library for Automated Graph Learningcited by 14
- 2023Knowledge Graph Completion with Counterfactual Augmentationcited by 13
- 2021Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matchingcited by 11
- 2021Adversarial Attack Framework on Graph Embedding Models with Limited Knowledgecited by 10
- 2022Graph Augmentation Learningcited by 9
- 2023Adversarially Robust Neural Architecture Search for Graph Neural Networkscited by 7
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothingcited by 7
- 2021Node Feature Kernels Increase Graph Convolutional Network Robustnesscited by 5
- 2021Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certificationcited by 2
- 2024Towards Lightweight Graph Neural Network Search with Curriculum Graph Sparsificationcited by 2
12 most cited of 15 All 15 (JSON)
- 2024T- Hop: A framework for studying the importance path information in molecular graphs for chemical property prediction29 Jun 2024
- 2024Towards Lightweight Graph Neural Network Search with Curriculum Graph Sparsification24 Jun 2024
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing14 Apr 2023
- 2023Adversarially Robust Neural Architecture Search for Graph Neural Networks9 Apr 2023
- 2023Knowledge Graph Completion with Counterfactual Augmentation25 Feb 2023
- 2022Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentation15 Nov 2022
- 2022T- Hop: Tensor representation of paths in graph convolutional networks11 Apr 2022
- 2022Graph Augmentation Learning17 Mar 2022
- 2021Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching16 Dec 2021
- 2021threaTrace: Detecting and Tracing Host-based Threats in Node Level Through Provenance Graph Learning8 Nov 2021
- 2021Topological Relational Learning on Graphs29 Oct 2021
- 2021Node Feature Kernels Increase Graph Convolutional Network Robustness4 Sep 2021
12 newest of 15 All 15 (JSON)