Pith. sign in

REVIEW 3 cited by

An Entropy-based Pruning Method for CNN Compression

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 1706.05791 v1 pith:EFSSACCP submitted 2017-06-19 cs.CV

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

This paper aims to simultaneously accelerate and compress off-the-shelf CNN models via filter pruning strategy. The importance of each filter is evaluated by the proposed entropy-based method first. Then several unimportant filters are discarded to get a smaller CNN model. Finally, fine-tuning is adopted to recover its generalization ability which is damaged during filter pruning. Our method can reduce the size of intermediate activations, which would dominate most memory footprint during model training stage but is less concerned in previous compression methods. Experiments on the ILSVRC-12 benchmark demonstrate the effectiveness of our method. Compared with previous filter importance evaluation criteria, our entropy-based method obtains better performance. We achieve 3.3x speed-up and 16.64x compression on VGG-16, 1.54x acceleration and 1.47x compression on ResNet-50, both with about 1% top-5 accuracy decrease.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Temporal Aware Pruning for Efficient Diffusion-based Video Generation

    cs.CV 2026-05 unverdicted novelty 6.0 of 10

    TAPE introduces temporal-aware token pruning for diffusion-based video generation, using frame smoothing, layer reselection, and timestep budgets to achieve speedups while maintaining visual fidelity and coherence.

  2. FlashSVD: Memory-Efficient Inference with Streaming for Low-Rank Models

    cs.LG 2025-08 conditional novelty 6.0 of 10

    FlashSVD fuses low-rank SVD projections into attention and feed-forward GPU kernels so SVD-compressed transformers avoid materializing dense activations, cutting activation memory at a latency cost.

  3. Lightweight Design and Optimization methods for DCNNs: Progress and Futures

    cs.CV 2024-12 unverdicted

    A review of lightweight DCNN design and compression methods with no new technical contributions.

Pith tools