← 返回信息流

arXiv cs.LG论文

DADP:动态活动依赖剪枝,一种受反向赫布启发式结构剪枝方法

arxiv.org作者:Bhushan Deshpande论文AI评分:70/100

针对现代神经网络参数冗余导致的计算与内存开销问题,现有剪枝方法多依赖事后幅度阈值或静态初始化启发式规则,常需手动设定稀疏度或昂贵重训。本文提出动态活动依赖剪枝(DADP),这是一种受生物启发的结构可塑性机制,旨在通过动态调整实现更高效的模型压缩。

这篇是正式发表的长论文,站内提供中文解读,全文请到原文阅读 PDF。

Abstract:Modern neural networks are heavily over-parameterized. This redundancy incurs substantial compute and memory overhead during training and inference. Existing pruning methods rely on post-hoc magnitude thresholds or static initialization heuristics. Consequently, they often require manual per-layer sparsity targets or expensive retraining cycles. We propose Dynamic Activity-Dependent Pruning (DADP), a biologically inspired structural plasticity mechanism. During training, DADP measures connection importance via the accumulated product of pre-synaptic activations and post-synaptic error gradients. Using a single global threshold instead of fixed layer budgets, DADP dynamically allocates sparsity across network depth while naturally inducing neuron- and channel-level pruning. Across MLP, VGG-16, ResNet-18, BiLSTM-CRF, and MiniBERT architectures, DADP matches or outperforms Magnitude, SNIP and RigL, retaining 73.67% accuracy (dense baseline: 76.06%) at 99% sparsity on ResNet-18. Finally, matrix-based Shannon entropy and effective rank measurements confirm that DADP preserves latent feature diversity at extreme sparsities without representation collapse.

阅读原文