mlsanityData to 14 Oct 2026

Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Models

arXiv 2508.02128 ↗First posted 4 Aug 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

In the era of large language models (LLMs), N:M sparsity has emerged as a structured compression technique critical for accelerating inference. While prior work has primarily focused on weight sparsity, it often suffers from significant accuracy degradation. Activation sparsity, though promising, is typically training-dependent and faces challenges in generalization. To address these limitations, we introduce Amber Pruner, a training-free N:M activation sparsity method designed specifically for the prefill stage, targeting the acceleration of linear projection layers in LLMs. Extensive experiments across multiple models and sparsity ratios (2:4, 4:8, and 8:16) demonstrate that Amber Pruner can effectively sparsify and accelerate more than 55% of linear computations without requiring model retraining. To further enhance generality and efficiency, we propose Outstanding-sparse, a unified framework that integrates Amber Pruner with post-training W8A8 quantization. Our approach preserves strong performance across a range of downstream tasks, with notable advantages in generative tasks. This work pioneers a new frontier in activation sparsity, providing foundational insights that are poised to guide the co-evolution of algorithms and architectures in the design of next-generation AI systems.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 34 references that are in the map. First posted on arXiv 4 Aug 2025.

Builds on

24 of 34 references.

References · 24

  1. 2025Qwen3 Technical Reportcited by 8,820
  2. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  5. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  6. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  7. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  8. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 906
  9. 2023C-Eval: A Multi-Level Multi-Discipline Chinese Evaluation Suite for Foundation Modelscited by 708
  10. 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 449
  11. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  12. 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
12 more
  1. 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 122
  2. 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameterscited by 38
  3. 2024Q-Sparse: All Large Language Models can be Fully Sparsely-Activatedcited by 25
  4. 2024SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMscited by 20
  5. 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
  6. 2024OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decompositioncited by 20
  7. 2023E-Sparse: Boosting the Large Language Model Inference through Entropy-based N:M Sparsitycited by 15
  8. 2025Accelerating Transformer Inference and Training with 2:4 Activation Sparsitycited by 9
  9. 2024GQSA: Group Quantization and Sparsity for Accelerating Large Language Model Inferencecited by 5
  10. 2024SDQ: Sparse Decomposed Quantization for LLM Inferencecited by 4
  11. 2024Dynamic Activation Pitfalls in LLaMA Models: An Empirical Studycited by 3
  12. 2025Semantic Retention and Extreme Compression in LLMs: Can We Have Both?cited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference
  2. 2024Training-Free Activation Sparsity in Large Language Models
  3. 2026WiSparse: Boosting LLM Inference Efficiency with Weight-Aware Mixed Activation Sparsity
  4. 2025La RoSA: Enhancing LLM Efficiency via Layerwise Rotated Sparse Activation
  5. 2026When Pruning Meets Interpretability: Preserving Sparse Autoencoder Robustness in LLMs
  6. 2023One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models
  7. 2026TopK-Guided: Adaptive, Budget-Aware Activation Sparsity for Efficient LLM Inference
  8. 2026SPARQLe: Sub-Precision Activation Representation for Quantized LLM Inference