Uncovering Hidden Vulnerabilities in Convolutional Neural Networks through Graph-based Adversarial Robustness Evaluation

被引:3
作者
Wang, Ke [1 ,2 ]
Chen, Zicong [1 ]
Dang, Xilin [2 ]
Fan, Xuan [1 ]
Han, Xuming [1 ]
Chen, Chien-Ming [3 ]
Ding, Weiping [4 ]
Yiu, Siu-Ming [5 ]
Weng, Jian [6 ]
机构
[1] Jinan Univ, Coll Informat & Sci, Huangpu Rd, Guangzhou 510632, Guangdong, Peoples R China
[2] Jinan Univ, Coll Cyber Secur, Engn Res Ctr Trustworthy AI, Minist Educ, Guangzhou, Peoples R China
[3] Shandong Univ Sci & Technol, Coll Comp Sci, Qingdao 266590, Shandong, Peoples R China
[4] Nantong Univ, Sch Informat Sci & Technol, Nantong 226019, Jiangshu, Peoples R China
[5] Univ Hong Kong, Dept Comp Sci, Hong Kong 00852, Peoples R China
[6] Jinan Univ, Guangdong Key Lab Data Secur & Privacy Preserving, Guangzhou 510632, Guangdong, Peoples R China
关键词
Graph of patterns; Graph distance algorithm; Adversarial robustness; Interpretable graph -based systems; Convolutional neural networks;
D O I
10.1016/j.patcog.2023.109745
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Convolutional neural networks (CNNs) are widely used for image classification, but their vulnerability to adversarial attacks poses challenges to their reliability and security. However, current adversarial robust-ness (AR) measures lack a theoretical foundation, limiting the insight into the decision process. To address this issue, we propose a new AR evaluation framework based on Graph of Patterns (GoPs) models and graph distance algorithms. Our approach provides a fine-grained analysis of AR from three perspectives, providing targeted insight into the vulnerability of CNNs. Compared to current standards, our approach is theoretically grounded and allows fine-tuning of model components without repeated attempts and validation. Our experimental results demonstrate its effectiveness in uncovering hidden vulnerabilities in CNNs and providing actionable approaches to improve their AR. Our GoPs modeling approach and graph distance algorithms can be extended to apply to other graph machine learning tasks such as Metric Learn-ing on multi-relational graphs. Overall, our framework represents significant progress in AR evaluation, providing a more interpretable, targeted, and efficient approach to assess CNN robustness in complex graph-based systems. & COPY; 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页数:15
相关论文
共 49 条
  • [1] Bai T, 2021, Arxiv, DOI [arXiv:2102.01356, 10.48550/arXiv.2102.01356, DOI 10.48550/ARXIV.2102.01356]
  • [2] SimGNN: A Neural Network Approach to Fast Graph Similarity Computation
    Bai, Yunsheng
    Ding, Hao
    Bian, Song
    Chen, Ting
    Sun, Yizhou
    Wang, Wei
    [J]. PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM'19), 2019, : 384 - 392
  • [3] Cisse M, 2017, PR MACH LEARN RES, V70
  • [4] Personalize d knowle dge-aware recommendation with collaborative and attentive graph convolutional networks
    Dai, Quanyu
    Wu, Xiao-Ming
    Fan, Lu
    Li, Qimai
    Liu, Han
    Zhang, Xiaotong
    Wang, Dan
    Lin, Guli
    Yang, Keping
    [J]. PATTERN RECOGNITION, 2022, 128
  • [5] Dong YP, 2017, Arxiv, DOI arXiv:1708.05493
  • [6] Structured self-attention architecture for graph-level representation learning
    Fan, Xiaolong
    Gong, Maoguo
    Xie, Yu
    Jiang, Fenlong
    Li, Hao
    [J]. PATTERN RECOGNITION, 2020, 100
  • [7] Interpretable Explanations of Black Boxes by Meaningful Perturbation
    Fong, Ruth C.
    Vedaldi, Andrea
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2017, : 3449 - 3457
  • [8] Gilmer Justin, 2018, arXiv
  • [9] A comprehensive evaluation framework for deep model robustness
    Guo, Jun
    Bao, Wei
    Wang, Jiakai
    Ma, Yuqing
    Gao, Xinghai
    Xiao, Gang
    Liu, Aishan
    Dong, Jian
    Liu, Xianglong
    Wu, Wenjun
    [J]. PATTERN RECOGNITION, 2023, 137
  • [10] Heaven D, 2019, NATURE, V574, P163, DOI 10.1038/d41586-019-03013-5