mlsanityData to 7 Oct 2026

MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge

arXiv 2110.14032 ↗First posted 26 Oct 2021cs.LG cs.AI cs.CVcited by 77

Not on the map. Why?

Abstract (arXiv)

Recently, a new trend of exploring sparsity for accelerating neural network training has emerged, embracing the paradigm of training on the edge. This paper proposes a novel Memory-Economic Sparse Training (MEST) framework targeting for accurate and fast execution on edge devices. The proposed MEST framework consists of enhancements by Elastic Mutation (EM) and Soft Memory Bound (&S) that ensure superior accuracy at high sparsity ratios. Different from the existing works for sparse training, this current work reveals the importance of sparsity schemes on the performance of sparse training in terms of accuracy as well as training speed on real edge devices. On top of that, the paper proposes to employ data efficiency for further acceleration of sparse training. Our results suggest that unforgettable examples can be identified in-situ even during the dynamic exploration of sparsity masks in the sparse training process, and therefore can be removed for further training speedup on edge devices. Comparing with state-of-the-art (SOTA) works on accuracy, our MEST increases Top-1 accuracy significantly on ImageNet when using the same unstructured sparsity scheme. Systematical evaluation on accuracy, training speed, and memory footprint are conducted, where the proposed MEST framework consistently outperforms representative SOTA works. A reviewer strongly against our work based on his false assumptions and misunderstandings. On top of the previous submission, we employ data efficiency for further acceleration of sparse training. And we explore the impact of model sparsity, sparsity schemes, and sparse training algorithms on the number of removable training examples. Our codes are publicly available at: https://github.com/boone891214/MEST.

Key facts. Cited by 77 papers in the map (data through 7 Oct 2026). Builds on 43 of its 54 references that are in the map. First posted on arXiv 26 Oct 2021.

Builds on

43 of 54 references.

References · 43

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
  5. 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
  6. 2018Efficient Neural Architecture Search via Parameter Sharingcited by 831
  7. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  8. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  9. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  10. 2018Rethinking the Value of Network Pruningcited by 595
  11. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  12. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
31 more
  1. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  2. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  3. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
  4. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  5. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  6. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  7. 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
  8. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  9. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  10. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
  11. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  12. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  13. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  14. 2017Deep Rewiring: Training very sparse deep networkscited by 136
  15. 2015Fast Algorithms for Convolutional Neural Networkscited by 102
  16. 2019Network Pruning via Transformable Architecture Searchcited by 80
  17. 2020PatDNN: Achieving Real-Time DNN Execution on Mobile Devices with Pattern-based Weight Pruningcited by 75
  18. 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
  19. 2021Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?cited by 52
  20. 2019PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-time Execution on Mobile Devicescited by 48
  21. 2019PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfigurationcited by 41
  22. 2017Structured Bayesian Pruning via Log-Normal Multiplicative Noisecited by 39
  23. 2019Non-Structured DNN Weight Pruning -- Is It Beneficial in Any Platform?cited by 31
  24. 2021Lottery Ticket Preserves Weight Correlation: Is It Desirable or Not?cited by 22
  25. 2017Learning What Data to Learncited by 21
  26. 2020RTMobile: Beyond Real-Time Mobile Acceleration of RNNs for Speech Recognitioncited by 19
  27. 2020Single Shot Structured Pruning Before Trainingcited by 19
  28. 2020An Image Enhancing Pattern-based Sparsity for Real-time Inference on Mobile Devicescited by 18
  29. 2020FreezeNet: Full Performance by Reduced Storage Costscited by 13
  30. 2021GRIM: A General, Real-Time Deep Learning Inference Framework for Mobile Devices based on Fine-Grained Structured Weight Sparsitycited by 10
  31. 2018Efficient Hardware Realization of Convolutional Neural Networks using Intra-Kernel Regular Pruningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 15; 2023: 15; 2024: 24; 2025: 15; 2026: 4.

77 papers.

Sort:

