✳flâneur — a map of the web's best reading
Johnson–Lindenstrauss lemma
en.wikipedia.org · 6,285 words · saved by 1 readers
Couldn't find lead section for Johnson–Lindenstrauss_lemma
Johnson–Lindenstrauss lemma - Wikipedia Jump to content From Wikipedia, the free encyclopedia Mathematical result In mathematics , the Johnson–Lindenstrauss lemma is a result named after William B. Johnson and Joram Lindenstrauss concerning low-distortion embeddings of points from high-dimensional into low-dimensional Euclidean space . The lemma states that a set of points in a high-dimensional space can be embedded into a space of much lower dimension in such a way that distances between the points are nearly preserved . In the classical proof of the lemma, the embedding is a random orthogona
Explore this link on the map →related reading
- Johnson–Lindenstrauss lemma - Wikipediam.wikipedia.org
- A short survey on almost orthogonal vectors in a few specific large dimensionsarxiv.org
- There are exponentially many vectors with small inner product – Longest path searchlmao.bearblog.dev
- 1409.6366arxiv.org
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- unit-distance-remarks.pdfcdn.openai.com
- [2504.19874] TurboQuant: Online Vector Quantization with Near-optimal Distortion Ratearxiv.org
- Gregory Gundersengregorygundersen.com
- https://www.deeplearningbook.org/contents/linear_algebra.htmldeeplearningbook.org
- arxiv.org/pdf/2511.08544arxiv.org
- [2410.13780] Optimal Quantization for Matrix Multiplicationarxiv.org
- Chernoff bound - Wikipediaen.wikipedia.org