Robustness and Diversity Seeking Data-Free Knowledge Distillation
Not on the map. Why?
Abstract (arXiv)
Knowledge distillation (KD) has enabled remarkable progress in model compression and knowledge transfer. However, KD requires a large volume of original data or their representation statistics that are not usually available in practice. Data-free KD has recently been proposed to resolve this problem, wherein teacher and student models are fed by a synthetic sample generator trained from the teacher. Nonetheless, existing data-free KD methods rely on fine-tuning of weights to balance multiple losses, and ignore the diversity of generated samples, resulting in limited accuracy and robustness. To overcome this challenge, we propose robustness and diversity seeking data-free KD (RDSKD) in this paper. The generator loss function is crafted to produce samples with high authenticity, class diversity, and inter-sample diversity. Without real data, the objectives of seeking high sample authenticity and class diversity often conflict with each other, causing frequent loss fluctuations. We mitigate this by exponentially penalizing loss increments. With MNIST, CIFAR-10, and SVHN datasets, our experiments show that RDSKD achieves higher accuracy with more robustness over different hyperparameter settings, compared to other data-free KD methods such as DAFL, MSKD, ZSKD, and DeepInversion.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 1; 2024: 2; 2025: 1; 2026: 1.
9 papers.
- 2021Preventing Catastrophic Forgetting and Distribution Mismatch in Knowledge Distillation via Synthetic Datacited by 32
- 2021Data-Free Knowledge Transfer: A Surveycited by 31
- 2022Momentum Adversarial Distillation: Handling Large Distribution Shifts in Data-Free Knowledge Distillationcited by 31
- 2022Careful What You Wish For: on the Extraction of Adversarially Trained Modelscited by 6
- 2023Deep Classifier Mimicry without Data Accesscited by 6
- 2024Relation-Guided Adversarial Learning for Data-free Knowledge Transfercited by 6
- 2025Tractable Representation Learning with Probabilistic Circuitscited by 4
- 2024DataFreeShield: Defending Adversarial Attacks without Training Datacited by 0
- 2026Close Shortcut Wins Long: Seeking Diverse and Stable Generators for Data-Free Knowledge Distillationcited by 0
- 2026Close Shortcut Wins Long: Seeking Diverse and Stable Generators for Data-Free Knowledge Distillation22 Aug 2026
- 2025Tractable Representation Learning with Probabilistic Circuits6 Jul 2025
- 2024Relation-Guided Adversarial Learning for Data-free Knowledge Transfer16 Dec 2024
- 2024DataFreeShield: Defending Adversarial Attacks without Training Data21 Jun 2024
- 2023Deep Classifier Mimicry without Data Access3 Jun 2023
- 2022Momentum Adversarial Distillation: Handling Large Distribution Shifts in Data-Free Knowledge Distillation21 Sep 2022
- 2022Careful What You Wish For: on the Extraction of Adversarially Trained Models21 Jul 2022
- 2021Data-Free Knowledge Transfer: A Survey31 Dec 2021
- 2021Preventing Catastrophic Forgetting and Distribution Mismatch in Knowledge Distillation via Synthetic Data11 Aug 2021