mlsanityData to 14 Oct 2026

Dynamic Sparsity Is Channel-Level Sparsity Learner

arXiv 2305.19454 ↗First posted 30 May 2023cs.LG cs.AI cs.CVcited by 18

Not on the map. Why?

Abstract (arXiv)

Sparse training has received an upsurging interest in machine learning due to its tantalizing saving potential for the entire training process as well as inference. Dynamic sparse training (DST), as a leading sparse training approach, can train deep neural networks at high sparsity from scratch to match the performance of their dense counterparts. However, most if not all DST prior arts demonstrate their effectiveness on unstructured sparsity with highly irregular sparse patterns, which receives limited support in common hardware. This limitation hinders the usage of DST in practice. In this paper, we propose Channel-aware dynamic sparse (Chase), which for the first time seamlessly translates the promise of unstructured dynamic sparsity to GPU-friendly channel-level sparsity (not fine-grained N:M or group sparsity) during one end-to-end training process, without any ad-hoc operations. The resulting small sparse networks can be directly accelerated by commodity hardware, without using any particularly sparsity-aware hardware accelerators. This appealing outcome is partially motivated by a hidden phenomenon of dynamic sparsity: off-the-shelf unstructured DST implicitly involves biased parameter reallocation across channels, with a large fraction of channels (up to 60%) being sparser than others. By progressively identifying and removing these channels during training, our approach translates unstructured sparsity to channel-wise sparsity. Our experimental results demonstrate that Chase achieves 1.7 X inference throughput speedup on common GPU devices without compromising accuracy with ResNet-50 on ImageNet. We release our codes in https://github.com/luuyin/chase.

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

Builds on

51 of 62 references.

References · 51

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  5. 2020Scaling Laws for Neural Language Modelscited by 6,586
  6. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,998
  7. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
  8. 2021Swin Transformer V2: Scaling Up Capacity and Resolutioncited by 1,228
  9. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  10. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  11. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  12. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
38 more
  1. 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
  2. 2021Carbon Emissions and Large Neural Network Trainingcited by 567
  3. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  4. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  5. 2019The State of Sparsity in Deep Neural Networkscited by 476
  6. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  7. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
  8. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
  9. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  10. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
  11. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
  12. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
  13. 2022More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsitycited by 142
  14. 2020Sparse GPU Kernels for Deep Learningcited by 141
  15. 2017Deep Rewiring: Training very sparse deep networkscited by 139
  16. 2021Group Fisher Pruning for Practical Network Compressioncited by 131
  17. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  18. 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
  19. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  20. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 93
  21. 2019Fast Sparse ConvNetscited by 86
  22. 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
  23. 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 84
  24. 2019Network Pruning via Transformable Architecture Searchcited by 80
  25. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  26. 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
  27. 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 78
  28. 2017Exploring Sparsity in Recurrent Neural Networkscited by 75
  29. 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 59
  30. 2021How Well Do Sparse Imagenet Models Transfer?cited by 50
  31. 2021Powerpropagation: A sparsity inducing weight reparameterisationcited by 49
  32. 2019Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardwarecited by 48
  33. 2019Dissecting the Graphcore IPU Architecture via Microbenchmarkingcited by 47
  34. 2022CHEX: CHannel EXploration for CNN Model Compressioncited by 36
  35. 2021Locally Free Weight Sharing for Network Width Searchcited by 27
  36. 2022Coarsening the Granularity: Towards Structurally Sparse Lottery Ticketscited by 27
  37. 2022Training Your Sparse Neural Network Better with Any Maskcited by 26
  38. 2015Diversity Networks: Neural Network Compression Using Determinantal Point Processescited by 25

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

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

18 papers.

Sort:

By area:

  1. 2023Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspectivecited by 23
  2. 2024Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruningcited by 20
  3. 2025Sculpting Memory: Multi-Concept Forgetting in Diffusion Models via Dynamic Mask and Concept-Aware Optimizationcited by 19
  4. 2025Keeping Yourself is Important in Downstream Tuning Multimodal Large Language Modelcited by 16
  5. 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMscited by 13
  6. 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
  7. 2024SpaFL: Communication-Efficient Federated Learning with Sparse Models and Low computational Overheadcited by 9
  8. 2024S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-trainingcited by 7
  9. 2024Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neuronscited by 6
  10. 2025Brain network science modelling of sparse neural networks enables Transformers and LLMs to perform as fully connectedcited by 4
  11. 2024Full-Rank No More: Low-Rank Weight Training for Modern Speech Recognition Modelscited by 3
  12. 2026Sparse Training of Neural Networks based on Multilevel Mirror Descentcited by 3
6 more
  1. 2024MSRS: Training Multimodal Speech Recognition Models from Scratch with Sparse Mask Optimizationcited by 2
  2. 2024Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruningcited by 1
  3. 2024Data Overfitting for On-Device Super-Resolution with Dynamic Algorithm and Compiler Co-Designcited by 0
  4. 2024(PASS) Visual Prompt Locates Good Structure Sparsity through a Recurrent HyperNetworkcited by 0
  5. 2026Towards Compact and Robust DNNs via Compression-aware Sharpness Minimizationcited by 0
  6. 2026BARTER: Compact Dynamic Sparse Training with Standard Dense Kernelscited by 0