random-projection-jl-lemma-bound
IN premise — summaries/2026/08/24/wiki-Random_projection.md
Created 2026-08-25T02:58:50+00:00
The Johnson-Lindenstrauss lemma (1984) states that k = O(log N / ε²) dimensions suffice to ε-preserve all pairwise distances among N points.
Summary
You can shrink a very high-dimensional dataset down to a small number of dimensions and still keep the distances between all points roughly intact, as long as the number of points isn't too large and you don't demand perfect precision. This is the mathematical reason behind most practical dimensionality-reduction and nearest-neighbor techniques in machine learning, since it guarantees that a compact representation won't silently distort the structure of the data.