arXiv:2608.23048cs.LG2026-08中稿 · EMNLP

提出轻量级可学习稀疏化框架,高效实现大模型硬件友好稀疏加速。

Reservoir of Importance: Learning Semi-Structured Sparsity with Differentiable Subset Sampling

论文配图:Reservoir of Importance: Learning Semi-Structured Sparsity with Differentiable Subset Sampling
图 1 · 摘自论文原文
  • 通过可微子集采样,用线性参数量学习半结构化稀疏模式。
  • 在0.5-7B模型上实现1.5-8.75倍参数减少,内存开销显著降低。
  • 适合追求高效部署的大规模语言模型,尤其适用于高密度稀疏场景。

半结构化N:M稀疏性已成为加速大语言模型(LLMs)的实用方向。然而,现有可学习掩码方法带来显著参数与内存开销,限制了其在大模型和激进稀疏率下的可扩展性。本文提出轻量级半结构化剪枝框架Reservoir of Importance(RoI),通过可微子集采样学习稀疏掩码。不同于以往对所有可行N:M模式建模全分类分布的方法,RoI采用紧凑的对数概率参数化,并无放回采样选择掩码,将可训练参数从组合复杂度降至O(M)。结果表明,RoI所需可学习参数减少1.5-8.75倍,内存消耗大幅降低,同时完全兼容硬件友好的稀疏模式。在Qwen2.5系列模型(0.5-7B参数)上的广泛评估显示,RoI在性能上具有竞争力,且具备出色的内存效率、稳定性与向更激进的N:M稀疏模式扩展的能力,为高效大模型部署提供可行路径。

原文摘要 · Abstract (English)

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.

稀疏化大模型压缩可学习掩码硬件友好

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。