Common Subexpression-Based Compression and Multiplication of Sparse Constant Matrices

In deep learning inference, model parameters are pruned and quantized to reduce the model size. Compression methods and common subexpression (CSE) elimination algorithms are applied on sparse constant matrices to deploy the models on low-cost embedded devices. However, the state-of-the-art CSE elimination methods do not scale well for handling large matrices. They reach hours for extracting CSEs in a
$200 \times 200$
matrix while their matrix multiplication algorithms execute longer than the conventional matrix multiplication methods. Besides, there exist no compression methods for matrices utilizing CSEs. As a remedy to this problem, a random search-based algorithm is proposed in this letter to extract CSEs in the column pairs of a constant matrix. It produces an adder tree for a
$1000 \times 1000$
matrix in a minute. To compress the adder tree, this letter presents a compression format by extending the compressed sparse row (CSR) to include CSEs. While compression rates of more than 50% can be achieved compared to the original CSR format, simulations for a single-core embedded system show that the matrix multiplication execution time can be reduced by 20%.