COUNTDOWN: Contextually Sparse Activation Filtering Out Unnecessary Weights in Down Projection
Not on the map. Why?
Abstract (arXiv)
The growing size of large language models has created significant computational inefficiencies. To address this challenge, sparse activation methods selectively deactivates non-essential parameters during inference, reducing computational costs in FFNN layers. While existing methods focus on non-linear gating mechanisms, we hypothesize that the sparsity of the FFNN layer lies globally in the form of a linear combination over its internal down projection matrix. Based on this insight, we propose two methods: M-COUNTDOWN, leveraging indirect coefficients, and D-COUNTDOWN, utilizing direct coefficients of the linear combination. Experimental results demonstrate that D-COUNTDOWN can omit 90% of computations with performance loss as low as 5.5% ideally, while M-COUNTDOWN provides a predictor-free solution with up to 29.4% better performance preservation compared to existing methods. Our specialized kernel implementations effectively realize these theoretical gains into substantial real-world acceleration.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 41 references that are in the map. First posted on arXiv 23 May 2025.
Builds on
24 of 41 references.
References · 24
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2020GLU Variants Improve Transformercited by 1,724
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 821
12 more
- 2016Language Modeling with Gated Convolutional Networkscited by 688
- 2024From Explicit CoT to Implicit CoT: Learning to Internalize CoT Step by Stepcited by 225
- 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 210
- 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memorycited by 170
- 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
- 2024PowerInfer-2: Fast Large Language Model Inference on a Smartphonecited by 101
- 2024ReLU2 Wins: Discovering Efficient Activation Functions for Sparse LLMscited by 66
- 2024ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Modelscited by 43
- 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameterscited by 37
- 2024Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanismcited by 31
- 2025BitNet b1.58 2B4T Technical Reportcited by 30
- 2024Learning Neural Networks with Sparse Activationscited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.