Approximate Weighted C R Coded Matrix Multiplication
Citations Over Time
Abstract
One of the most common operations in signal processing is matrix multiplication. However, it presents a major computational bottleneck when the matrix dimension is high, as can occur for large data size or feature dimension. Two different approaches to overcoming this bottleneck are: 1) low rank approximation of the matrix product; and 2) distributed computation. We propose a scheme that combines these two approaches. To enable distributed low rank approximation, we generalize the approximate matrix CR-multiplication to accommodate weighted block sampling, and we introduce a weighted coded matrix multiplication method. This results in novel approximate weighted CR coded matrix multiplication schemes, which achieve improved performance for distributed matrix multiplication and are robust to stragglers.
Related Papers
- → Fast sparse matrix multiplication(2005)254 cited
- → Fast Output-Sensitive Matrix Multiplication(2015)10 cited
- → E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication(2021)1 cited
- ON AN OPTIMAL ALGORITHM FOR MATRIX MULTIPLICATION(1990)
- → Case Study 2: Parallel Compact WY QR Factorization(2003)