Pith. sign in

REVIEW 2 cited by

LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.12837 v3 pith:2NVY4P27 submitted 2024-06-18 cs.LG cs.CV

classification cs.LGcs.CV
keywords layersdepthnetworkcompressionactivationconvolutionlayerlayermerge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Rethinking Depth Pruning for Vision Transformers: A Heterogeneity-Aware Perspective

    cs.CV 2026-07 conditional novelty 6.0 of 10

    Heterogeneity-aware depth pruning of attention and activation layers, guided by a polynomial model-accuracy predictor, delivers up to 1.58× speedup on DeiT-B and 5.19× when combined with width pruning.

  2. StatsMerging: Statistics-Guided Model Merging via Task-Specific Teacher Distillation

    cs.LG 2025-06 conditional novelty 5.0 of 10

    StatsMerging predicts per-layer merging coefficients from weight statistics and teacher pseudo-labels, achieving 94.5% average accuracy across eight vision tasks, 5.1 points above WEMoE.

Pith tools