mlsanityData to 14 Oct 2026

Bi-directional Masks for Efficient N:M Sparse Training

arXiv 2302.06058 ↗First posted 13 Feb 2023cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

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 urlhttps://github.com/zyxxmu/Bi-Mask.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 30 of its 41 references that are in the map. First posted on arXiv 13 Feb 2023.

Builds on

30 of 41 references.

References · 30

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2017Mask R-CNNcited by 7,277
  4. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
  5. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  6. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  7. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  9. 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,162
  10. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  11. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  12. 2016Pruning Filters for Efficient ConvNetscited by 1,143
18 more
  1. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  2. 2018Rethinking the Value of Network Pruningcited by 599
  3. 2020What is the State of Neural Network Pruning?cited by 583
  4. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  5. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  6. 2019The State of Sparsity in Deep Neural Networkscited by 476
  7. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  8. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  9. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
  10. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
  11. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
  12. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
  13. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
  14. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  15. 2020Pruning Filter in Filtercited by 47
  16. 2022Learning Best Combination for Efficient N:M Sparsitycited by 32
  17. 2022An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformerscited by 29
  18. 2022Minimum Variance Unbiased N:M Sparsity for the Neural Gradientscited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 3; 2025: 3; 2026: 4.

13 papers.

Sort:

By area: