Pith. sign in

REVIEW

Entropy-Constrained Training of Deep Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.07520 v2 pith:BBNGVDSP submitted 2018-12-18 cs.LG cs.NEstat.ML

classification cs.LGcs.NEstat.ML
keywords compressionnetworkneuralobjectivetechniquesderiveentropy-constrainedoptimization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools