Papers › Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler

Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler

1 Jul 2023arXiv:2307.00198archive 2025-07-28

Shaohui Lin, Wenxuan Huang, Jiao Xie, Baochang Zhang, Yunhang Shen, Zhou Yu, Jungong Han, David Doermann

Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs, which can be effectively applied to edge devices and cloud services. In this paper, we propose a novel Knowledge-driven Differential Filter Sampler~(KDFS) with Masked Filter Modeling~(MFM) framework for filter pruning, which globally prunes the redundant filters based on the prior knowledge of a pre-trained model in a differential and non-alternative optimization. Specifically, we design a differential sampler with learnable sampling parameters to build a binary mask vector for each layer, determining whether the corresponding filters are redundant. To learn the mask, we introduce masked filter modeling to construct PCA-like knowledge by aligning the intermediate features from the pre-trained teacher model and the outputs of the student decoder taking sampling features as the input. The mask and sampler are directly optimized by the Gumbel-Softmax Straight-Through Gradient Estimator in an end-to-end manner in combination with global pruning constraint, MFM reconstruction error, and dark knowledge. Extensive experiments demonstrate the proposed KDFS's effectiveness in compressing the base models on various datasets. For instance, the pruned ResNet-50 on ImageNet achieves 55.36% computation reduction, and 42.86% parameter reduction, while only dropping 0.35% Top-1 accuracy, significantly outperforming the state-of-the-art methods. The code is available at \url{https://github.com/Osilly/KDFS}.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2307.00198")

Code

Syntology Ran 2 of 11 code samples harvested from 1 repository linked to this paper; 9 have no recorded run. Of those that ran: 2 ran · our draft was wrong.

By repository: official repository: 11 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

osilly/kdfs officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 2 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · our draft was wrong
9unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from osilly/kdfs. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

conv3x3 osilly/kdfs/model/pruned_model/resnet_pruned_cifar.py official repository ran · our draft was wrong MIT (permissive) · 583f9780bdd00a45 · report
conv_3x3_bn osilly/kdfs/model/pruned_model/MobileNetV2_pruned.py official repository ran · our draft was wrong MIT (permissive) · 408e747e0425a594 · report
DenseNet_40_pruned_cifar10 osilly/kdfs/model/pruned_model/DenseNet_pruned.py official repository unverified MIT (permissive) · 84f236df2836cfb9 · report
DenseNet_40_sparse_cifar10 osilly/kdfs/model/student/DenseNet_sparse.py official repository unverified MIT (permissive) · e8b3a3ed4ba961f5 · report
GoogLeNet_pruned_cifar10 osilly/kdfs/model/pruned_model/GoogLeNet_pruned.py official repository unverified MIT (permissive) · 7a4a5e3606d5a965 · report
ResNet_18_pruned_imagenet osilly/kdfs/model/pruned_model/ResNet_pruned.py official repository unverified MIT (permissive) · c1428f3d0526821b · report
ResNet_34_pruned_imagenet osilly/kdfs/model/pruned_model/ResNet_pruned.py official repository unverified MIT (permissive) · be1a0658f837c0ac · report
VGG_16_bn_pruned_cifar10 osilly/kdfs/model/pruned_model/vgg_bn_pruned.py official repository unverified MIT (permissive) · f104c2256fda2a71 · report
conv_1x1_bn_pruned osilly/kdfs/model/pruned_model/MobileNetV2_pruned.py official repository unverified MIT (permissive) · 6fbfaf2712087647 · report
get_preserved_filter_num osilly/kdfs/model/pruned_model/DenseNet_pruned.py official repository unverified MIT (permissive) · 50594ba3bb532d96 · report
resnet_56_pruned_cifar10 osilly/kdfs/model/pruned_model/resnet_pruned_cifar.py official repository unverified MIT (permissive) · 3d92a8e884f6a314 · report

Tasks

DecoderImage ClassificationNetwork Pruning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

BASEPruning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections