Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication

07/12/2019
by   Adarsh M. Subramaniam, et al.
0

We propose a class of codes called random Khatri-Rao-Product (RKRP) codes for distributed matrix multiplication in the presence of stragglers. The main advantage of the proposed codes is that decoding of RKRP codes is highly numerically stable in comparison to decoding of Polynomial codes and decoding of the recently proposed OrthoPoly codes. We show that RKRP codes are maximum distance separable with probability 1. The communication cost and encoding complexity for RKRP codes are identical to that of OrthoPoly codes and Polynomial codes and the average decoding complexity of RKRP codes is lower than that of OrthoPoly codes. Numerical results show that the average relative L_2-norm of the reconstruction error for RKRP codes is substantially better than that of OrthoPoly codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication

We propose two coding schemes for distributed matrix multiplication in t...
research
05/31/2019

Collaborative Decoding of Polynomial Codes for Distributed Computation

We show that polynomial codes (and some related codes) used for distribu...
research
05/12/2022

Sparse Random Khatri-Rao Product Codes for Distributed Matrix Multiplication

We introduce two generalizations to the paradigm of using Random Khatri-...
research
04/20/2016

Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

We prove that Alekhnovich's algorithm can be used for row reduction of s...
research
04/05/2018

Numerical and analytical bounds on threshold error rates for hypergraph-product codes

We study analytically and numerically decoding properties of finite rate...
research
12/21/2017

Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers

We propose two coded schemes for the distributed computing problem of mu...
research
03/20/2019

Numerically Stable Polynomially Coded Computing

We study the numerical stability of polynomial based encoding methods, w...

Please sign up or login with your details

Forgot password? Click here to reset