首页|A Unified Optimization-Based Framework for Certifiably Robust and Fair Graph Neural Networks
A Unified Optimization-Based Framework for Certifiably Robust and Fair Graph Neural Networks
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
IEEE
Graph Neural Networks (GNNs) have exhibited exceptional performance across diverse application domains by harnessing the inherent interconnectedness of data. Recent findings point towards instability of GNN under both feature and structure perturbations. The emergence of adversarial attacks targeting GNNs poses a substantial and pervasive threat, compromising their overall performance and learning capabilities. In this work, we first derive a theoretical bound on the global Lipschitz constant of GNN in the context of both feature and structure perturbations. Consequently, we propose a unifying approach, termed AdaLipGNN, for adversarial training of GNNs through an optimization framework which provides attack agnostic robustness. By seamlessly integrating graph denoising and network regularization, AdaLipGNN offers a comprehensive and versatile solution, extending its applicability and enabling robust regularization for diverse network architectures. Further, we develop a provably convergent iterative algorithm, leveraging block successive upper-bound minimization to learn robust and stable GNN hypothesis. Numerical results obtained from extensive experiments performed on real-world datasets clearly illustrate that the proposed AdaLipGNN outperforms other defence methods.
Department of Electrical Engineering, Indian Institute of Technology, Delhi, India
Department of Electrical Engineering, Indian Institute of Technology, Delhi, India|Yardi School of Artificial Intelligence, Indian Institute of Technology, Delhi, India
Department of Mathematics, Indian Institute of Technology, Delhi, India
NETL
NSTL
IEEE
