mlsanityData to 14 Oct 2026

Retrieval-based Knowledge Transfer: An Effective Approach for Extreme Large Language Model Compression

arXiv 2310.15594 ↗First posted 24 Oct 2023cs.CL cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Large-scale pre-trained language models (LLMs) have demonstrated exceptional performance in various natural language processing (NLP) tasks. However, the massive size of these models poses huge challenges for their deployment in real-world applications. While numerous model compression techniques have been proposed, most of them are not well-suited for achieving extreme model compression when there is a significant gap in model scale. In this paper, we introduce a novel compression paradigm called Retrieval-based Knowledge Transfer (RetriKT), which effectively transfers the knowledge of LLMs to extremely small-scale models (e.g., 1%). In particular, our approach extracts knowledge from LLMs to construct a knowledge store, from which the small-scale model can retrieve relevant information and leverage it for effective inference. To improve the quality of the model, soft prompt tuning and Proximal Policy Optimization (PPO) reinforcement learning techniques are employed. Extensive experiments are conducted on low-resource tasks from SuperGLUE and GLUE benchmarks. The results demonstrate that the proposed approach significantly enhances the performance of small-scale models by leveraging the knowledge from LLMs.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 57 of its 73 references that are in the map. First posted on arXiv 24 Oct 2023.

Builds on

57 of 73 references.

References · 57

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2022Training language models to follow instructions with human feedbackcited by 15,971
  4. 2017Proximal Policy Optimization Algorithmscited by 15,215
  5. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  6. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  7. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  8. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  9. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  10. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  11. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,720
  12. 2019The Curious Case of Neural Text Degenerationcited by 2,916
38 more
  1. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  2. 2020Learning to summarize from human feedbackcited by 2,588
  3. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  4. 2019Fine-Tuning Language Models from Human Preferencescited by 2,150
  5. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,984
  6. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
  7. 2014FitNets: Hints for Thin Deep Netscited by 1,653
  8. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
  9. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
  10. 2018Neural Network Acceptability Judgmentscited by 958
  11. 2022GLM-130B: An Open Bilingual Pre-trained Modelcited by 843
  12. 2019Improved Knowledge Distillation via Teacher Assistantcited by 573
  13. 2019Patient Knowledge Distillation for BERT Model Compressioncited by 508
  14. 2018Texygen: A Benchmarking Platform for Text Generation Modelscited by 491
  15. 2018WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representationscited by 372
  16. 2017A Deep Reinforced Model for Abstractive Summarizationcited by 365
  17. 2021Recursively Summarizing Books with Human Feedbackcited by 290
  18. 2022Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimizationcited by 246
  19. 2020MiniLMv2: Multi-Head Self-Attention Relation Distillation for Compressing Pretrained Transformerscited by 245
  20. 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 185
  21. 2019Not Enough Data? Deep Learning to the Rescue!cited by 175
  22. 2016An Actor-Critic Algorithm for Sequence Predictioncited by 159
  23. 2020TernaryBERT: Distillation-aware Ultra-low Bit BERTcited by 148
  24. 2018Conditional BERT Contextual Augmentationcited by 107
  25. 2019Learning from Dialogue after Deployment: Feed Yourself, Chatbot!cited by 102
  26. 2020Human-centric Dialog Training via Offline Reinforcement Learningcited by 93
  27. 2020Densely Guided Knowledge Distillation using Multiple Teacher Assistantscited by 83
  28. 2022Compression of Generative Pre-trained Language Models via Quantizationcited by 79
  29. 2021Towards Zero-Label Language Learningcited by 76
  30. 2018Can Neural Machine Translation be Improved with User Feedback?cited by 72
  31. 2020MixKD: Towards Efficient Distillation of Large-scale Language Modelscited by 65
  32. 2020Text Generation by Learning from Demonstrationscited by 64
  33. 2020Contrastive Distillation on Intermediate Representations for Language Model Compressioncited by 57
  34. 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
  35. 2022PromDA: Prompt-based Data Augmentation for Low-Resource NLU Taskscited by 51
  36. 2020Generative Data Augmentation for Commonsense Reasoningcited by 49
  37. 2021Revisiting the Weaknesses of Reinforcement Learning for Neural Machine Translationcited by 33
  38. 2021Distilling Linguistic Context for Language Model Compressioncited by 33

50 most cited of 57 All 57 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

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

3 papers.