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.
zhangran223 / low-rank-hadamard Goto Github PK
View Code? Open in Web Editor NEWThis project forked from rustandruin/low-rank-hadamard
approximation error bounds for low rank approximation of matrices using subsampled randomized hadamard transforms