mlsanityData to 7 Oct 2026

AuG-KD: Anchor-Based Mixup Generation for Out-of-Domain Knowledge Distillation

arXiv 2403.07030 ↗First posted 11 Mar 2024cs.LG cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

Due to privacy or patent concerns, a growing number of large models are released without granting access to their training data, making transferring their knowledge inefficient and problematic. In response, Data-Free Knowledge Distillation (DFKD) methods have emerged as direct solutions. However, simply adopting models derived from DFKD for real-world applications suffers significant performance degradation, due to the discrepancy between teachers' training data and real-world scenarios (student domain). The degradation stems from the portions of teachers' knowledge that are not applicable to the student domain. They are specific to the teacher domain and would undermine students' performance. Hence, selectively transferring teachers' appropriate knowledge becomes the primary challenge in DFKD. In this work, we propose a simple but effective method AuG-KD. It utilizes an uncertainty-guided and sample-specific anchor to align student-domain data with the teacher domain and leverages a generative method to progressively trade off the learning process between OOD knowledge distillation and domain-specific information learning via mixup learning. Extensive experiments in 3 datasets and 8 settings demonstrate the stability and superiority of our approach. Code available at https://github.com/IshiKura-a/AuG-KD .

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 47 of its 66 references that are in the map. First posted on arXiv 11 Mar 2024.

Builds on

47 of 66 references.

References · 47

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  5. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  6. 2019Searching for MobileNetV3cited by 1,984
  7. 2019Invariant Risk Minimizationcited by 1,832
  8. 2014FitNets: Hints for Thin Deep Netscited by 1,619
  9. 2020Energy-based Out-of-distribution Detectioncited by 1,296
  10. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
  11. 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,132
  12. 2019Relational Knowledge Distillationcited by 873
35 more
  1. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
  2. 2017VisDA: The Visual Domain Adaptation Challengecited by 432
  3. 2019Dreaming to Distill: Data-free Knowledge Transfer via DeepInversioncited by 419
  4. 2020Environment Inference for Invariant Learningcited by 306
  5. 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 176
  6. 2020Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfercited by 173
  7. 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
  8. 2019Zero-shot Knowledge Transfer via Adversarial Belief Matchingcited by 129
  9. 2020Data-Free Model Extractioncited by 121
  10. 2022Source-Free Domain Adaptation via Distribution Estimationcited by 97
  11. 2019Dynamic Curriculum Learning for Imbalanced Data Classificationcited by 93
  12. 2020Data-Free Network Quantization With Adversarial Knowledge Distillationcited by 79
  13. 2018Stable Prediction across Unknown Environmentscited by 55
  14. 2023C-SFDA: A Curriculum Learning Aided Self-Training Framework for Efficient Source Free Domain Adaptationcited by 49
  15. 2022Uncertainty-guided Source-free Domain Adaptationcited by 46
  16. 2023Prompt-based Distribution Alignment for Unsupervised Domain Adaptationcited by 44
  17. 2020DeVLBert: Learning Deconfounded Visio-Linguistic Representationscited by 42
  18. 2022Robust and Resource-Efficient Data-Free Knowledge Distillation by Generative Pseudo Replaycited by 35
  19. 2022DUET: A Tuning-Free Device-Cloud Collaborative Parameters Generation Framework for Efficient Device Model Generalizationcited by 35
  20. 2021Mosaicking to Distill: Knowledge Distillation from Out-of-Domain Datacited by 31
  21. 2022Momentum Adversarial Distillation: Handling Large Distribution Shifts in Data-Free Knowledge Distillationcited by 31
  22. 2023Learning to Retain while Acquiring: Combating Distribution-Shift in Adversarial Data-Free Knowledge Distillationcited by 29
  23. 2023Intelligent Model Update Strategy for Sequential Recommendationcited by 25
  24. 2022Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptationcited by 21
  25. 2023Revisiting the Domain Shift and Sample Uncertainty in Multi-source Active Domain Transfercited by 20
  26. 2022Respecting Transfer Gap in Knowledge Distillationcited by 18
  27. 2023A Systematic Study of Knowledge Distillation for Natural Language Generation with Pseudo-Target Trainingcited by 16
  28. 2022Tree Structure-Aware Few-Shot Image Classification via Hierarchical Aggregationcited by 14
  29. 2022Uncertainty-Induced Transferability Representation for Source-Free Unsupervised Domain Adaptationcited by 13
  30. 2023FedACK: Federated Adversarial Contrastive Knowledge Distillation for Cross-Lingual and Cross-Model Social Bot Detectioncited by 12
  31. 2024ModelGPT: Unleashing LLM's Capabilities for Tailored Model Generationcited by 11
  32. 2022Intelligent Request Strategy Design in Recommender Systemcited by 10
  33. 2023Sampling to Distill: Knowledge Transfer from Open-World Datacited by 8
  34. 2022Dynamic Data-Free Knowledge Distillation by Easy-to-Hard Learning Strategycited by 7
  35. 2022Personalizing Intervened Network for Long-tailed Sequential User Behavior Modelingcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 2.

5 papers.