Entropy-Constrained Training of Deep Neural Networks
원문 초록
We propose a general framework for neural network compression that is motivated by the Minimum Description Length (MDL) principle. For that we first derive an expression for the entropy of a neural network, which measures its complexity explicitly in terms of its bit-size. Then, we formalize the problem of neural network compression as an entropy-constrained optimization objective. This objective generalizes many of the compression techniques proposed in the literature, in that pruning or reducing the cardinality of the weight elements of the network can be seen special cases of entropy-minimization techniques. Furthermore, we derive a continuous relaxation of the objective, which allows us to minimize it using gradient based optimization techniques. Finally, we show that we can reach state-of-the-art compression results on different network architectures and data sets, e.g. achieving x71 compression gains on a VGG-like architecture.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Certified Neural Approximations of Nonlinear Dynamics
Language Models as Zero-shot Lossless Gradient Compressors: Towards General Neural Parameter Prior Models
Torch2Chip: An End-to-end Customizable Deep Neural Network Compression and Deployment Toolkit for Prototype Hardware Accelerator Design
Towards Meta-Pruning via Optimal Transport
Causal-DFQ: Causality Guided Data-free Network Quantization
A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.