mlsanityData to 14 Oct 2026

HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruning

arXiv 2409.09085 ↗First posted 11 Sep 2024cs.LG cs.CV eess.IVcited by 4

Not on the map. Why?

Abstract (arXiv)

Structured pruning is one of the most popular approaches to effectively compress the heavy deep neural networks (DNNs) into compact sub-networks while retaining performance. The existing methods suffer from multi-stage procedures along with significant engineering efforts and human expertise. The Only-Train-Once (OTO) series has been recently proposed to resolve the many pain points by streamlining the workflow by automatically conducting (i) search space generation, (ii) structured sparse optimization, and (iii) sub-network construction. However, the built-in sparse optimizers in the OTO series, i.e., the Half-Space Projected Gradient (HSPG) family, have limitations that require hyper-parameter tuning and the implicit controls of the sparsity exploration, consequently requires intervening by human expertise. To address such limitations, we propose a Hybrid Efficient Structured Sparse Optimizer (HESSO). HESSO could automatically and efficiently train a DNN to produce a high-performing subnetwork. Meanwhile, it is almost tuning-free and enjoys user-friendly integration for generic training applications. To address another common issue of irreversible performance collapse observed in pruning DNNs, we further propose a Corrective Redundant Identification Cycle (CRIC) for reliably identifying indispensable structures. We numerically demonstrate the efficacy of HESSO and its enhanced version HESSO-CRIC on a variety of applications ranging from computer vision to natural language processing, including large language model. The numerical results showcase that HESSO can achieve competitive even superior performance to varying state-of-the-arts and support most DNN architectures. Meanwhile, CRIC can effectively prevent the irreversible performance collapse and further enhance the performance of HESSO on certain applications.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 51 of its 69 references that are in the map. First posted on arXiv 11 Sep 2024.

Builds on

51 of 69 references.

References · 51

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  4. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,852
  5. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  6. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  7. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  9. 2019Searching for MobileNetV3cited by 1,994
  10. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
  11. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  12. 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
38 more
  1. 2019The State of Sparsity in Deep Neural Networkscited by 476
  2. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  3. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
  4. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  5. 2018Fast, Accurate, and Lightweight Super-Resolution with Cascading Residual Networkcited by 264
  6. 2023DepGraph: Towards Any Structural Pruningcited by 203
  7. 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
  8. 2021Block Pruning For Faster Transformerscited by 177
  9. 2022Structured Pruning Learns Compact and Accurate Modelscited by 170
  10. 2018Neural Architecture Optimizationcited by 167
  11. 2024DistiLLM: Towards Streamlined Distillation for Large Language Modelscited by 163
  12. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  13. 2020Bayesian Bits: Unifying Quantization and Pruningcited by 94
  14. 2020ResRep: Lossless CNN Pruning via Decoupling Remembering and Forgettingcited by 85
  15. 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
  16. 2020Highly Efficient Salient Object Detection with 100K Parameterscited by 79
  17. 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
  18. 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
  19. 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
  20. 2020Pruning Filter in Filtercited by 47
  21. 2023LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recoverycited by 38
  22. 2019NAT: Neural Architecture Transformer for Accurate and Compact Architecturescited by 33
  23. 2023OTOV2: Automatic, Generic, User-Friendlycited by 32
  24. 2018Accelerate CNN via Recursive Bayesian Pruningcited by 27
  25. 2023The Efficiency Spectrum of Large Language Models: An Algorithmic Surveycited by 26
  26. 2020Orthant Based Proximal Stochastic Gradient Method for ℓ1-Regularized Optimizationcited by 20
  27. 2024Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratchcited by 20
  28. 2021Structured Sparsity Inducing Adaptive Optimizers for Deep Learningcited by 17
  29. 2020Neural Network Compression Via Sparse Optimizationcited by 13
  30. 2019Generative Adversarial Network for Handwritten Textcited by 12
  31. 2023DREAM: Diffusion Rectification and Estimation-Adaptive Modelscited by 12
  32. 2023CaesarNeRF: Calibrated Semantic Representation for Few-shot Generalizable Neural Renderingcited by 10
  33. 2024Structurally Prune Anything: Any Architecture, Any Framework, Any Timecited by 8
  34. 2016A Reduced-Space Algorithm for Minimizing ℓ1-Regularized Convex Functionscited by 7
  35. 2020Half-Space Proximal Stochastic Gradient Method for Group-Sparsity Regularized Problemcited by 7
  36. 2023NASH: A Simple Unified Framework of Structured Pruning for Accelerating Encoder-Decoder Language Modelscited by 7
  37. 2023OTOv3: Automatic Architecture-Agnostic Neural Network Training and Compression from Structured Pruning to Erasing Operatorscited by 6
  38. 2020Holistic Filter Pruning for Efficient Deep Neural Networkscited by 4

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

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

4 papers.