Permute, Quantize, and Fine-tune: Efficient Compression of Neural Networks
This work addresses the challenge of efficient neural network compression for practical deployment, representing an incremental improvement over existing vector quantization techniques.
The paper tackles the problem of compressing neural networks for deployment on resource-constrained platforms by introducing a method that permutes weights across layers to improve compressibility, achieving a 40-70% reduction in the accuracy gap compared to uncompressed models over state-of-the-art methods in tasks like image classification, object detection, and segmentation.
Compressing large neural networks is an important step for their deployment in resource-constrained computational platforms. In this context, vector quantization is an appealing framework that expresses multiple parameters using a single code, and has recently achieved state-of-the-art network compression on a range of core vision and natural language processing tasks. Key to the success of vector quantization is deciding which parameter groups should be compressed together. Previous work has relied on heuristics that group the spatial dimension of individual convolutional filters, but a general solution remains unaddressed. This is desirable for pointwise convolutions (which dominate modern architectures), linear layers (which have no notion of spatial dimension), and convolutions (when more than one filter is compressed to the same codeword). In this paper we make the observation that the weights of two adjacent layers can be permuted while expressing the same function. We then establish a connection to rate-distortion theory and search for permutations that result in networks that are easier to compress. Finally, we rely on an annealed quantization algorithm to better compress the network and achieve higher final accuracy. We show results on image classification, object detection, and segmentation, reducing the gap with the uncompressed model by 40 to 70% with respect to the current state of the art.