By area:

  1. 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruningcited by 165
  2. 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
  3. 2022SparCL: Sparse Continual Learning on the Edgecited by 55
  4. 2021Federated Learning for Internet of Things: Applications, Challenges, and Opportunitiescited by 49
  5. 2022Compute-Efficient Deep Learning: Algorithmic Trends and Opportunitiescited by 38
  6. 2022CHEX: CHannel EXploration for CNN Model Compressioncited by 36
  7. 2023Dynamic Sparse Training with Structured Sparsitycited by 36
  8. 2021FedCV: A Federated Learning Framework for Diverse Computer Vision Taskscited by 32
  9. 2022F8Net: Fixed-Point 8-bit Only Multiplication for Network Quantizationcited by 26
  10. 2022Why Random Pruning Is All We Need to Start Sparsecited by 26
  11. 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
  12. 2022Peeling the Onion: Hierarchical Reduction of Data Redundancy for Efficient Vision Transformer Trainingcited by 24
38 more
  1. 2023Rethinking Graph Lottery Tickets: Graph Sparsity Matterscited by 23
  2. 2024A Survey of Lottery Ticket Hypothesiscited by 23
  3. 2022Dynamic Sparse Network for Time Series Classification: Learning What to "see''cited by 22
  4. 2022Compiler-Aware Neural Architecture Search for On-Mobile Real-time Super-Resolutioncited by 20
  5. 2022Towards Sparsification of Graph Neural Networkscited by 18
  6. 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 17
  7. 2023Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Trainingcited by 16
  8. 2023E2ENet: Dynamic Sparse Feature Fusion for Accurate and Efficient 3D Medical Image Segmentationcited by 16
  9. 2022Where to Pay Attention in Sparse Training for Feature Selection?cited by 15
  10. 2022Dynamic Sparse Training via Balancing the Exploration-Exploitation Trade-offcited by 15
  11. 2025Sculpting Memory: Multi-Concept Forgetting in Diffusion Models via Dynamic Mask and Concept-Aware Optimizationcited by 15
  12. 2024Beware of Calibration Data for Pruning Large Language Modelscited by 14
  13. 2025Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-Probingcited by 14
  14. 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMscited by 13
  15. 2024SmartFRZ: An Efficient Training Framework using Attention-Based Layer Freezingcited by 12
  16. 2022Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Costcited by 11
  17. 2022Layer Freezing & Data Sieving: Missing Pieces of a Generic Framework for Sparse Trainingcited by 11
  18. 2024Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustnesscited by 11
  19. 2024Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awarenesscited by 10
  20. 2025RoRA: Efficient Fine-Tuning of LLM with Reliability Optimization for Rank Adaptationcited by 9
  21. 2021Automatic Mapping of the Best-Suited DNN Pruning Schemes for Real-Time Mobile Accelerationcited by 7
  22. 2023Towards High-Quality and Efficient Video Super-Resolution via Spatial-Temporal Data Overfittingcited by 7
  23. 2023Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiencycited by 7
  24. 2022Superposing Many Tickets into One: A Performance Booster for Sparse Neural Network Trainingcited by 6
  25. 2024On the Limitations of Language Targeted Pruning: Investigating the Calibration Language Impact in Multilingual LLM Pruningcited by 6
  26. 2024SCAN: Bootstrapping Contrastive Pre-training for Data Efficiencycited by 6
  27. 2025Sign-In to the Lottery: Reparameterizing Sparse Training From Scratchcited by 6
  28. 2022All-in-One: A Highly Representative DNN Pruning Framework for Edge Devices with Dynamic Power Managementcited by 5
  29. 2024Sparse Spectral Training and Inference on Euclidean and Hyperbolic Neural Networkscited by 4
  30. 2024Fast and Controllable Post-training Sparsity: Learning Optimal Sparsity Allocation with Global Constraint in Minutescited by 3
  31. 2024Unveiling the Power of Sparse Neural Networks for Feature Selectioncited by 3
  32. 2025Brain network science modelling of sparse neural networks enables Transformers and LLMs to perform as fully connectedcited by 3
  33. 2025Dynamic Sparse Training of Diagonally Sparse Networkscited by 3
  34. 2023AUTOSPARSE: Towards Automated Sparse Training of Deep Neural Networkscited by 2
  35. 2023REST: Enhancing Group Robustness in DNNs through Reweighted Sparse Trainingcited by 2
  36. 2024Center-Sensitive Kernel Optimization for Efficient On-Device Incremental Learningcited by 2
  37. 2024Efficient Training with Denoised Neural Weightscited by 2
  38. 2024Nerva: a Truly Sparse Implementation of Neural Networkscited by 2

50 most cited of 77 All 77 (JSON)