mlsanityData to 14 Oct 2026

CHEX: CHannel EXploration for CNN Model Compression

arXiv 2203.15794 ↗First posted 29 Mar 2022cs.CVcited by 36

Not on the map. Why?

Abstract (arXiv)

Channel pruning has been broadly recognized as an effective technique to reduce the computation and memory cost of deep convolutional neural networks. However, conventional pruning methods have limitations in that: they are restricted to pruning process only, and they require a fully pre-trained large model. Such limitations may lead to sub-optimal model quality as well as excessive memory and training cost. In this paper, we propose a novel Channel Exploration methodology, dubbed as CHEX, to rectify these problems. As opposed to pruning-only strategy, we propose to repeatedly prune and regrow the channels throughout the training process, which reduces the risk of pruning important channels prematurely. More exactly: From intra-layer's aspect, we tackle the channel pruning problem via a well known column subset selection (CSS) formulation. From inter-layer's aspect, our regrowing stages open a path for dynamically re-allocating the number of channels across all the layers under a global channel sparsity constraint. In addition, all the exploration process is done in a single training from scratch without the need of a pre-trained large model. Experimental results demonstrate that CHEX can effectively reduce the FLOPs of diverse CNN architectures on a variety of computer vision tasks, including image classification, object detection, instance segmentation, and 3D vision. For example, our compressed ResNet-50 model on ImageNet dataset achieves 76% top1 accuracy with only 25% FLOPs of the original ResNet-50 model, outperforming previous state-of-the-art channel pruning methods. The checkpoints and code are available at here .

Key facts. Cited by 36 papers in the map (data through 14 Oct 2026). Builds on 68 of its 90 references that are in the map. First posted on arXiv 29 Mar 2022.

Builds on

68 of 90 references.

References · 68

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  3. 2017Mask R-CNNcited by 7,277
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  5. 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,401
  6. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  7. 2015SSD: Single Shot MultiBox Detectorcited by 3,130
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  9. 2019Searching for MobileNetV3cited by 1,994
  10. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  11. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  12. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
38 more
  1. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  2. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  3. 2019Green AIcited by 627
  4. 2018Rethinking the Value of Network Pruningcited by 599
  5. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  6. 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
  7. 2019Importance Estimation for Neural Network Pruningcited by 541
  8. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  9. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  10. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
  11. 2018Bag of Tricks for Image Classification with Convolutional Neural Networkscited by 431
  12. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
  13. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
  14. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  15. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  16. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  17. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  18. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
  19. 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
  20. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  21. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  22. 2018NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applicationscited by 147
  23. 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 146
  24. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  25. 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
  26. 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
  27. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 93
  28. 2021Dynamic Slimmable Networkcited by 83
  29. 2019Network Pruning via Transformable Architecture Searchcited by 80
  30. 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
  31. 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
  32. 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
  33. 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
  34. 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
  35. 2021Convolutional Neural Network Pruning with Structural Redundancy Reductioncited by 73
  36. 2019Pruning from Scratchcited by 72
  37. 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
  38. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70

50 most cited of 68 All 68 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 18; 2024: 12; 2025: 3; 2026: 1.

36 papers.

Sort:

By area:

  1. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  2. 2024SGLP: A Similarity Guided Fast Layer Partition Pruning for Compressing Large Deep Modelscited by 25
  3. 2024A Survey of Lottery Ticket Hypothesiscited by 24
  4. 2023Rethinking Graph Lottery Tickets: Graph Sparsity Matterscited by 23
  5. 2023HALOC: Hardware-Aware Automatic Low-Rank Compression for Compact Neural Networkscited by 20
  6. 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 18
  7. 2022Trainability Preserving Neural Pruningcited by 16
  8. 2023CP3: Channel Pruning Plug-in for Point-based Networkscited by 10
  9. 2023CAIT: Triple-Win Compression towards High Accuracy, Fast Inference, and Favorable Transferability For ViTscited by 9
  10. 2024An Effective Information Theoretic Framework for Channel Pruningcited by 7
  11. 2022Point Cloud Scene Completion with Joint Color and Semantic Estimation from Single RGB-D Imagecited by 6
  12. 2023Lossy and Lossless (L2) Post-training Model Size Compressioncited by 4
24 more
  1. 2024REPrune: Channel Pruning via Kernel Representative Selectioncited by 4
  2. 2026MIS-HCC: Hierarchical Channel Clustering for Efficient Medical Image Segmentationcited by 4
  3. 2023Resource Constrained Model Compression via Minimax Optimization for Spiking Neural Networkscited by 3
  4. 2024Automatic Channel Pruning for Multi-Head Attentioncited by 3
  5. 2023Structured Bayesian Compression for Deep Neural Networks Based on The Turbo-VBI Approachcited by 2
  6. 2024Enhanced Sparsification via Stimulative Trainingcited by 2
  7. 2023Learning a Consensus Sub-Network with Polarization Regularization and One Pass Trainingcited by 1
  8. 2023Frequency Regularization: Restricting Information Redundancy of Convolutional Neural Networkscited by 1
  9. 2023Layer-adaptive Structured Pruning Guided by Latencycited by 1
  10. 2023A Differentiable Framework for End-to-End Learning of Hybrid Structured Compressioncited by 1
  11. 2023SUBP: Soft Uniform Block Pruning for 1xN Sparse CNNs Multithreading Accelerationcited by 1
  12. 2023Cooperative Learning for Cost-Adaptive Inferencecited by 1
  13. 2024Separate, Dynamic and Differentiable (SMART) Pruner for Block/Output Channel Pruning on Computer Vision Taskscited by 1
  14. 2025Advancing Weight and Channel Sparsification with Enhanced Saliencycited by 1
  15. 2025EcoSpa: Efficient Transformer Training with Coupled Sparsitycited by 1
  16. 2023Structured Pruning for Multi-Task Deep Neural Networkscited by 0
  17. 2023MaxQ: Multi-Axis Query for N:M Sparsity Networkcited by 0
  18. 2023CR-SFP: Learning Consistent Representation for Soft Filter Pruningcited by 0
  19. 2024A Comprehensive Study of Structural Pruning for Vision Modelscited by 0
  20. 2024ISQuant: apply squant to the real deploymentcited by 0
  21. 2024Unified Framework for Pre-trained Neural Network Compression via Decomposition and Optimized Rank Selectioncited by 0
  22. 2024S2HPruner: Soft-to-Hard Distillation Bridges the Discretization Gap in Pruningcited by 0
  23. 2024QIANets: Quantum-Integrated Adaptive Networks for Reduced Latency and Improved Inference Times in CNN Modelscited by 0
  24. 2025A Novel Compression Framework for YOLOv8: Achieving Real-Time Aerial Object Detection on Edge Devices via Structured Pruning and Channel-Wise Distillationcited by 0