mlsanityData to 7 Oct 2026

Dynamic Guidance Adversarial Distillation with Enhanced Teacher Knowledge

arXiv 2409.01627 ↗First posted 3 Sep 2024cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

In the realm of Adversarial Distillation (AD), strategic and precise knowledge transfer from an adversarially robust teacher model to a less robust student model is paramount. Our Dynamic Guidance Adversarial Distillation (DGAD) framework directly tackles the challenge of differential sample importance, with a keen focus on rectifying the teacher model's misclassifications. DGAD employs Misclassification-Aware Partitioning (MAP) to dynamically tailor the distillation focus, optimizing the learning process by steering towards the most reliable teacher predictions. Additionally, our Error-corrective Label Swapping (ELS) corrects misclassifications of the teacher on both clean and adversarially perturbed inputs, refining the quality of knowledge transfer. Further, Predictive Consistency Regularization (PCR) guarantees consistent performance of the student model across both clean and adversarial inputs, significantly enhancing its overall robustness. By integrating these methodologies, DGAD significantly improves upon the accuracy of clean data and fortifies the model's defenses against sophisticated adversarial threats. Our experimental validation on CIFAR10, CIFAR100, and Tiny ImageNet datasets, employing various model architectures, demonstrates the efficacy of DGAD, establishing it as a promising approach for enhancing both the robustness and accuracy of student models in adversarial settings.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 27 of its 35 references that are in the map. First posted on arXiv 3 Sep 2024.

Builds on

27 of 35 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  5. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  6. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  7. 2013Intriguing properties of neural networkscited by 5,114
  8. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  9. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  10. 2016Identity Mappings in Deep Residual Networkscited by 1,960
  11. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  12. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
15 more
  1. 2013Speech Recognition with Deep Recurrent Neural Networkscited by 666
  2. 2018Adversarial Logit Pairingcited by 224
  3. 2020Bag of Tricks for Adversarial Trainingcited by 199
  4. 2018MMA Training: Direct Input Space Margin Maximization through Adversarial Trainingcited by 171
  5. 2019Understanding Adversarial Attacks on Deep Learning Based Medical Image Analysis Systemscited by 151
  6. 2019Adversarially Robust Distillationcited by 124
  7. 2022Robustness and Accuracy Could Be Reconcilable by (Proper) Definitioncited by 109
  8. 2021Revisiting Adversarial Robustness Distillation: Robust Soft Labels Make Student Bettercited by 77
  9. 2020CAT: Customized Adversarial Training for Improved Robustnesscited by 61
  10. 2021Reliable Adversarial Distillation with Unreliable Teacherscited by 55
  11. 2017Residual Convolutional CTC Networks for Automatic Speech Recognitioncited by 21
  12. 2022On the benefits of knowledge distillation for adversarial robustnesscited by 17
  13. 2021Adversarial Attacks on Multi-task Visual Perception for Autonomous Drivingcited by 14
  14. 2021LTD: Low Temperature Distillation for Gradient Masking-free Adversarial Trainingcited by 13
  15. 2022A3T: Accuracy Aware Adversarial Trainingcited by 4

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 4.

5 papers.