Sparse-BitNet: 1.58-bit LLMs are Naturally Friendly to Semi-Structured Sparsity
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908868435509248 |
|---|---|
| author | Zhang, Di Wu, Xun Huang, Shaohan Wang, Yudong Shao, Hanyong Hao, Yingbo Chi, Zewen Dong, Li Song, Ting Xia, Yan Sui, Zhifang Wei, Furu |
| author_facet | Zhang, Di Wu, Xun Huang, Shaohan Wang, Yudong Shao, Hanyong Hao, Yingbo Chi, Zewen Dong, Li Song, Ting Xia, Yan Sui, Zhifang Wei, Furu |
| contents | Semi-structured N:M sparsity and low-bit quantization (e.g., 1.58-bit BitNet) are two promising approaches for improving the efficiency of large language models (LLMs), yet they have largely been studied in isolation. In this work, we investigate their interaction and show that 1.58-bit BitNet is naturally more compatible with N:M sparsity than full-precision models. To study this effect, we propose Sparse-BitNet, a unified framework that jointly applies 1.58-bit quantization and dynamic N:M sparsification while ensuring stable training for the first time. Across multiple model scales and training regimes (sparse pretraining and dense-to-sparse schedules), 1.58-bit BitNet consistently exhibits smaller performance degradation than full-precision baselines at the same sparsity levels and can tolerate higher structured sparsity before accuracy collapse. Moreover, using our custom sparse tensor core, Sparse-BitNet achieves substantial speedups in both training and inference, reaching up to 1.30X. These results highlight that combining extremely low-bit quantization with semi-structured N:M sparsity is a promising direction for efficient LLMs. Code available at https://github.com/AAzdi/Sparse-BitNet |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_05168 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sparse-BitNet: 1.58-bit LLMs are Naturally Friendly to Semi-Structured Sparsity Zhang, Di Wu, Xun Huang, Shaohan Wang, Yudong Shao, Hanyong Hao, Yingbo Chi, Zewen Dong, Li Song, Ting Xia, Yan Sui, Zhifang Wei, Furu Computation and Language Semi-structured N:M sparsity and low-bit quantization (e.g., 1.58-bit BitNet) are two promising approaches for improving the efficiency of large language models (LLMs), yet they have largely been studied in isolation. In this work, we investigate their interaction and show that 1.58-bit BitNet is naturally more compatible with N:M sparsity than full-precision models. To study this effect, we propose Sparse-BitNet, a unified framework that jointly applies 1.58-bit quantization and dynamic N:M sparsification while ensuring stable training for the first time. Across multiple model scales and training regimes (sparse pretraining and dense-to-sparse schedules), 1.58-bit BitNet consistently exhibits smaller performance degradation than full-precision baselines at the same sparsity levels and can tolerate higher structured sparsity before accuracy collapse. Moreover, using our custom sparse tensor core, Sparse-BitNet achieves substantial speedups in both training and inference, reaching up to 1.30X. These results highlight that combining extremely low-bit quantization with semi-structured N:M sparsity is a promising direction for efficient LLMs. Code available at https://github.com/AAzdi/Sparse-BitNet |
| title | Sparse-BitNet: 1.58-bit LLMs are Naturally Friendly to Semi-Structured Sparsity |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2603.05168 |