Prox: Training-Free FFN Activation Sparsity via Approximate Intermediate-Channel Salience in LLMs
Not on the map. Why?
Abstract (arXiv)
Feed-forward networks (FFNs) dominate memory traffic and computation in large language model (LLM) inference, making them a primary target for activation sparsification. However, existing training-free methods suffer substantial model-quality degradation at high sparsity due to limitations in their channel-selection strategies. We observe that the SwiGLU intermediate state provides a highly effective channel-selection signal, but obtaining it requires costly dense computation. To address this, we present Prox, a two-stage training-free framework for sparse SwiGLU FFNs. Prox hinges on the key insight: sparse execution requires only the channel mask induced by the intermediate state, which can be constructed from the magnitude ranking of its entries rather than their exact values. Specifically, Stage 1 uses input sparsity and quantized proxy weights to construct a shared mask; Stage 2 computes the selected channels exactly, enabling sparse execution of all three projections. Across ten LLMs from six model families, Prox outperforms training-free baselines at all sparsity levels, achieves up to a 1.99× end-to-end decoding speedup at 70% FFN sparsity, and is compatible with quantization and sparse attention.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 30 Jul 2026.
Builds on
22 of 30 references.
References · 22
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 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
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2020GLU Variants Improve Transformercited by 1,724
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2016Language Modeling with Gated Convolutional Networkscited by 688
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
10 more
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
- 2024ReLU2 Wins: Discovering Efficient Activation Functions for Sparse LLMscited by 66
- 2023SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformercited by 60
- 2020Sparse Weight Activation Trainingcited by 45
- 2025RocketKV: Accelerating Long-Context LLM Inference via Two-Stage KV Cache Compressioncited by 41
- 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameterscited by 37
- 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inferencecited by 18
- 2025COUNTDOWN: Contextually Sparse Activation Filtering Out Unnecessary Weights in Down Projectioncited by 1
Built on by
Not cited yet.