GReAT: A Graph Regularized Adversarial Training Method

被引:0
作者
Bayram, Samet [1 ]
Barner, Kenneth [1 ]
机构
[1] Univ Delaware, Elect & Comp Engn Dept, Newark, DE 19716 USA
关键词
Adversarial examples; adversarial learning; adversarial training; graph regularization; image classification; semi-supervised learning; robustness;
D O I
10.1109/ACCESS.2024.3395976
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents GReAT (Graph Regularized Adversarial Training), a novel regularization method designed to enhance the robust classification performance of deep learning models. Adversarial examples, characterized by subtle perturbations that can mislead models, pose a significant challenge in machine learning. Although adversarial training is effective in defending against such attacks, it often overlooks the underlying data structure. In response, GReAT integrates graph-based regularization into the adversarial training process, leveraging the data's inherent structure to enhance model robustness. By incorporating graph information during training, GReAT defends against adversarial attacks and improves generalization to unseen data. Extensive evaluations on benchmark datasets demonstrate that GReAT outperforms state-of-the-art methods in robustness, achieving notable improvements in classification accuracy. Specifically, compared to the second-best methods, GReAT achieves a performance increase of approximately 4.87% for CIFAR-10 against FGSM attack and 10.57% for SVHN against FGSM attack. Additionally, for CIFAR-10, GReAT demonstrates a performance increase of approximately 11.05% against PGD attack, and for SVHN, a 5.54% increase against PGD attack. This paper provides detailed insights into the proposed methodology, including numerical results and comparisons with existing approaches, highlighting the significant impact of GReAT in advancing the performance of deep learning models.
引用
收藏
页码:63130 / 63141
页数:12
相关论文
共 49 条
[1]  
Agarwal N., 2009, Proceedings of the International AAAI Conference on Web and Social Media, V3, P2
[2]  
Amini MR, 2025, Arxiv, DOI arXiv:2202.12040
[3]  
Nguyen A, 2015, PROC CVPR IEEE, P427, DOI 10.1109/CVPR.2015.7298640
[4]  
[Anonymous], 2011, P NIPS WORKSH DEEP L
[5]  
Bafna M, 2018, Arxiv, DOI arXiv:1812.05013
[6]  
Bayram S, 2022, Arxiv, DOI arXiv:2208.14302
[7]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399
[8]  
Bengio O., 2006, Label propagation andquadratic criterion,'' inSemi-Supervised Learning
[9]   Wild patterns: Ten years after the rise of adversarial machine learning [J].
Biggio, Battista ;
Roli, Fabio .
PATTERN RECOGNITION, 2018, 84 :317-331
[10]   Neural Graph Learning: Training Neural Networks Using Graphs [J].
Bui, Thang D. ;
Ravi, Sujith ;
Ramavajjala, Vivek .
WSDM'18: PROCEEDINGS OF THE ELEVENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2018, :64-71