A Multi-Decomposition Method for Compressing Larger AI Models Based on Reinforcement Learning

Authors: Jian Tang, Kun Xie, Jigang Wen, Xiaocan Li, Jiazheng Tian, Gaogang Xie, Kenli Li
Primary area: other topics in machine learning (i.e., none of the above)
Keywords: deep neural network, low rank decomposition, multiple decomposition methods, reinforcement learning.

Abstract:
With the development of modern deep neural network (DNN), the scale of parameters is increasing, making it difficult to deploy models for use on resource-constrained edge devices. To address this issue, model compression is necessary, and using low-rank matrix decomposition to compress DNN models is an effective research approach. However, traditional studies on low-rank decomposition compression typically apply a single matrix decomposition method to each parameter matrix in the neural network, without considering the structural characteristics of each layer in AI models, thus failing to achieve the optimal compression effect. Therefore, this paper proposes, for the first time, a scheme for model compression using multiple decomposition methods, selecting the most suitable decomposition method for each layer in the model. However, to truly implement this approach, it is essential to balance model accuracy and compression cost. To address this, we propose a joint optimization paradigm that simultaneously optimizes model accuracy and compression rate. We also introduce a framework LMFBRL based on reinforcement learning that jointly selects the optimal decomposition method and rank. Tests were conducted on five models such as LeNet-300, ResNet-20, and Vgg-16. Compared to singly using the MF method for compressing the LeNet300 model, our approach has shown an improvement of 3.6% in compression rate and a 1.8% increase in accuracy. The test results validate the effectiveness of the algorithm proposed in this paper.

Decision: desk rejected
Reviewer scores: 0

Reviews and discussion:

Metareview: