Enabling High-Sparsity Foundational Llama Models with Efficient Pretraining and Deployment
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have revolutionized Natural Language Processing (NLP), but their size creates computational bottlenecks. We introduce a novel approach to create accurate, sparse foundational versions of performant LLMs that achieve full accuracy recovery for fine-tuning tasks at up to 70% sparsity. We achieve this for the LLaMA-2 7B model by combining the SparseGPT one-shot pruning method and sparse pretraining of those models on a subset of the SlimPajama dataset mixed with a Python subset of The Stack dataset. We exhibit training acceleration due to sparsity on Cerebras CS-3 chips that closely matches theoretical scaling. In addition, we establish inference acceleration of up to 3x on CPUs by utilizing Neural Magic's DeepSparse engine and 1.7x on GPUs through Neural Magic's nm-vllm engine. The above gains are realized via sparsity alone, thus enabling further gains through additional use of quantization. Specifically, we show a total speedup on CPUs for sparse-quantized LLaMA models of up to 8.6x. We demonstrate these results across diverse, challenging tasks, including chat, instruction following, code generation, arithmetic reasoning, and summarization to prove their generality. This work paves the way for rapidly creating smaller and faster LLMs without sacrificing accuracy.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 20 of its 31 references that are in the map. First posted on arXiv 6 May 2024.
Builds on
20 of 31 references.
References · 20
- 2017Attention Is All You Needcited by 59,932
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 825
- 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
8 more
- 2023QuIP: 2-Bit Quantization of Large Language Models With Guaranteescited by 397
- 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 359
- 2022The Stack: 3 TB of permissively licensed source codecited by 354
- 2022Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Modelcited by 264
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2015Better Summarization Evaluation with Word Embeddings for ROUGEcited by 66
- 2020Towards Fully 8-bit Integer Inference for the Transformer Modelcited by 35
Built on by
Citing papers per year: 2024: 4; 2025: 5; 2026: 1.
10 papers.
- 2024Large Language Model Inference Acceleration: A Comprehensive Hardware Perspectivecited by 36
- 2024Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruningcited by 19
- 2024LIBMoE: A Library for comprehensive benchmarking Mixture of Experts in Large Language Modelscited by 6
- 2025PLM: Efficient Peripheral Language Models Hardware-Co-Designed for Ubiquitous Computingcited by 4
- 2024Fibottention: Inceptive Visual Representation Learning with Diverse Attention Across Headscited by 3
- 2025PATCH: Learnable Tile-level Hybrid Sparsity for LLMscited by 2
- 2025Purifying Task Vectors in Knowledge-Aware Subspace for Model Mergingcited by 2
- 2025SD2: Self-Distilled Sparse Drafterscited by 1
- 2025Sparse-to-Sparse Training of Diffusion Modelscited by 1
- 2026Learning to Remember, Learn, and Forget in Attention-Based Modelscited by 1
- 2026Learning to Remember, Learn, and Forget in Attention-Based Models9 Feb 2026
- 2025Purifying Task Vectors in Knowledge-Aware Subspace for Model Merging16 Oct 2025
- 2025PATCH: Learnable Tile-level Hybrid Sparsity for LLMs27 Sep 2025
- 2025Sparse-to-Sparse Training of Diffusion Models30 Apr 2025
- 2025SD2: Self-Distilled Sparse Drafters10 Apr 2025
- 2025PLM: Efficient Peripheral Language Models Hardware-Co-Designed for Ubiquitous Computing15 Mar 2025
- 2024LIBMoE: A Library for comprehensive benchmarking Mixture of Experts in Large Language Models1 Nov 2024
- 2024Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning9 Oct 2024
- 2024Large Language Model Inference Acceleration: A Comprehensive Hardware Perspective6 Oct 2024
- 2024Fibottention: Inceptive Visual Representation Learning with Diverse Attention Across Heads27 Jun 2024
Similar, not cited
Close in wording, no citation either way
- 2025La RoSA: Enhancing LLM Efficiency via Layerwise Rotated Sparse Activation
- 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference
- 2023Sparse Fine-tuning for Inference Acceleration of Large Language Models
- 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameters
- 2026WiSparse: Boosting LLM Inference Efficiency with Weight-Aware Mixed Activation Sparsity
- 2025The Unseen Frontier: Pushing the Limits of LLM Sparsity with Surrogate-Free ADMM
- 2025Accelerating LLM Inference with Flexible N:M Sparsity via A Fully Digital Compute-in-Memory Accelerator
- 2024Q-Sparse: All Large Language Models can be Fully Sparsely-Activated