Skip to content

Latest commit

 

History

History
6 lines (5 loc) · 355 Bytes

File metadata and controls

6 lines (5 loc) · 355 Bytes

Improved Low-rank Matrix Decompositions via the Subsampled Randomized Hadamard Transform

We comment on two randomized algorithms for constructing low-rank matrix decompositions. Both algorithms employ the Subsampled Randomized Hadamard Transform. We provide a novel analysis that significantly improves previous approximation bounds.