DeepAI AI Chat
Log In Sign Up

Linear Computation Coding: Exponential Search and Reduced-State Algorithms

by   Hans Rosenberger, et al.

Linear computation coding is concerned with the compression of multidimensional linear functions, i.e. with reducing the computational effort of multiplying an arbitrary vector to an arbitrary, but known, constant matrix. This paper advances over the state-of-the art, that is based on a discrete matching pursuit (DMP) algorithm, by a step-wise optimal search. Offering significant performance gains over DMP, it is however computationally infeasible for large matrices and high accuracy. Therefore, a reduced-state algorithm is introduced that offers performance superior to DMP, while still being computationally feasible even for large matrices. Depending on the matrix size, the performance gain over DMP is on the order of at least 10


page 1

page 2

page 3

page 4


Linear Computation Coding

We introduce the new concept of computation coding. Similar to how rate-...

Common Subexpression-based Compression and Multiplication of Sparse Constant Matrices

In deep learning inference, model parameters are pruned and quantized to...

On the computational equivalence of co-NP refutations of a matrix being a P-matrix

A P-matrix is a square matrix X such that all principal submatrices of X...

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

This paper describes an algorithm which computes the characteristic poly...