Pith. sign in

REVIEW 3 cited by

Learning Efficient Convolutional Networks through Network Slimming

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 1708.06519 v1 pith:DWGZEHYT submitted 2017-08-22 cs.CV cs.AIcs.LG

classification cs.CVcs.AIcs.LG
keywords modelsnetworknetworksslimmingaccuracyapproachcnnscomputing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high computational cost. In this paper, we propose a novel learning scheme for CNNs to simultaneously 1) reduce the model size; 2) decrease the run-time memory footprint; and 3) lower the number of computing operations, without compromising accuracy. This is achieved by enforcing channel-level sparsity in the network in a simple but effective way. Different from many existing approaches, the proposed method directly applies to modern CNN architectures, introduces minimum overhead to the training process, and requires no special software/hardware accelerators for the resulting models. We call our approach network slimming, which takes wide and large networks as input models, but during training insignificant channels are automatically identified and pruned afterwards, yielding thin and compact models with comparable accuracy. We empirically demonstrate the effectiveness of our approach with several state-of-the-art CNN models, including VGGNet, ResNet and DenseNet, on various image classification datasets. For VGGNet, a multi-pass version of network slimming gives a 20x reduction in model size and a 5x reduction in computing operations.

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. Resource-Aware Neural Network Pruning Using Graph-based Reinforcement Learning

    cs.LG 2025-09 conditional novelty 5.0 of 10

    A graph-attention RL agent with a binary channel-level action space and a self-competition reward prunes CNNs at fixed FLOPs budgets, giving competitive but not uniformly state-of-the-art accuracy.

  2. Efficient Object Detection of Marine Debris using Pruned YOLO Model

    cs.CV 2025-01 conditional novelty 3.0 of 10

    Channel-pruned YOLOv4 raises detection speed on Trash-ICRA 19 from 15.19 to 19.4 FPS while keeping mAP near 96%, which the authors propose as an efficient model for marine debris detection on low-power hardware.

  3. On Accelerating Edge AI: Optimizing Resource-Constrained Environments

    cs.LG 2025-01 conditional novelty 2.0 of 10

    The paper argues that model compression, neural architecture search, and compiler optimizations work together to accelerate edge AI, but it provides no new experimental evidence.

Pith tools