no code implementations • 17 Nov 2023 • Shabarish Chenakkod, Michał Dereziński, Xiaoyu Dong, Mark Rudelson
We use this to construct the first oblivious subspace embedding with $O(d)$ embedding dimension that can be applied faster than current matrix multiplication time, and to obtain an optimal single-pass algorithm for least squares regression.
