mlsanityData to 14 Oct 2026

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

arXiv 2603.05168 ↗First posted 5 Mar 2026cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

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

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Mar 2026.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Q-Sparse: All Large Language Models can be Fully Sparsely-Activated
  2. 2025CAST: Continuous and Differentiable Semi-Structured Sparsity-Aware Training for Large Language Models
  3. 2025From 2:4 to 8:16 sparsity patterns in LLMs for Outliers and Weights with Variance Correction
  4. 2025Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Models
  5. 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference
  6. 2024SDQ: Sparse Decomposed Quantization for LLM Inference
  7. 2025Accelerating LLM Inference with Flexible N:M Sparsity via A Fully Digital Compute-in-Memory Accelerator
  8. 2024Aggressive Post-Training Compression on Extremely Large Language Models