Linear Computation Coding

01/31/2021
by   Ralf Müller, et al.
0

We introduce the new concept of computation coding. Similar to how rate-distortion theory is concerned with the lossy compression of data, computation coding deals with the lossy computation of functions. Particularizing to linear functions, we present an algorithm to reduce the computational cost of multiplying an arbitrary given matrix with an unknown column vector. The algorithm decomposes the given matrix into the product of codebook wiring matrices whose entries are either zero or signed integer powers of two. For a typical implementation of deep neural networks, the proposed algorithm reduces the number of required addition units several times. To achieve the accuracy of 16-bit signed integer arithmetic for 4k-vectors, no multipliers and only 1.5 adders per matrix entry are needed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2021

A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix

A Las Vegas randomized algorithm is given to compute the Smith multiplie...
research
02/10/2020

Efficient Matrix Multiplication: The Sparse Power-of-2 Factorization

We present an algorithm to reduce the computational effort for the multi...
research
01/13/2023

Linear Computation Coding: Exponential Search and Reduced-State Algorithms

Linear computation coding is concerned with the compression of multidime...
research
06/25/2021

Binary Matrix Factorisation and Completion via Integer Programming

Binary matrix factorisation is an essential tool for identifying discret...
research
08/14/2019

Accuracy Controlled Structure-Preserving H^2-Matrix-Matrix Product in Linear Complexity with Change of Cluster Bases

H^2-matrix constitutes a general mathematical framework for efficient c...
research
03/04/2021

Straggler Mitigation through Unequal Error Protection for Distributed Approximate Matrix Multiplication

Large-scale machine learning and data mining methods routinely distribut...
research
06/21/2018

Generic and Universal Parallel Matrix Summation with a Flexible Compression Goal for Xilinx FPGAs

Bit matrix compression is a highly relevant operation in computer arithm...

Please sign up or login with your details

Forgot password? Click here to reset