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 $\mathcal{O}({M})$. As a result, RoI requires 1.5-8.75$\times$ 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.
Lua-LLM is proposed, a learning-based global pruning framework that explores the optimal unstructured sparsity allocation and achieves flexible allocation for both layer-wise and intra-layer sparsity.
Ming Lu, Jing-Wei Sun, Jun-Qing Lin et al.· Neural Information Processin...· 1 citation
Beyond efficiency and generalization, DAP natively provides increased robustness to adversarial perturbations and yields highly interpretable models, where the retained weights reliably encapsulate the most domain-invariant and task-critical representations.
S$^4$R is proposed, which builds low-rank subspaces from selectively sampled tokens and computes attention over a sparsely reconstructed KV representation, combining the efficiency of fixed compression with the adaptability of prompt-dependent methods.
Under a $\sigma$-smoothed adaptive adversary, a tight $O(\sqrt{\sigma T})$ bound on the depth of the data structure is proved, and an $O(\log T)$ bound under a random-order adversary is proved -- to the authors' knowledge, the first such results for this class of problems.
Amirmahdi Mirfakhar, M. Balcan, Hedyeh Beyhaghi· arXiv.org· 0 citations
REP-LIE leverages the gradients of LoRA low-rank matrices to estimate the importance of weights without requiring full gradient computation, and a stability score is introduced, serving as the basis for iterative pruning of unimportant model parameters.
Peng Liu, Hui-Bing Zeng, Yi-Qun Zhang et al.· IEEE Transactions on Emergin...· 0 citations
Influence functions provide a principled framework for tracing model predictions back to training data, yet existing methods remain impractical for large language models due to prohibitive storage and I/O costs. Prior approaches face two critical barriers: the Fidelity Gap from coarse curvature approximations, and the...
Mengyi Yan, Yaoshu Wang, Guangyi Zhang et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.