Presentation
SIGN IN TO VIEW THIS PRESENTATION Sign In
A High Performance GPU CountSketch Implementation and Its Application to Multisketching and Least Squares Problems
DescriptionRandom sketching is a dimensionality reduction technique that approximately preserves norms and singular values up to some O(1) distortion factor with high probability. The most popular sketches in literature are the Gaussian sketch and the subsampled randomized Hadamard transform, while the CountSketch has lower complexity. Combining two sketches, known as multisketching, offers an inexpensive means of quickly reducing the dimension of a matrix by combining a CountSketch and Gaussian sketch.
However, there has been little investigation into high performance CountSketch implementations. In this work, we develop an efficient GPU implementation of the CountSketch, and demonstrate the performance of multisketching using this technique. We also demonstrate the potential for using this implementation within a multisketched least squares solver that is up to 77% faster than the normal equations with significantly better numerical stability, at the cost of an O(1) multiplicative factor introduced into the relative residual norm.
However, there has been little investigation into high performance CountSketch implementations. In this work, we develop an efficient GPU implementation of the CountSketch, and demonstrate the performance of multisketching using this technique. We also demonstrate the potential for using this implementation within a multisketched least squares solver that is up to 77% faster than the normal equations with significantly better numerical stability, at the cost of an O(1) multiplicative factor introduced into the relative residual norm.