Johnson-Lindenstrauss lemma: embed to O(log n) dims with 1+ε distortion for k-means
FrnkNlsn · x · 2026-11-22
FrnkNlsn shares a teaching card on the Johnson-Lindenstrauss lemma: any n-point set in R^d can be embedded into k=O((1/ε²)·log n) dimensions with distortion bounded by 1±ε. A random projection matrix with i.i.d. standard normal entries (via Box-Muller) suffices, with sparse extensions. Practical upshot: high-dimensional embeddings can be reduced to O(log n) dims before running k-means, slashing compute with negligible structural loss.
More from Research
- MIT study: coding agents boost commits 240% but releases only 30% — apps ship into the void — GaryMarcus · 2026-11-22
- ISO: Fixed-Spectrum Optimization Merges RL Experts on 375B MoE in Minutes — zdhnarsil · 2026-11-22
- Redditor trains Krea2 to skip VAE Decode and output pixels directly using DWD paper — Remote_Net374 · 2026-11-22
- 'AI proves the Riemann hypothesis in 2026' — versus Riemann's 20-watt brain in 1859 — doodlestein · 2026-11-22
- Scientific American's 'End of Math' cover resurfaces after Riemann hypothesis reportedly solved — EricTopol · 2026-11-22
- 'Don't train on model outputs' is unenforceable when the data is all over the open web — anpaure · 2026-11-22