Entropy-Constrained Training of Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 2; 2025: 2.
8 papers.
- 2021ECQx: Explainability-Driven Quantization for Low-Bit and Sparse DNNscited by 15
- 2024Progress Measures for Grokking on Real-world Taskscited by 7
- 2023Efficient and Effective Methods for Mixed Precision Neural Network Quantization for Faster, Energy-efficient Inferencecited by 3
- 2025Binarized Neural Networks Converge Toward Algorithmic Simplicity: Empirical Support for the Learning-as-Compression Hypothesiscited by 3
- 2025Coded Deep Learning: Framework and Algorithmcited by 1
- 2022Training Lightweight Graph Convolutional Networks with Phase-field Modelscited by 0
- 2023One-Shot Multi-Rate Pruning of Graph Convolutional Networkscited by 0
- 2024Designing Semi-Structured Pruning of Graph Convolutional Networks for Skeleton-based Recognitioncited by 0
- 2025Binarized Neural Networks Converge Toward Algorithmic Simplicity: Empirical Support for the Learning-as-Compression Hypothesis27 May 2025
- 2025Coded Deep Learning: Framework and Algorithm16 Jan 2025
- 2024Designing Semi-Structured Pruning of Graph Convolutional Networks for Skeleton-based Recognition16 Dec 2024
- 2024Progress Measures for Grokking on Real-world Tasks21 May 2024
- 2023One-Shot Multi-Rate Pruning of Graph Convolutional Networks29 Dec 2023
- 2023Efficient and Effective Methods for Mixed Precision Neural Network Quantization for Faster, Energy-efficient Inference30 Jan 2023
- 2022Training Lightweight Graph Convolutional Networks with Phase-field Models19 Dec 2022
- 2021ECQx: Explainability-Driven Quantization for Low-Bit and Sparse DNNs9 Sep 2021