arrow
返回

Convolution Filter Compression via Sparse Linear Combinations of Quantized Basis

delete2024-01-01
delete0
delete
OA
AI
W
Weichao Lan
Y
Yiu‐ming Cheung *
L
Liang Lan
J
Juyong Jiang
Z
Zhikai Hu
DOI:10.1109/TNNLS.2024.3457943delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Convolutional neural networks (CNNs) have achieved significant performance on various real-life tasks. However, the large number of parameters in convolutional layers requires huge storage and computation resources, making it challenging to deploy CNNs on memory-constrained embedded devices. In this article, we propose a novel compression method that generates the convolution filters in each layer using a set of learnable low-dimensional quantized filter bases. The proposed method reconstructs the convolution filters by stacking the linear combinations of these filter bases. By using quantized values in weights, the compact filters can be represented using fewer bits so that the network can be highly compressed. Furthermore, we explore the sparsity of coefficients through $L_1$ -ball projection when conducting linear combination to further reduce the storage consumption and prevent overfitting. We also provide a detailed analysis of the compression performance of the proposed method. Evaluations of image classification and object detection tasks using various network structures demonstrate that the proposed method achieves a higher compression ratio with comparable accuracy compared with the existing state-of-the-art filter decomposition and network quantization methods.
Keyword:
Convolution
Quantization (signal)
Nonlinear filters
Maximum likelihood detection
Kernel
Filtering algorithms
Tensors
Filter decomposition
network compression
quantization

期刊

IEEE Transactions on Neural Networks and Learning Systems 封面图
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
论文数:
7.6K
被引数:
7.2W

机构

H
Hong Kong Baptist University
学者数:
6.3K
论文数: 7.5K
被引数: 1.3W
H
Hong Kong University of Science and Technology (Guangzhou)
学者数:
1.0K
论文数: 866
被引数: 1
引用论文

引用论文

暂无论文信息