mlsanityData to 7 Oct 2026

A Novel Structure-Agnostic Multi-Objective Approach for Weight-Sharing Compression in Deep Neural Networks

arXiv 2501.03095 ↗First posted 6 Jan 2025cs.CV cs.NEcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep neural networks suffer from storing millions and billions of weights in memory post-training, making challenging memory-intensive models to deploy on embedded devices. The weight-sharing technique is one of the popular compression approaches that use fewer weight values and share across specific connections in the network. In this paper, we propose a multi-objective evolutionary algorithm (MOEA) based compression framework independent of neural network architecture, dimension, task, and dataset. We use uniformly sized bins to quantize network weights into a single codebook (lookup table) for efficient weight representation. Using MOEA, we search for Pareto optimal k bins by optimizing two objectives. Then, we apply the iterative merge technique to non-dominated Pareto frontier solutions by combining neighboring bins without degrading performance to decrease the number of bins and increase the compression ratio. Our approach is model- and layer-independent, meaning the weights are mixed in the clusters from any layer, and the uniform quantization method used in this work has O(N) complexity instead of non-uniform quantization methods such as k-means with O(Nkt) complexity. In addition, we use the center of clusters as the shared weight values instead of retraining shared weights, which is computationally expensive. The advantage of using evolutionary multi-objective optimization is that it can obtain non-dominated Pareto frontier solutions with respect to performance and shared weights. The experimental results show that we can reduce the neural network memory by 13.72 ~14.98 × on CIFAR-10, 11.61 ~ 12.99× on CIFAR-100, and 7.44 ~ 8.58× on ImageNet showcasing the effectiveness of the proposed deep neural network compression framework.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 48 references that are in the map. First posted on arXiv 6 Jan 2025.

Builds on

21 of 48 references.

References · 21

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  5. 2018HAQ: Hardware-Aware Automated Quantization with Mixed Precisioncited by 426
  6. 2016The CMA Evolution Strategy: A Tutorialcited by 364
  7. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  8. 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 212
  9. 2020pymoo: Multi-objective Optimization in Pythoncited by 196
  10. 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 189
  11. 2024Arcee's MergeKit: A Toolkit for Merging Large Language Modelscited by 189
  12. 2017Soft Weight-Sharing for Neural Network Compressioncited by 99
9 more
  1. 2019And the Bit Goes Down: Revisiting the Quantization of Neural Networkscited by 78
  2. 2022A Comprehensive Survey on Model Quantization for Deep Neural Networks in Image Classificationcited by 64
  3. 2016Towards the Limit of Network Quantizationcited by 49
  4. 2018Deep k-Means: Re-Training and Parameter Sharing with Harder Cluster Assignments for Compressing Deep Convolutionscited by 33
  5. 2020Permute, Quantize, and Fine-tune: Efficient Compression of Neural Networkscited by 28
  6. 2018Universal Deep Neural Network Compressioncited by 17
  7. 2020DP-Net: Dynamic Programming Guided Deep Neural Network Compressioncited by 1
  8. 2021A New Clustering-Based Technique for the Acceleration of Deep Convolutional Networkscited by 1
  9. 2024Massive Dimensions Reduction and Hybridization with Meta-heuristics in Deep Learningcited by 1

Built on by

Not cited yet.