Papers › The Fast Johnson-Lindenstrauss Transform is Even Faster
The Fast Johnson-Lindenstrauss Transform is Even Faster
Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen
The seminal Fast Johnson-Lindenstrauss (Fast JL) transform by Ailon and Chazelle (SICOMP'09) embeds a set of n points in d-dimensional Euclidean space into optimal k=O(ε⁻² lnn) dimensions, while preserving all pairwise distances to within a factor (1 ±ε). The Fast JL transform supports computing the embedding of a data point in O(d lnd +k ln² n) time, where the d lnd term comes from multiplication with a d ×d Hadamard matrix and the k ln² n term comes from multiplication with a sparse k ×d matrix. Despite the Fast JL transform being more than a decade old, it is one of the fastest dimensionality reduction techniques for many tradeoffs between ε, d and n. In this work, we give a surprising new analysis of the Fast JL transform, showing that the k ln² n term in the embedding time can be improved to (k ln² n)/α for an α= Ω(min{ε⁻¹ln(1/ε), lnn}). The improvement follows by using an even sparser matrix. We also complement our improved analysis with a lower bound showing that our new analysis is in fact tight.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections