Fast Matrix Multiplication with Sketching
Numerical Analysis
2014-06-12 v2 Data Structures and Algorithms
Numerical Analysis
Abstract
We present an approximate algorithm for matrix multiplication based on matrix sketching techniques. First one of the matrix is chosen and sparsified using the online matrix sketching algorithm, and then the matrix product is calculated using the sparsified matrix. We prove when the sample number grows large compared to the sample dimensions the proposed algorithm achieves similar accuracy bound with a smaller computational cost compared to the state-of-the-art algorithms.
Cite
@article{arxiv.1406.2648,
title = {Fast Matrix Multiplication with Sketching},
author = {Huan Wang and Christos Boutsidis and Edo Liberty and Daniel Hsu},
journal= {arXiv preprint arXiv:1406.2648},
year = {2014}
}
Comments
Theorem 1 may be problematic, and more careful thought is required. The authors are discussing a solution on it. Currently it is better to withdraw the draft