mlsanityData to 14 Oct 2026

Dynamic Sparse Training of Diagonally Sparse Networks

arXiv 2506.11449 ↗First posted 13 Jun 2025cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Recent advances in Dynamic Sparse Training (DST) have pushed the frontier of sparse neural network training in structured and unstructured contexts, matching dense-model performance while drastically reducing parameter counts to facilitate model scaling. However, unstructured sparsity often fails to translate into practical speedups on modern hardware. To address this shortcoming, we propose DynaDiag, a novel structured sparse-to-sparse DST method that performs at par with unstructured sparsity. DynaDiag enforces a diagonal sparsity pattern throughout training and preserves sparse computation in forward and backward passes. We further leverage the diagonal structure to accelerate computation via a custom CUDA kernel, rendering the method hardware-friendly. Empirical evaluations on diverse neural architectures demonstrate that our method maintains accuracy on par with unstructured counterparts while benefiting from tangible computational gains. Notably, with 90% sparse linear layers in ViTs, we observe up to a 3.13x speedup in online inference without sacrificing model performance and a 1.59x speedup in training on a GPU compared to equivalent unstructured layers. Our source code is available at https://github.com/horizon-research/DynaDiag/.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 34 of its 58 references that are in the map. First posted on arXiv 13 Jun 2025.

Builds on

34 of 58 references.

References · 34

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2016Pointer Sentinel Mixture Modelscited by 3,096
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  4. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  5. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,446
  6. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  7. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  8. 2020What is the State of Neural Network Pruning?cited by 583
  9. 2019Importance Estimation for Neural Network Pruningcited by 541
  10. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  11. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  12. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
22 more
  1. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
  2. 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
  3. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
  4. 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 146
  5. 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 137
  6. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  7. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  8. 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
  9. 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 76
  10. 2021Global Vision Transformer Pruning with Hessian-Aware Saliencycited by 70
  11. 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Trainingcited by 41
  12. 2023Dynamic Sparse Training with Structured Sparsitycited by 38
  13. 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Modelscited by 36
  14. 2022Training Your Sparse Neural Network Better with Any Maskcited by 26
  15. 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspectivecited by 26
  16. 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
  17. 2024Accelerating Transformer Pre-training with 2:4 Sparsitycited by 19
  18. 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
  19. 2024High Performance Unstructured SpMM Computation Using Tensor Corescited by 8
  20. 2019On improving deep learning generalization with adaptive sparse connectivitycited by 7
  21. 2022Structured Pruning is All You Need for Pruning CNNs at Initializationcited by 7
  22. 2023Pruning Before Training May Improve Generalization, Provablycited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.