Bi-directional Masks for Efficient N: M Sparse Training
Yuxin Zhang, Yiting Luo, Mingbao Lin, Yunshan Zhong, Jingjing Xie, Fei Chao, Rongrong Ji
Abstract
We focus on addressing the dense backward propagation issue for training efficiency of N:M fine-grained sparsity that preserves at most N out of M consecutive weights and achieves practical speedups supported by the N:M sparse tensor core. Therefore, we present a novel method of Bi-directional Masks (Bi-Mask) with its two central innovations in: 1) Separate sparse masks in the two directions of forward and backward propagation to obtain training acceleration. It disentangles the forward and backward weight sparsity and overcomes the very dense gradient computation. 2) An efficient weight row permutation method to maintain performance. It picks up the permutation candidate with the most eligible N:M weight blocks in the backward to minimize the gradient gap between traditional uni-directional masks and our bi-directional masks. Compared with existing uni-directional scenario that applies a transposable mask and enables backward acceleration, our Bi-Mask is experimentally demonstrated to be more superior in performance. Also, our Bi-Mask performs on par with or even better than methods that fail to achieve backward acceleration. Project of this paper is available at https://github.com/zyxxmu/Bi-Mask.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 63c17c82-ddb9-4d12-8b0b-6e4ae0431497Cited by top-tier papers6
- S-STE: Continuous Pruning Function for Efficient 2: 4 Sparse Pre-trainingYuezhou Hu, Jun Zhu, Jianfei ChenNeurIPS 2024 · 14 citations
- Epitopological learning and Cannistraci-Hebb network shape intelligence brain-inspired theory for ultra-sparse advantage in deep learningYingtao Zhang, Jialin Zhao, Wenjing Wu, Alessandro Muscoloni et al.ICLR 2024 · 10 citations
- MaxQ: Multi-Axis Query for N: m Sparsity NetworkJingyang Xiang, Siqi Li, Junhao Chen, Zhuangzhi Chen et al.CVPR 2024 · 2 citations
- Sheared Backpropagation for Fine-Tuning Foundation ModelsZhiyuan Yu, Li Shen, Liang Ding, Xinmei Tian et al.CVPR 2024 · 2 citations
- SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMsMohammad Mozaffari, Amir Yazdanbakhsh, Zhao Zhang, Maryam Mehri DehnaviICLR 2025
Builds on12
- Training data-efficient image transformers & distillation through attentionHugo Touvron, Matthieu Cord, Matthijs Douze, Francisco Massa et al.ICML 2021 · 8,974 citations
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro et al.ICML 2020 · 723 citations
- Movement Pruning: Adaptive Sparsity by Fine-TuningVictor Sanh, Thomas Wolf, Alexander M. RushNeurIPS 2020 · 656 citations
- MetaPruning: Meta Learning for Automatic Neural Network Channel PruningZechun Liu, Haoyuan Mu, Xiangyu Zhang, Zichao Guo et al.ICCV 2019 · 633 citations
- Comparing Rewinding and Fine-tuning in Neural Network PruningAlex Renda, Jonathan Frankle, Michael CarbinICLR 2020 · 437 citations
Related papers
- BAME: Block-Aware Mask Evolution for Efficient N: M Sparse TrainingChenyi Yang, Wenjie Nie, Yuxin Zhang, Yuhang Wu et al.ICML 2025
- Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable MasksItay Hubara, Brian Chmiel, Moshe Island, Ron Banner et al.NeurIPS 2021 · 148 citations
- Minimum Variance Unbiased N: M Sparsity for the Neural GradientsBrian Chmiel, Itay Hubara, Ron Banner, Daniel SoudryICLR 2023
- BBS: Bi-Directional Bit-Level Sparsity for Deep Learning AccelerationYuzong Chen, Jian Meng, Jae-sun Seo, Mohamed S. AbdelfattahMICRO 2024 · 25 citations
- TSENOR: Highly-Efficient Algorithm for Finding Transposable N: M Sparse MasksXiang Meng, Mehdi Makni, Rahul MazumderNeurIPS 2025
