mlsanityData to 7 Oct 2026

Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researchers

arXiv 2302.02596 ↗First posted 6 Feb 2023cs.LGcited by 25

Not on the map. Why?

Abstract (arXiv)

This article does not propose any novel algorithm or new hardware for sparsity. Instead, it aims to serve the "common good" for the increasingly prosperous Sparse Neural Network (SNN) research community. We attempt to summarize some most common confusions in SNNs, that one may come across in various scenarios such as paper review/rebuttal and talks - many drawn from the authors' own bittersweet experiences! We feel that doing so is meaningful and timely, since the focus of SNN research is notably shifting from traditional pruning to more diverse and profound forms of sparsity before, during, and after training. The intricate relationships between their scopes, assumptions, and approaches lead to misunderstandings, for non-experts or even experts in SNNs. In response, we summarize ten Q&As of SNNs from many key aspects, including dense vs. sparse, unstructured sparse vs. structured sparse, pruning vs. sparse training, dense-to-sparse training vs. sparse-to-sparse training, static sparsity vs. dynamic sparsity, before-training/during-training vs. post-training sparsity, and many more. We strive to provide proper and generically applicable answers to clarify those confusions to the best extent possible. We hope our summary provides useful general knowledge for people who want to enter and engage with this exciting community; and also provides some "mind of ease" convenience for SNN researchers to explain their work in the right contexts. At the very least (and perhaps as this article's most insignificant target functionality), if you are writing/planning to write a paper or rebuttal in the field of SNNs, we hope some of our answers could help you!

Key facts. Cited by 25 papers in the map (data through 7 Oct 2026). Builds on 81 of its 110 references that are in the map. First posted on arXiv 6 Feb 2023.

Builds on

81 of 110 references.

References · 81

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,539
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  5. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  6. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  7. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  8. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  9. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  11. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
  12. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,242
38 more
  1. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  2. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  3. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  5. 2021Scaling Vision with Sparse Mixture of Expertscited by 740
  6. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  7. 2020What is the State of Neural Network Pruning?cited by 578
  8. 2021Carbon Emissions and Large Neural Network Trainingcited by 561
  9. 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
  10. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  11. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  12. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  13. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  14. 2019The State of Sparsity in Deep Neural Networkscited by 471
  15. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  16. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
  17. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  18. 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 315
  19. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  20. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  21. 2021Hash Layers For Large Sparse Modelscited by 236
  22. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  23. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  24. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
  25. 2021DICE: Leveraging Sparsification for Out-of-Distribution Detectioncited by 166
  26. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  27. 2020Sparse GPU Kernels for Deep Learningcited by 138
  28. 2017Deep Rewiring: Training very sparse deep networkscited by 136
  29. 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
  30. 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
  31. 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
  32. 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
  33. 2022M3ViT: Mixture-of-Experts Vision Transformer for Efficient Multi-task Learning with Model-Accelerator Co-designcited by 97
  34. 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
  35. 2019Fast Sparse ConvNetscited by 86
  36. 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
  37. 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
  38. 2022Pathways: Asynchronous Distributed Dataflow for MLcited by 81

50 most cited of 81 All 81 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 13; 2024: 8; 2025: 3; 2026: 1.

25 papers.

Sort:

By area:

  1. 2023Challenges and Applications of Large Language Modelscited by 251
  2. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
  3. 2024KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approachescited by 43
  4. 2023No Train No Gain: Revisiting Efficient Training Algorithms For Transformer-based Language Modelscited by 41
  5. 2023Visual Tuningcited by 34
  6. 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27
  7. 2023E2ENet: Dynamic Sparse Feature Fusion for Accurate and Efficient 3D Medical Image Segmentationcited by 16
  8. 2023JaxPruner: A concise library for sparsity researchcited by 13
  9. 2024Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustnesscited by 11
  10. 2024Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustnesscited by 10
  11. 2023Continual Learning with Dynamic Sparse Training: Exploring Algorithms for Effective Model Updatescited by 8
  12. 2023A Theoretical Explanation of Activation Sparsity through Flat Minima and Adversarial Robustnesscited by 7
13 more
  1. 2024Efficient Model Compression Techniques with FishLegcited by 4
  2. 2024Sparser, Better, Deeper, Stronger: Improving Sparse Training with Exact Orthogonal Initializationcited by 3
  3. 2024Navigating Extremes: Dynamic Sparsity in Large Output Spacescited by 3
  4. 2025Accelerating Linear Recurrent Neural Networks for the Edge with Unstructured Sparsitycited by 3
  5. 2025Dynamic Sparse Training of Diagonally Sparse Networkscited by 3
  6. 2023Adaptive Sparsity Level during Training for Efficient Time Series Forecasting with Transformerscited by 1
  7. 2023Importance Estimation with Random Gradient for Neural Network Pruningcited by 1
  8. 2024A Neural Network Alternative to Tree-based Modelscited by 1
  9. 2023Vision Transformers for Mobile Applications: A Short Surveycited by 0
  10. 2023Neural Network Pruning for Real-time Polyp Segmentationcited by 0
  11. 2024Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learningcited by 0
  12. 2025Batch Matrix-form Equations and Implementation of Multilayer Perceptronscited by 0
  13. 2026Exploring the impact of adaptive rewiring in Graph Neural Networkscited by 0