Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning

Mengzhou Xia, Tianyu Gao, Zhiyuan Zeng, Danqi Chen
2/12/2026

Official code: princeton-nlp/LLM-Shearing (644 stars, MIT, last commit 2024-03-04).

Abstract

The popularity of LLaMA (Touvron et al., 2023a;b) and other recently emerged moderate-sized large language models (LLMs) highlights the potential of building smaller yet powerful LLMs. Regardless, the cost of training such models from scratch on trillions of tokens remains high. In this work, we study structured pruning as an effective means to develop smaller LLMs from pre-trained, larger models. Our approach employs two key techniques: (1) targeted structured pruning, which prunes a larger model to a specified target shape by removing layers, heads, and intermediate and hidden dimensions in an end-to-end manner, and (2) dynamic batch loading, which dynamically updates the composition of sampled data in each training batch based on varying losses across different domains. We demonstrate the efficacy of our approach by presenting the Sheared-LLaMA series, pruning the LLaMA2-7B model down to 1.3B and 2.7B parameters. Sheared-LLaMA models outperform state-of-the-art open-source models of equivalent sizes, such as Pythia, INCITE, OpenLLaMA and the concurrent TinyLlama models, on a wide range of downstream and instruction tuning evaluations, while requiring only 3% of compute compared to training such models from scratch. This work provides compelling evidence that leveraging existing LLMs with structured pruning is a far more cost-effective approach for building competitive small-scale LLMs

View on arXivView PDF

Code Implementations(1)

MIT

[ICLR 2024] Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning

64458Shell, PythonOct 16, 20232 years agoMIT
efficiencyllamallama2llmnlp+2 more

Similar Papers

Cite this paper

@article{xia2026sheared,
  title  = {Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning},
  author = {Mengzhou Xia and Tianyu Gao and Zhiyuan Zeng and Danqi Chen},
  year   = {2026},
  eprint = {2310.06694},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2310.06694},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.06694.svg)](https://codeofpaper.com/paper/2310.06694)

Discussion