TL;DR
MaskPro introduces a probabilistic learning framework for efficient (N:M)-sparsity in large language models, improving inference speed and memory use with robust training methods.
Contribution
It proposes a novel linear-space probabilistic approach for (N:M)-sparsity, addressing errors and training costs of prior methods.
Findings
MaskPro achieves superior sparsity performance in LLMs.
The method demonstrates excellent scalability and robustness.
Extensive experiments validate its effectiveness.
Abstract
The rapid scaling of large language models~(LLMs) has made inference efficiency a primary bottleneck in the practical deployment. To address this, semi-structured sparsity offers a promising solution by strategically retaining elements out of every weights, thereby enabling hardware-friendly acceleration and reduced memory. However, existing (N:M)-compatible approaches typically fall into two categories: rule-based layerwise greedy search, which suffers from considerable errors, and gradient-driven combinatorial learning, which incurs prohibitive training costs. To tackle these challenges, we propose a novel linear-space probabilistic framework named MaskPro, which aims to learn a prior categorical distribution for every consecutive weights and subsequently leverages this distribution to generate the (N:M)-sparsity throughout an -way sampling without replacement.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
