mlsanityData to 7 Oct 2026

Filter Sketch for Network Pruning

arXiv 2001.08514 ↗First posted 23 Jan 2020cs.CVcited by 20

Not on the map. Why?

Abstract (arXiv)

We propose a novel network pruning approach by information preserving of pre-trained network weights (filters). Network pruning with the information preserving is formulated as a matrix sketch problem, which is efficiently solved by the off-the-shelf Frequent Direction method. Our approach, referred to as FilterSketch, encodes the second-order information of pre-trained weights, which enables the representation capacity of pruned networks to be recovered with a simple fine-tuning procedure. FilterSketch requires neither training from scratch nor data-driven iterative optimization, leading to a several-orders-of-magnitude reduction of time cost in the optimization of pruning. Experiments on CIFAR-10 show that FilterSketch reduces 63.3% of FLOPs and prunes 59.9% of network parameters with negligible accuracy cost for ResNet-110. On ILSVRC-2012, it reduces 45.5% of FLOPs and removes 43.0% of parameters with only 0.69% accuracy drop for ResNet-50. Our code and pruned models can be found at https://github.com/lmbxmu/FilterSketch.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 7; 2022: 3; 2023: 5; 2024: 4; 2025: 1.

20 papers.

Sort:

  1. 2021Accelerating Sparse Deep Neural Networkscited by 213
  2. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  3. 2024Progressive Gradient Flow for Robust N:M Sparsity Training in Transformerscited by 17
  4. 2022Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filterscited by 16
  5. 2021Knowledge Distillation Using Hierarchical Self-Supervision Augmented Distributioncited by 13
  6. 2022Training Recipe for N:M Structured Sparsity with Decaying Pruning Maskcited by 10
  7. 2024Quantifying Task Priority for Multi-Task Optimizationcited by 10
  8. 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNNcited by 9
  9. 2021Training Compact CNNs for Image Classification using Dynamic-coded Filter Fusioncited by 5
  10. 2022Compact Model Training by Low-Rank Projection with Energy Transfercited by 3
  11. 2024DyCE: Dynamically Configurable Exiting for Deep Learning Compression and Real-time Scalingcited by 3
  12. 2021Efficient Visual Recognition with Deep Neural Networks: A Survey on Recent Advances and New Directionscited by 2
8 more
  1. 2023Filter Pruning based on Information Capacity and Independencecited by 2
  2. 2023Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Samplercited by 2
  3. 2021An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iterationcited by 1
  4. 2021Reconstructing Pruned Filters using Cheap Spatial Transformationscited by 0
  5. 2023A Multi-objective Complex Network Pruning Framework Based on Divide-and-conquer and Global Performance Impairment Rankingcited by 0
  6. 2023Beta-Rank: A Robust Convolutional Filter Pruning Method For Imbalanced Medical Image Analysiscited by 0
  7. 2024Reduced storage direct tensor ring decomposition for convolutional neural networks compressioncited by 0
  8. 2025Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networkscited by 0