Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 14 tok/s Pro
GPT-5 High 14 tok/s Pro
GPT-4o 90 tok/s Pro
Kimi K2 179 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction (1411.2404v1)

Published 10 Nov 2014 in cs.IT, cs.CG, cs.DS, math.FA, and math.IT

Abstract: For any $n>1$ and $0<\varepsilon<1/2$, we show the existence of an $n{O(1)}$-point subset $X$ of $\mathbb{R}n$ such that any linear map from $(X,\ell_2)$ to $\ell_2m$ with distortion at most $1+\varepsilon$ must have $m = \Omega(\min{n, \varepsilon{-2}\log n})$. Our lower bound matches the upper bounds provided by the identity matrix and the Johnson-Lindenstrauss lemma, improving the previous lower bound of Alon by a $\log(1/\varepsilon)$ factor.

Citations (65)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.