A Directed-Evolution Method for Sparsification and Compression of Neural Networks with Application to Object Identification and Segmentation and considerations of optimal quantization using small number of bits
Not on the map. Why?
Abstract (arXiv)
This work introduces Directed-Evolution (DE) method for sparsification of neural networks, where the relevance of parameters to the network accuracy is directly assessed and the parameters that produce the least effect on accuracy when tentatively zeroed are indeed zeroed. DE method avoids a potentially combinatorial explosion of all possible candidate sets of parameters to be zeroed in large networks by mimicking evolution in the natural world. DE uses a distillation context [5]. In this context, the original network is the teacher and DE evolves the student neural network to the sparsification goal while maintaining minimal divergence between teacher and student. After the desired sparsification level is reached in each layer of the network by DE, a variety of quantization alternatives are used on the surviving parameters to find the lowest number of bits for their representation with acceptable loss of accuracy. A procedure to find optimal distribution of quantization levels in each sparsified layer is presented. Suitable final lossless encoding of the surviving quantized parameters is used for the final parameter representation. DE was used in sample of representative neural networks using MNIST, FashionMNIST and COCO data sets with progressive larger networks. An 80 classes YOLOv3 with more than 60 million parameters network trained on COCO dataset reached 90% sparsification and correctly identifies and segments all objects identified by the original network with more than 80% confidence using 4bit parameter quantization. Compression between 40x and 80x. It has not escaped the authors that techniques from different methods can be nested. Once the best parameter set for sparsification is identified in a cycle of DE, a decision on zeroing only a sub-set of those parameters can be made using a combination of criteria like parameter magnitude and Hessian approximations.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 11 references that are in the map. First posted on arXiv 12 Jun 2022.
Builds on
6 of 11 references.
References · 6
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2020What is the State of Neural Network Pruning?cited by 583
- 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Effective Interplay between Sparsity and Quantization: From Theory to Practice
- 2021A Survey of Quantization Methods for Efficient Neural Network Inference
- 2021Pruning and Quantization for Deep Neural Network Acceleration: A Survey
- 2023Jumping through Local Minima: Quantization in the Loss Landscape of Vision Transformers
- 2022Post-training Quantization for Neural Networks with Provable Guarantees
- 2021Neural Network Quantization for Efficient Inference: A Survey
- 2021Pareto-Optimal Quantized ResNet Is Mostly 4-bit
- 2021BRECQ: Pushing the Limit of Post-Training Quantization by Block Reconstruction