
arXiv: 2409.14161
Capitalizing on the intuitive premise that shape characteristics are more robust to perturbations, we bridge adversarial graph learning with the emerging tools from computational topology, namely, persistent homology representations of graphs. We introduce the concept of witness complex to adversarial analysis on graphs, which allows us to focus only on the salient shape characteristics of graphs, yielded by the subset of the most essential nodes (i.e., landmarks), with minimal loss of topological information on the whole graph. The remaining nodes are then used as witnesses, governing which higher-order graph substructures are incorporated into the learning process. Armed with the witness mechanism, we design Witness Graph Topological Layer (WGTL), which systematically integrates both local and global topological graph feature representations, the impact of which is, in turn, automatically controlled by the robust regularized topological loss. Given the attacker's budget, we derive the important stability guarantees of both local and global topology encodings and the associated robust topological loss. We illustrate the versatility and efficiency of WGTL by its integration with five GNNs and three existing non-topological defense mechanisms. Our extensive experiments demonstrate that WGTL boosts the robustness of GNNs across a range of perturbations and against a range of adversarial attacks.
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Computer Science - Machine Learning, GNN - Graph Neural Networks, Adversarial Machine Learning, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Learning on graphs, Witness complexes, Persistence Homology, Machine Learning (cs.LG), Graph attack, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], Robust representation, Vietoris-Rips complex, [MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Computer Science - Machine Learning, GNN - Graph Neural Networks, Adversarial Machine Learning, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Learning on graphs, Witness complexes, Persistence Homology, Machine Learning (cs.LG), Graph attack, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], Robust representation, Vietoris-Rips complex, [MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
