arXiv:2510.18636cs.CVcs.AI2025-10

通过可解释性指导剪枝,实现无需微调的高效模型压缩。

C-SWAP: Explainability-Aware Structured Pruning for Efficient Neural Networks Compression

  • 基于因果关系逐步剪除结构,提升剪枝效率
  • 在不微调情况下压缩模型,精度损失极小
  • 适合部署资源受限场景的视觉模型优化

神经网络压缩近年来在计算机视觉应用中备受关注,尤其在克服部署限制方面需求迫切。剪枝是常用技术,通过引入结构稀疏性(如权重、神经元、层)减少模型规模和推理开销。结构化剪枝尤为重要,因其可移除整个模块,进一步加速推理并降低内存占用。然而,传统方法通常需迭代重训练,计算成本高。近期研究采用一次性剪枝,在后训练阶段直接应用,但常导致性能显著下降。本文提出一种新型一次性剪枝框架,结合可解释深度学习。首先引入因果感知剪枝方法,利用预测与结构间的因果关系,在渐进式剪枝过程中识别可移除部分,确保不影响模型性能。在卷积神经网络和视觉变换器基线模型上进行实验,预训练于分类任务,结果表明本方法在无需微调的情况下持续实现显著模型压缩,且性能影响极小。整体表现优于现有方法,达成最优平衡。代码已开源。

原文摘要 · Abstract (English)

Neural network compression has gained increasing attention in recent years, particularly in computer vision applications, where the need for model reduction is crucial for overcoming deployment constraints. Pruning is a widely used technique that prompts sparsity in model structures, e.g. weights, neurons, and layers, reducing size and inference costs. Structured pruning is especially important as it allows for the removal of entire structures, which further accelerates inference time and reduces memory overhead. However, it can be computationally expensive, requiring iterative retraining and optimization. To overcome this problem, recent methods considered one-shot setting, which applies pruning directly at post-training. Unfortunately, they often lead to a considerable drop in performance. In this paper, we focus on this issue by proposing a novel one-shot pruning framework that relies on explainable deep learning. First, we introduce a causal-aware pruning approach that leverages cause-effect relations between model predictions and structures in a progressive pruning process. It allows us to efficiently reduce the size of the network, ensuring that the removed structures do not deter the performance of the model. Then, through experiments conducted on convolution neural network and vision transformer baselines, pre-trained on classification tasks, we demonstrate that our method consistently achieves substantial reductions in model size, with minimal impact on performance, and without the need for fine-tuning. Overall, our approach outperforms its counterparts, offering the best trade-off. Our code is available on GitHub.

模型压缩结构化剪枝可解释性推理加速

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。