Analysis of a randomized approximation scheme for matrix multiplication
classification
💻 cs.DS
cs.LGcs.NAstat.ML
keywords
matrixanalysisapproximationinequalitymultiplicationrandomrandomizedscheme
read the original abstract
This note gives a simple analysis of a randomized approximation scheme for matrix multiplication proposed by Sarlos (2006) based on a random rotation followed by uniform column sampling. The result follows from a matrix version of Bernstein's inequality and a tail inequality for quadratic forms in subgaussian random vectors.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.