用新方法提升剪枝重要性评分,让模型更轻更快且精度不降。
Advancing Weight and Channel Sparsification with Enhanced Saliency
- 将模型分为执行与探索两部分,用同一标准动态重评参数
- 在ImageNet上,ResNet50在90%稀疏下准确率提升1.3个百分点
- 训练成本降低70%以上,适合追求高效部署的工程师
剪枝通过移除冗余参数来加速和压缩模型,但其重要性评分通常不完善,且删除不可逆,常导致性能下降。动态稀疏训练虽试图在训练中调整稀疏结构,却存在剪枝与生长准则不一致、不适用于结构化稀疏、策略短视等问题。本文提出一种高效创新范式,可增强任意给定的重要性评分,适用于无结构或结构化稀疏。方法将模型分为活跃结构(用于执行)与探索空间(用于潜在更新)。在执行阶段优化活跃结构,在探索阶段通过剪枝与生长步骤,基于同一重要性评分重新评估并整合探索空间中的参数。为准备探索,短暂“激活”所有探索参数并仅训练数轮,同时冻结活跃部分,以预估重新引入的收益。实验表明,即使使用简单的幅度评分,结合本方法也能达到顶尖性能并显著降低训练成本。在ImageNet上,基于ResNet50的模型在90% ERK稀疏度下,Top-1准确率相比先前最优方法提升1.3个百分点。相比当前最先进延迟剪枝方法HALP,训练成本减少超70%,同时获得更快更准的剪枝模型。
原文摘要 · Abstract (English)
Pruning aims to accelerate and compress models by removing redundant parameters, identified by specifically designed importance scores which are usually imperfect. This removal is irreversible, often leading to subpar performance in pruned models. Dynamic sparse training, while attempting to adjust sparse structures during training for continual reassessment and refinement, has several limitations including criterion inconsistency between pruning and growth, unsuitability for structured sparsity, and short-sighted growth strategies. Our paper introduces an efficient, innovative paradigm to enhance a given importance criterion for either unstructured or structured sparsity. Our method separates the model into an active structure for exploitation and an exploration space for potential updates. During exploitation, we optimize the active structure, whereas in exploration, we reevaluate and reintegrate parameters from the exploration space through a pruning and growing step consistently guided by the same given importance criterion. To prepare for exploration, we briefly "reactivate" all parameters in the exploration space and train them for a few iterations while keeping the active part frozen, offering a preview of the potential performance gains from reintegrating these parameters. We show on various datasets and configurations that existing importance criterion even simple as magnitude can be enhanced with ours to achieve state-of-the-art performance and training cost reductions. Notably, on ImageNet with ResNet50, ours achieves an +1.3 increase in Top-1 accuracy over prior art at 90% ERK sparsity. Compared with the SOTA latency pruning method HALP, we reduced its training cost by over 70% while attaining a faster and more accurate pruned model.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。