Approximate Weighted CR Coded Matrix Multiplication

11/19/2020 ∙ by Neophytos Charalambides, et al. ∙ 0

One of the most common, but at the same time expensive operations in linear algebra, is multiplying two matrices A and B. With the rapid development of machine learning and increases in data volume, performing fast matrix intensive multiplications has become a major hurdle. Two different approaches to overcoming this issue are, 1) to approximate the product; and 2) to perform the multiplication distributively. A CR-multiplication is an approximation where columns and rows of A and B are respectively sampled with replacement. In the distributed setting, multiple workers perform matrix multiplication subtasks in parallel. Some of the workers may be stragglers, meaning they do not complete their task in time. We present a novel approximate weighted CR coded matrix multiplication scheme, that achieves improved performance for distributed matrix multiplication.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.