Pith. sign in

REVIEW 2 cited by

Layer Folding: Neural Network Depth Reduction using Activation Linearization

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 2106.09309 v2 pith:N3FIEPM3 submitted 2021-06-17 cs.CV

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

Despite the increasing prevalence of deep neural networks, their applicability in resource-constrained devices is limited due to their computational load. While modern devices exhibit a high level of parallelism, real-time latency is still highly dependent on networks' depth. Although recent works show that below a certain depth, the width of shallower networks must grow exponentially, we presume that neural networks typically exceed this minimal depth to accelerate convergence and incrementally increase accuracy. This motivates us to transform pre-trained deep networks that already exploit such advantages into shallower forms. We propose a method that learns whether non-linear activations can be removed, allowing to fold consecutive linear layers into one. We apply our method to networks pre-trained on CIFAR-10 and CIFAR-100 and find that they can all be transformed into shallower forms that share a similar depth. Finally, we use our method to provide more efficient alternatives to MobileNetV2 and EfficientNet-Lite architectures on the ImageNet classification task.

Discussion (0). Continue with ORCID 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. Advanced deep architecture pruning using single filter performance

    cs.LG 2025-01 reject novelty 5.0 of 10

    AFCC pruning keeps only filter-to-filter connections whose filters share cluster labels and reports preserved accuracy on CIFAR-100, but its masks are computed on the test set.

Pith tools