Sparse-BitNet: 1.58-bit LLMs are Naturally Friendly to Semi-Structured Sparsity

Di Zhang, Xun Wu, Shaohan Huang, Yudong Wang, Hanyong Shao +7 more
3/5/2026
cs.CL

Official code: AAzdi/Sparse-BitNet (17 stars, MIT, last commit 2026-03-10).

Abstract

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

View on arXivView PDF

Code Implementations(1)

MIT
173Shell, PythonMar 5, 20267 months agoMIT

Similar Papers

Cite this paper

@article{zhang2026sparsebitnet,
  title  = {Sparse-BitNet: 1.58-bit LLMs are Naturally Friendly to Semi-Structured Sparsity},
  author = {Di Zhang and Xun Wu and Shaohan Huang and Yudong Wang and Hanyong Shao and Yingbo Hao and Zewen Chi and Li Dong and Ting Song and Yan Xia and Zhifang Sui and Furu Wei},
  year   = {2026},
  eprint = {2603.05168},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.05168v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.05168.svg)](https://codeofpaper.com/paper/2603.05168)

Discussion