Reservoir of Importance: Learning Semi-Structured Sparsity with Differentiable Subset Sampling
Not on the map. Why?
Abstract (arXiv)
Semi-structured N:M sparsity has emerged as a practical direction for accelerating large language models (LLMs). However, existing learnable-mask approaches incur substantial parameter and memory overhead, limiting their scalability to large models and aggressive sparsity regimes. In this work, we revisit semi-structured pruning from a perspective that reconciles efficiency with scalability. We propose Reservoir of Importance (RoI), a lightweight semi-structured pruning framework that learns sparsity masks through differentiable subset sampling. Unlike prior methods that model full categorical distributions over all feasible N:M patterns, RoI introduces a compact-logit parameterization for sparsity mask learning and performs sampling without replacement to select masks, thereby reducing trainable parameters from combinatorial complexity to O(M). As a result, RoI requires 1.5-8.75× fewer learnable parameters and significantly lower memory cost, while remaining fully aligned with hardware-friendly sparsity patterns. Extensive evaluations across multiple scales of the Qwen2.5 LLM family (0.5-7B parameters) demonstrate that RoI achieves competitive performance with strong memory efficiency, stability, and scalability to more aggressive N:M sparsity patterns, offering a practical path toward efficient LLM deployment.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 27 references that are in the map. First posted on arXiv 24 Aug 2026.
Builds on
17 of 27 references.
References · 17
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
5 more
- 2018Neural Nearest Neighbors Networkscited by 98
- 2019Reparameterizable Subset Sampling via Continuous Relaxationscited by 70
- 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
- 2025Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-Probingcited by 14
- 2018Stochastic Variational Optimizationcited by 5
Built on by
Not cited yet.