Training-Free Activation Sparsity in Large Language Models

James Liu, Pragaash Ponnusamy, Tianle Cai, Han Guo, Yoon Kim +1 more
2/12/2026

No official code found. Best implementation: FasterDecoding/TEAL (172 stars, MIT, last commit 2025-02-15).

Abstract

Activation sparsity can enable practical inference speedups in large language models (LLMs) by reducing the compute and memory-movement required for matrix multiplications during the forward pass. However, existing methods face limitations that inhibit widespread adoption. Some approaches are tailored towards older models with ReLU-based sparsity, while others require extensive continued pre-training on up to hundreds of billions of tokens. This paper describes TEAL, a simple training-free method that applies magnitude-based activation sparsity to hidden states throughout the entire model. TEAL achieves 40-50% model-wide sparsity with minimal performance degradation across Llama-2, Llama-3, and Mistral families, with sizes varying from 7B to 70B. We improve existing sparse kernels and demonstrate wall-clock decoding speed-ups of up to 1.53$\times$ and 1.8$\times$ at 40% and 50% model-wide sparsity. TEAL is compatible with weight quantization, enabling further efficiency gains.

View on arXivView PDF

Code Implementations(1)

FasterDecoding/TEALCommunity100%
MIT
17217Shell, PythonAug 28, 20241 years agoMIT
llmllm-inferencesparsity

Similar Papers

Cite this paper

@article{liu2026trainingfree,
  title  = {Training-Free Activation Sparsity in Large Language Models},
  author = {James Liu and Pragaash Ponnusamy and Tianle Cai and Han Guo and Yoon Kim and Ben Athiwaratkun},
  year   = {2026},
  eprint = {2408.14690},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2408.14690},
  journal = {ICLR 2024 2024}
}

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/2408.14690.svg)](https://codeofpaper.com/paper/2408.14690)

Discussion