Asset Details
Do you wish to reserve the book?
A Sparse Johnson-Lindenstrauss Transform using Fast Hashing
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Sparse Johnson-Lindenstrauss Transform using Fast Hashing
Do you wish to request the book?
A Sparse Johnson-Lindenstrauss Transform using Fast Hashing
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
A Sparse Johnson-Lindenstrauss Transform using Fast Hashing
2023
Overview
The Sparse Johnson-Lindenstrauss Transform of Kane and Nelson (SODA 2012) provides a linear dimensionality-reducing map \\(A ın R^m u\\) in \\(_2\\) that preserves distances up to distortion of \\(1 + \\) with probability \\(1 - \\), where \\(m = O(^-2 1/)\\) and each column of \\(A\\) has \\(O( m)\\) non-zero entries. The previous analyses of the Sparse Johnson-Lindenstrauss Transform all assumed access to a \\(( 1/)\\)-wise independent hash function. The main contribution of this paper is a more general analysis of the Sparse Johnson-Lindenstrauss Transform with less assumptions on the hash function. We also show that the Mixed Tabulation hash function of Dahlgaard, Knudsen, Rotenberg, and Thorup (FOCS 2015) satisfies the conditions of our analysis, thus giving us the first analysis of a Sparse Johnson-Lindenstrauss Transform that works with a practical hash function.
Publisher
Cornell University Library, arXiv.org
Subject
We currently cannot retrieve any items related to this title. Kindly check back at a later time.