mlsanityData to 14 Oct 2026

LinDeps: A Fine-tuning Free Post-Pruning Method to Remove Layer-Wise Linear Dependencies with Guaranteed Performance Preservation

arXiv 2507.21573 ↗First posted 29 Jul 2025cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Convolutional Neural Networks (CNN) are widely used in many computer vision tasks. Yet, their increasing size and complexity pose significant challenges for efficient deployment on resource-constrained platforms. Hence, network pruning has emerged as an effective way of reducing the size and computational requirements of neural networks by removing redundant or unimportant parameters. However, a fundamental challenge with pruning consists in optimally removing redundancies without degrading performance. Most existing pruning techniques overlook structural dependencies across feature maps within a layer, resulting in suboptimal pruning decisions. In this work, we introduce LinDeps, a novel post-pruning method, i.e., a pruning method that can be applied on top of any pruning technique, which systematically identifies and removes redundant filters via linear dependency analysis. Particularly, LinDeps applies pivoted QR decomposition to feature maps to detect and prune linearly dependent filters. Then, a novel signal recovery mechanism adjusts the next layer's kernels to preserve compatibility and performance without requiring any fine-tuning. Our experiments on CIFAR-10 and ImageNet with VGG and ResNet backbones demonstrate that LinDeps improves compression rates of existing pruning techniques while preserving performances, leading to a new state of the art in CNN pruning. We also benchmark LinDeps in low-resource setups where no retraining can be performed, which shows significant pruning improvements and inference speedups over a state-of-the-art method. LinDeps therefore constitutes an essential add-on for any current or future pruning technique.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 44 references that are in the map. First posted on arXiv 29 Jul 2025.

Builds on

31 of 44 references.

References · 31

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  6. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  7. 2015Deep Learning and the Information Bottleneck Principlecited by 802
  8. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  9. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
  10. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  11. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  12. 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 263
19 more
  1. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  2. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 221
  3. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  4. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  5. 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 78
  6. 2024A Survey on Transformer Compressioncited by 46
  7. 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
  8. 2021DECORE: Deep Compression with Reinforcement Learningcited by 29
  9. 2023HALOC: Hardware-Aware Automatic Low-Rank Compression for Compact Neural Networkscited by 20
  10. 2020Single Shot Structured Pruning Before Trainingcited by 19
  11. 2024Accelerating Transformer Pre-training with 2:4 Sparsitycited by 19
  12. 2021Network Pruning using Adaptive Exemplar Filterscited by 16
  13. 2024Jointly Training and Pruning CNNs via Learnable Agent Guidance and Alignmentcited by 9
  14. 2021Toward Compact Deep Neural Networks via Energy-Aware Pruningcited by 6
  15. 2021EZCrop: Energy-Zoned Channels for Robust Output Pruningcited by 6
  16. 2021Automatic Neural Network Pruning that Efficiently Preserves the Model Accuracycited by 4
  17. 2022Network Pruning via Feature Shift Minimizationcited by 4
  18. 2024Foundations of the Theory of Performance-Based Rankingcited by 3
  19. 2023A Differentiable Framework for End-to-End Learning of Hybrid Structured Compressioncited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2022Boosting Pruned Networks with Linear Over-parameterization
  2. 2024RL-Pruner: Structured Pruning Using Reinforcement Learning for CNN Compression and Acceleration
  3. 2025FAIR-Pruner: A Flexible Framework for Automatic Layer-Wise Pruning via Tolerance of Difference
  4. 2021Dynamic Probabilistic Pruning: A general framework for hardware-constrained pruning at different granularities
  5. 2025GoPrune: Accelerated Structured Pruning with ℓ2,p-Norm Optimization
  6. 2024Comb, Prune, Distill: Towards Unified Pruning for Vision Model Compression
  7. 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models
  8. 2025Teacher-Guided One-Shot Pruning via Context-Aware Knowledge Distillation