LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging
Not on the map. Why?
Abstract (arXiv)
Recent works show that reducing the number of layers in a convolutional neural network can enhance efficiency while maintaining the performance of the network. Existing depth compression methods remove redundant non-linear activation functions and merge the consecutive convolution layers into a single layer. However, these methods suffer from a critical drawback; the kernel size of the merged layers becomes larger, significantly undermining the latency reduction gained from reducing the depth of the network. We show that this problem can be addressed by jointly pruning convolution layers and activation functions. To this end, we propose LayerMerge, a novel depth compression method that selects which activation layers and convolution layers to remove, to achieve a desired inference speed-up while minimizing performance loss. Since the corresponding selection problem involves an exponential search space, we formulate a novel surrogate optimization problem and efficiently solve it via dynamic programming. Empirical results demonstrate that our method consistently outperforms existing depth compression and layer pruning methods on various network architectures, both on image classification and generation tasks. We release the code at https://github.com/snu-mllab/LayerMerge.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 37 of its 47 references that are in the map. First posted on arXiv 18 Jun 2024.
Builds on
37 of 47 references.
References · 37
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020Denoising Diffusion Implicit Modelscited by 9,655
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,736
- 2022A ConvNet for the 2020scited by 3,545
- 2018Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentationcited by 3,210
- 2015Fast R-CNNcited by 2,930
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
25 more
- 2018Group Normalizationcited by 1,514
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 666
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2021RepVGG: Making VGG-style ConvNets Great Againcited by 520
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2021ResNet strikes back: An improved training procedure in timmcited by 365
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
- 2023Structural Pruning for Diffusion Modelscited by 193
- 2020Characterising Bias in Compressed Modelscited by 162
- 2017PixelSNAIL: An Improved Autoregressive Generative Modelcited by 137
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2022Pruning has a disparate impact on model accuracycited by 43
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
- 2023Fast as CHITA: Neural Network Pruning with Combinatorial Optimizationcited by 40
- 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 34
- 2022FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classificationcited by 30
- 2020To Filter Prune, or to Layer Prune, That Is The Questioncited by 23
- 2020Knapsack Pruning with Inner Distillationcited by 20
- 2020Prune Responsiblycited by 20
- 2022DepthShrinker: A New Compression Paradigm Towards Boosting Real-Hardware Efficiency of Compact Neural Networkscited by 19
- 2021Layer Folding: Neural Network Depth Reduction using Activation Linearizationcited by 14
- 2023Balancing Act: Constraining Disparate Impact in Sparse Modelscited by 7
- 2023Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programmingcited by 1
Built on by
Citing papers per year: 2025: 4; 2026: 3.
7 papers.
- 2025Efficient Diffusion Models: A Surveycited by 35
- 2025HybridServe: Efficient Serving of Large AI Models with Confidence-Based Cascade Routingcited by 1
- 2025StatsMerging: Statistics-Guided Model Merging via Task-Specific Teacher Distillationcited by 1
- 2025Pruning Everything, Everywhere, All at Oncecited by 0
- 2026NanoFLUX: Distillation-Driven Compression of Large Text-to-Image Generation Models for Mobile Devicescited by 0
- 2026Efficient Text-to-Audio Generation via Pruningcited by 0
- 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategycited by 0
- 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategy4 Sep 2026
- 2026Efficient Text-to-Audio Generation via Pruning14 Jul 2026
- 2026NanoFLUX: Distillation-Driven Compression of Large Text-to-Image Generation Models for Mobile Devices6 Feb 2026
- 2025StatsMerging: Statistics-Guided Model Merging via Task-Specific Teacher Distillation5 Jun 2025
- 2025Pruning Everything, Everywhere, All at Once4 Jun 2025
- 2025HybridServe: Efficient Serving of Large AI Models with Confidence-Based Cascade Routing18 May 2025
- 2025Efficient Diffusion Models: A Survey3 Feb 2025