mlsanityData to 7 Oct 2026

Entropy-Constrained Training of Deep Neural Networks

arXiv 1812.07520 ↗First posted 18 Dec 2018cs.LG cs.NE stat.MLcited by 8

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

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 2; 2025: 2.

8 papers.