Pith. sign in

REVIEW

Analysis of a randomized approximation scheme for matrix multiplication

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1211.5414 v1 pith:FJ72SVCN submitted 2012-11-23 cs.DS cs.LGcs.NAmath.NAstat.ML

Daniel Hsu , Sham M. Kakade , Tong Zhang This is my paper · ORCID
classification cs.DScs.LGcs.NAmath.NAstat.ML
keywords matrixanalysisapproximationinequalitymultiplicationrandomrandomizedscheme
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools