GReAT: A Graph Regularized Adversarial Training Method
Not on the map. Why?
Abstract (arXiv)
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 CIFAR10 against FGSM attack and 10.57% for SVHN against FGSM attack. Additionally, for CIFAR10, 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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 56 references that are in the map. First posted on arXiv 9 Oct 2023.
Builds on
28 of 56 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2022Generative Adversarial Networkscited by 5,627
- 2013Intriguing properties of neural networkscited by 5,155
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2016Adversarial examples in the physical worldcited by 1,769
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,318
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2015The Limitations of Deep Learning in Adversarial Settingscited by 790
16 more
- 2014Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Imagescited by 776
- 2015Distillation as a Defense to Adversarial Perturbations against Deep Neural Networkscited by 678
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 416
- 2017Wild Patterns: Ten Years After the Rise of Adversarial Machine Learningcited by 414
- 2017Mitigating Adversarial Effects Through Randomizationcited by 383
- 2018Feature Denoising for Improving Adversarial Robustnesscited by 314
- 2018Adversarial Logit Pairingcited by 224
- 2017The Space of Transferable Adversarial Examplescited by 158
- 2020Robust Pre-Training by Adversarial Contrastive Learningcited by 144
- 2022Self-Training: A Surveycited by 86
- 2019Metric Learning for Adversarial Robustnesscited by 77
- 2017Robust Physical-World Attacks on Deep Learning Modelscited by 72
- 2019Improving Adversarial Robustness via Guided Complement Entropycited by 15
- 2018Thwarting Adversarial Examples: An L0-RobustSparse Fourier Transformcited by 13
- 2018Adversarial Defense via Data Dependent Activation Function and Total Variation Minimizationcited by 9
- 2022A Black-Box Attack on Optical Character Recognition Systemscited by 3
Built on by
Not cited yet.