基于激活统计的剪枝法,高效压缩模型且保持性能
Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importance
- 用神经元激活分布识别低贡献权重,剪枝更精准
- 在多个数据集和模型上优于主流剪枝方法
- 适合资源受限设备部署,解释性强
近年来,神经网络规模不断扩展,显著提升了各类任务的表现。然而,大型模型在资源受限设备上的存储与计算开销巨大,部署困难。神经网络剪枝成为缓解这一问题的有效手段,可降低模型大小与复杂度。本文提出一种基于激活统计的直观、可解释的剪枝方法,其理论基础源于信息论与统计分析。通过构建权重贡献在数据集上的分布,并利用其参数指导剪枝过程,识别并移除对神经元输出贡献最小的权重。此外,我们设计了剪枝感知训练策略,引入额外正则项以增强剪枝效果。在多个数据集和网络架构上的大量实验表明,该方法持续优于多种基线及前沿剪枝技术。
原文摘要 · Abstract (English)
Recent advancements have scaled neural networks to unprecedented sizes, achieving remarkable performance across a wide range of tasks. However, deploying these large-scale models on resource-constrained devices poses significant challenges due to substantial storage and computational requirements. Neural network pruning has emerged as an effective technique to mitigate these limitations by reducing model size and complexity. In this paper, we introduce an intuitive and interpretable pruning method based on activation statistics, rooted in information theory and statistical analysis. Our approach leverages the statistical properties of neuron activations to identify and remove weights with minimal contributions to neuron outputs. Specifically, we build a distribution of weight contributions across the dataset and utilize its parameters to guide the pruning process. Furthermore, we propose a Pruning-aware Training strategy that incorporates an additional regularization term to enhance the effectiveness of our pruning method. Extensive experiments on multiple datasets and network architectures demonstrate that our method consistently outperforms several baseline and state-of-the-art pruning techniques.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。