On CodeBERT, quantization best preserves effectiveness while cutting size, distillation best improves latency, and pruning only pays off in specific CPU configurations.
Dynamic Network Surgery for Efficient DNNs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Deep learning has become a ubiquitous technology to improve machine intelligence. However, most of the existing deep models are structurally very complex, making them difficult to be deployed on the mobile platforms with limited computational power. In this paper, we propose a novel network compression method called dynamic network surgery, which can remarkably reduce the network complexity by making on-the-fly connection pruning. Unlike the previous methods which accomplish this task in a greedy way, we properly incorporate connection splicing into the whole process to avoid incorrect pruning and make it as a continual network maintenance. The effectiveness of our method is proved with experiments. Without any accuracy loss, our method can efficiently compress the number of parameters in LeNet-5 and AlexNet by a factor of $\bm{108}\times$ and $\bm{17.7}\times$ respectively, proving that it outperforms the recent pruning method by considerable margins. Code and some models are available at https://github.com/yiwenguo/Dynamic-Network-Surgery.
citation-role summary
citation-polarity summary
fields
cs.SE 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On the Compression of Language Models for Code: An Empirical Study on CodeBERT
On CodeBERT, quantization best preserves effectiveness while cutting size, distillation best improves latency, and pruning only pays off in specific CPU configurations.