mlsanityData to 7 Oct 2026

HARD: Hard Augmentations for Robust Distillation

arXiv 2305.14890 ↗First posted 24 May 2023cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Knowledge distillation (KD) is a simple and successful method to transfer knowledge from a teacher to a student model solely based on functional activity. However, current KD has a few shortcomings: it has recently been shown that this method is unsuitable to transfer simple inductive biases like shift equivariance, struggles to transfer out of domain generalization, and optimization time is magnitudes longer compared to default non-KD model training. To improve these aspects of KD, we propose Hard Augmentations for Robust Distillation (HARD), a generally applicable data augmentation framework, that generates synthetic data points for which the teacher and the student disagree. We show in a simple toy example that our augmentation framework solves the problem of transferring simple equivariances with KD. We then apply our framework in real-world tasks for a variety of augmentation models, ranging from simple spatial transformations to unconstrained image manipulations with a pretrained variational autoencoder. We find that our learned augmentations significantly improve KD performance on in-domain and out-of-domain evaluation. Moreover, our method outperforms even state-of-the-art data augmentations and since the augmented training inputs can be visualized, they offer a qualitative insight into the properties that are transferred from the teacher to the student. Thus HARD represents a generally applicable, dynamically optimized data augmentation technique tailored to improve the generalization and convergence speed of models trained with KD.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 53 of its 67 references that are in the map. First posted on arXiv 24 May 2023.

Builds on

53 of 67 references.

References · 53

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  4. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  5. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  6. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  7. 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,539
  8. 2022Photorealistic Text-to-Image Diffusion Models with Deep Language Understandingcited by 6,322
  9. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  10. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  11. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  12. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
38 more
  1. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  2. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  3. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
  4. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  5. 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,507
  6. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,441
  7. 2018ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustnesscited by 1,430
  8. 2015Spatial Transformer Networkscited by 1,423
  9. 2019Natural Adversarial Examplescited by 1,401
  10. 2017Random Erasing Data Augmentationcited by 1,235
  11. 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
  12. 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,010
  13. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 897
  14. 2018AutoAugment: Learning Augmentation Policies from Datacited by 728
  15. 2022Autoregressive Image Generation using Residual Quantizationcited by 706
  16. 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
  17. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  18. 2023Symbolic Discovery of Optimization Algorithmscited by 423
  19. 20218-bit Optimizers via Block-wise Quantizationcited by 395
  20. 2020Meta Pseudo Labelscited by 372
  21. 2020Are we done with ImageNet?cited by 329
  22. 2017Data Augmentation Generative Adversarial Networkscited by 278
  23. 2020Very Deep VAEs Generalize Autoregressive Models and Can Outperform Them on Imagescited by 261
  24. 2021Knowledge distillation: A good teacher is patient and consistentcited by 255
  25. 2021TrivialAugment: Tuning-free Yet State-of-the-Art Data Augmentationcited by 225
  26. 2019MNIST-C: A Robustness Benchmark for Computer Visioncited by 137
  27. 2019Functional Regularisation for Continual Learning with Gaussian Processescited by 121
  28. 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
  29. 2019Adversarial AutoAugmentcited by 111
  30. 2020Continual Deep Learning by Functional Regularisation of Memorable Pastcited by 104
  31. 2018Measuring and regularizing networks in function spacecited by 97
  32. 2021PoseAug: A Differentiable Pose Augmentation Framework for 3D Human Pose Estimationcited by 88
  33. 2017Exploring the Landscape of Spatial Robustnesscited by 81
  34. 2018Style Augmentation: Data Augmentation via Style Randomizationcited by 79
  35. 2022DearKD: Data-Efficient Early Knowledge Distillation for Vision Transformerscited by 65
  36. 2022Leveling Down in Computer Vision: Pareto Inefficiencies in Fair Deep Classifierscited by 53
  37. 2021MATE-KD: Masked Adversarial TExt, a Companion to Knowledge Distillationcited by 27
  38. 2018DADA: Deep Adversarial Data Augmentation for Extremely Low Data Regime Classificationcited by 18

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.