Pith. sign in

REVIEW 3 cited by

Soft Filter Pruning for Accelerating Deep Convolutional Neural Networks

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 1808.06866 v1 pith:AILSCWHW submitted 2018-08-21 cs.CV

Soft Filter Pruning for Accelerating Deep Convolutional Neural Networks

classification cs.CV
keywords modelpruningfiltercapacityfilterslargerpreviousadvanced
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper proposed a Soft Filter Pruning (SFP) method to accelerate the inference procedure of deep Convolutional Neural Networks (CNNs). Specifically, the proposed SFP enables the pruned filters to be updated when training the model after pruning. SFP has two advantages over previous works: (1) Larger model capacity. Updating previously pruned filters provides our approach with larger optimization space than fixing the filters to zero. Therefore, the network trained by our method has a larger model capacity to learn from the training data. (2) Less dependence on the pre-trained model. Large capacity enables SFP to train from scratch and prune the model simultaneously. In contrast, previous filter pruning methods should be conducted on the basis of the pre-trained model to guarantee their performance. Empirically, SFP from scratch outperforms the previous filter pruning methods. Moreover, our approach has been demonstrated effective for many advanced CNN architectures. Notably, on ILSCRC-2012, SFP reduces more than 42% FLOPs on ResNet-101 with even 0.2% top-5 accuracy improvement, which has advanced the state-of-the-art. Code is publicly available on GitHub: https://github.com/he-y/soft-filter-pruning

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. PrivDNN: A Secure Multi-Party Computation Framework for Deep Learning using Partial DNN Encryption

    cs.CR 2026-07 reject novelty 6.0

    PrivDNN selectively encrypts a small subset of DNN filters with FHE to speed up private model evaluation, but its privacy claim is undercut by the plaintext intermediate outputs the protocol hands back to the client.

  2. Resource-Aware Neural Network Pruning Using Graph-based Reinforcement Learning

    cs.LG 2025-09 conditional novelty 5.0

    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.

  3. Integrating Pruning with Quantization for Efficient Deep Neural Networks Compression

    cs.NE 2025-09 conditional novelty 4.0

    Simultaneous or sequential integration of geometric-median filter pruning with 4-bit additive-power-of-two quantization compresses ResNet and VGG models on CIFAR-10 by about 15x with modest accuracy loss.