LAPP: Layer Adaptive Progressive Pruning for Compressing CNNs from Scratch
Not on the map. Why?
Abstract (arXiv)
Structured pruning is a commonly used convolutional neural network (CNN) compression approach. Pruning rate setting is a fundamental problem in structured pruning. Most existing works introduce too many additional learnable parameters to assign different pruning rates across different layers in CNN or cannot control the compression rate explicitly. Since too narrow network blocks information flow for training, automatic pruning rate setting cannot explore a high pruning rate for a specific layer. To overcome these limitations, we propose a novel framework named Layer Adaptive Progressive Pruning (LAPP), which gradually compresses the network during initial training of a few epochs from scratch. In particular, LAPP designs an effective and efficient pruning strategy that introduces a learnable threshold for each layer and FLOPs constraints for network. Guided by both task loss and FLOPs constraints, the learnable thresholds are dynamically and gradually updated to accommodate changes of importance scores during training. Therefore the pruning strategy can gradually prune the network and automatically determine the appropriate pruning rates for each layer. What's more, in order to maintain the expressive power of the pruned layer, before training starts, we introduce an additional lightweight bypass for each convolutional layer to be pruned, which only adds relatively few additional burdens. Our method demonstrates superior performance gains over previous compression methods on various datasets and backbone architectures. For example, on CIFAR-10, our method compresses ResNet-20 to 40.3% without accuracy drop. 55.6% of FLOPs of ResNet-18 are reduced with 0.21% top-1 accuracy increase and 0.40% top-5 accuracy increase on ImageNet.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 50 of its 67 references that are in the map. First posted on arXiv 25 Sep 2023.
Builds on
50 of 67 references.
References · 50
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,852
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2014Going Deeper with Convolutionscited by 4,241
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
38 more
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2021Channel-wise Topology Refinement Graph Convolution for Skeleton-Based Action Recognitioncited by 322
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
- 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 203
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2023Run, Don't Walk: Chasing Higher FLOPS for Faster Neural Networkscited by 130
- 2020Bayesian Bits: Unifying Quantization and Pruningcited by 94
- 2020ResRep: Lossless CNN Pruning via Decoupling Remembering and Forgettingcited by 85
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 78
- 2020Stable Low-rank Tensor Decomposition for Compression of Convolutional Neural Networkcited by 74
- 2019Pruning from Scratchcited by 72
- 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
- 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
- 2020HyperSeg: Patch-wise Hypernetwork for Real-time Semantic Segmentationcited by 66
- 2021Learning Student-Friendly Teacher Networks for Knowledge Distillationcited by 60
- 2020Differentiable Joint Pruning and Quantization for Hardware Efficiencycited by 46
- 2019Factorized Higher-Order CNNs with an Application to Spatio-Temporal Emotion Estimationcited by 40
- 2021When to Prune? A Policy towards Early Structural Pruningcited by 38
- 2021Towards Compact CNNs via Collaborative Compressioncited by 36
- 2020Robust Pruning at Initializationcited by 31
- 2021Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learningcited by 30
- 2021SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruningcited by 30
- 2021DECORE: Deep Compression with Reinforcement Learningcited by 29
- 2021Content-Aware GAN Compressioncited by 28
- 2021Fire Together Wire Together: A Dynamic Pruning Approach with Self-Supervised Mask Predictioncited by 24
- 2020A 3D GAN for Improved Large-pose Facial Recognitioncited by 19
- 2020Learning Efficient GANs for Image Translation via Differentiable Masks and co-Attention Distillationcited by 17
- 2022GhostNets on Heterogeneous Devices via Cheap Operationscited by 15
- 2021Prune Your Model Before Distill Itcited by 12
- 2021A Generalized Zero-Shot Quantization of Deep Convolutional Neural Networks via Learned Weights Statisticscited by 6
- 2022Fast Lossless Neural Compression with Integer-Only Discrete Flowscited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.