mlsanityData to 14 Oct 2026

Lillama: Large Language Models Compression via Low-Rank Feature Distillation

arXiv 2412.16719 ↗First posted 21 Dec 2024cs.LG cs.AIcited by 4

On the map: Knowledge distillation → Knowledge distillation for LLMs

Abstract (arXiv)

Current LLM structured pruning methods typically involve two steps: (1) compression with calibration data and (2) costly continued pretraining on billions of tokens to recover lost performance. This second step is necessary as the first significantly impacts model accuracy. Prior research suggests pretrained Transformer weights aren't inherently low-rank, unlike their activations, which may explain this drop. Based on this observation, we propose Lillama, a compression method that locally distills activations with low-rank weights. Using SVD for initialization and a joint loss combining teacher and student activations, we accelerate convergence and reduce memory use with local gradient updates. Lillama compresses Mixtral-8x7B within minutes on a single A100 GPU, removing 10 billion parameters while retaining over 95% of its original performance. Phi-2 3B can be compressed by 40% with just 13 million calibration tokens, resulting in a small model that competes with recent models of similar size. The method generalizes well to non-transformer architectures, compressing Mamba-3B by 20% while maintaining 99% performance.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Knowledge distillation for LLMs, one of 12 directions in Knowledge distillation. Builds on 27 of its 39 references that are in the map. First posted on arXiv 21 Dec 2024.

Builds on

27 of 39 references.

References · 27

  1. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  2. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  3. 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
  4. 2020wav2vec 2.0: A Framework for Self-Supervised Learning of Speech Representationscited by 3,905
  5. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,975
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  8. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  9. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  11. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
  12. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
15 more
  1. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
  2. 2022FLEURS: Few-shot Learning Evaluation of Universal Representations of Speechcited by 469
  3. 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
  4. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  5. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
  6. 2021Layer-wise Analysis of a Self-supervised Speech Representation Modelcited by 298
  7. 2020Retrieve, Program, Repeat: Complex Knowledge Base Question Answering via Alternate Meta-learningcited by 216
  8. 2024Aya Dataset: An Open-Access Collection for Multilingual Instruction Tuningcited by 177
  9. 2021DistilHuBERT: Speech Representation Learning by Layer-wise Distillation of Hidden-unit BERTcited by 144
  10. 2020Deep Encoder, Shallow Decoder: Reevaluating Non-autoregressive Machine Translationcited by 105
  11. 2024LLM Pruning and Distillation in Practice: The Minitron Approachcited by 82
  12. 2021An Exploration of Self-Supervised Pretrained Representations for End-to-End Speech Recognitioncited by 39
  13. 2024MobiLlama: Towards Accurate and Lightweight Fully Transparent GPTcited by 34
  14. 2023LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compressioncited by 26
  15. 2024InkubaLM: A small language model for low-resource African languagescited by 18

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023Rethinking Compression: Reduced Order Modelling of Latent Features in Large Language Models
  2. 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models
  3. 2024Compressing Large Language Models using Low Rank and Low Precision Decomposition
  4. 2025SDMPrune: Self-Distillation MLP Pruning for Efficient Large Language Models
  5. 2024SeedLM: Compressing LLM Weights into Seeds of Pseudo-Random Generators
  6. 2024Aggressive Post-Training Compression on Extremely Large Language Models
  7. 2024Compact Language Models via Pruning and Knowledge Distillation
  8. 2026Compression Trinity: Exploring Sparsity, Quantization, and Low-Rank Approximations for LLM Compression