@inproceedings{54c19f1d69c0452d945b646e150c7420,

title = "E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication",

abstract = "We study coded distributed matrix multiplication from an approximate recovery viewpoint. We consider a system of P computation nodes where each node stores 1/m of each multiplicand via linear encoding. Our main result shows that the matrix product can be recovered with relative error from any m of the P nodes for any >0. We obtain this result through a careful specialization of MatDot codes-a class of matrix multiplication code previously developed in the context of exact recovery ( = 0). Since previous results showed that the MatDot code is tight for a class of linear coding schemes for exact recovery, our result shows that allowing for mild approximations leads to a system that is nearly twice as efficient as exact reconstruction. Moreover, we develop an optimization framework based on alternating minimization that enables the discovery of new codes for approximate matrix multiplication.",

author = "Cadambe, {Viveck R.} and Calmon, {Flavio P.} and Ateet Devulapalli and Haewon Jeong",

note = "Funding Information: ∗Authors in alphabetical order. This material is based upon work supported by the National Science Foundation under grants CIF 1900750, CAREER 1845852, and CCF 1763657. 1This essentially translates to the Singleton bound being tight for a sufficiently large alphabet Publisher Copyright: {\textcopyright} 2021 IEEE.; 2021 IEEE International Symposium on Information Theory, ISIT 2021 ; Conference date: 12-07-2021 Through 20-07-2021",

year = "2021",

month = jul,

day = "12",

doi = "10.1109/ISIT45174.2021.9517861",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1582--1587",

booktitle = "2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings",

address = "United States",

}