Structured Multi-Hashing for Model Compression
Elad Eban, Yair Movshovitz-Attias, Hao Wu, Mark Sandler, Andrew Poon, Yerlan Idelbayev, Miguel Á. Carreira-Perpiñán
Abstract
Despite the success of deep neural networks (DNNs), state-of-the-art models are too large to deploy on lowresource devices or common server configurations in which multiple models are held in memory. Model compression methods address this limitation by reducing the memory footprint, latency, or energy consumption of a model with minimal impact on accuracy. We focus on the task of reducing the number of learnable variables in the model. In this work we combine ideas from weight hashing and dimensionality reductions resulting in a simple and powerful structured multi-hashing method based on matrix products that allows direct control of model size of any deep network and is trained end-to-end. We demonstrate the strength of our approach by compressing models from the ResNet, EfficientNet, and Mo-bileNet architecture families. Our method allows us to drastically decrease the number of variables while maintaining high accuracy. For instance, by applying our approach to EfficentNet-B4 (16M parameters) we reduce it to to the size of B0 (5M parameters), while gaining over 3% in accuracy over B0 baseline. On the commonly used benchmark CIFAR10 we reduce the ResNet32 model by 75% with no loss in quality, and are able to do a 10x compression while still achieving above 90% accuracy. * The author contribute equally to this paper. Elad and Yair contributed equally to the paper. They jointly proposed the idea of structured-multi-hashing. Yair was the main contributor to the manuscript. Elad wrote most of the code and ran EfficentNet experiments. Hao contributed to coding and experiments. Yerlan ran CIFAR and ResNet experiments and simplified some aspects of the structured hashing. Miguel advised Yerlan on issues about optimization and deep net compression. Mark, and Andrew helped with MobileNet, and ResNet experiments. † Worked performed while at Google Research.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers7
- GDP: Stabilized Neural Network Pruning via Gates with Differentiable PolarizationYi Guo, Huan Yuan, Jianchao Tan, Zhangyang Wang et al.ICCV 2021 · 52 citations
- T-Basis: a Compact Representation for Neural NetworksAnton Obukhov, Maxim V. Rakhuba, Stamatios Georgoulis, Menelaos Kanakis et al.ICML 2020 · 32 citations
- BiPer: Binary Neural Networks Using a Periodic FunctionEdwin Vargas, Claudia V. Correa P., Carlos Hinojosa, Henry ArguelloCVPR 2024 · 10 citations
- Network Memory Footprint Compression Through Jointly Learnable Codebooks and MappingsEdouard Yvinec, Arnaud Dapogny, Kevin BaillyICLR 2024 · 2 citations
- Massively Scaling Heteroscedastic ClassifiersMark Collier, Rodolphe Jenatton, Basil Mustafa, Neil Houlsby et al.ICLR 2023 · 1 citation
Builds on1
Related papers
- Asymmetric Deep Hashing for Efficient Hash Code CompressionShu Zhao, Dayan Wu, Wanqian Zhang, Yu Zhou et al.ACM MM 2020 · 18 citations
- Hardware-Aware Compression with Random Operation Access Specific Tile (ROAST) HashingAditya Desai, Keren Zhou, Anshumali ShrivastavaICML 2023 · 5 citations
- And the Bit Goes Down: Revisiting the Quantization of Neural NetworksPierre Stock, Armand Joulin, Rémi Gribonval, Benjamin Graham et al.ICLR 2020 · 157 citations
- Binary Neural Network Hashing for Image RetrievalWanqian Zhang, Dayan Wu, Yu Zhou, Bo Li et al.SIGIR 2021 · 19 citations
- Neural Epitome Search for Architecture-Agnostic Network CompressionDaquan Zhou, Xiaojie Jin, Qibin Hou, Kaixin Wang et al.ICLR 2020 · 13 citations
