Metraipolis › archive › dc_1087ca1fcd87

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models — arXiv:2609.02155

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02155
License (as archived)
CC0-1.0
Archived
2026-10-17T04:59:25.942Z
SHA-256 of the archived text
0714a59c23c00b1edc5f2d2aa483a6bc0c42db26f5a400d536b7012be00216f9
Stable URL of this page
https://metraipolis.com/documento/dc_1087ca1fcd87

How to cite

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models — arXiv:2609.02155 — arXiv (en), https://arxiv.org/abs/2609.02155 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1087ca1fcd87 (Metraipolis archive dc_1087ca1fcd87, sha256 0714a59c23c00b1edc5f2d2aa483a6bc0c42db26f5a400d536b7012be00216f9)
BibTeX
@misc{dc1087ca1fcd87,
  title = {Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models — arXiv:2609.02155},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02155},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1087ca1fcd87; sha256 0714a59c23c00b1edc5f2d2aa483a6bc0c42db26f5a400d536b7012be00216f9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02155. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal. In high dimensions, however, distances concentrate around a baseline while key geometric information lies in much smaller fluctuations. We show that the JL bound can therefore be uninformative about retained geometry: an independent Gaussian replacement map can satisfy it even though the replacement cloud is independent of the original data. We then ask how well any decoder can recover a feature $f(D)$ of a squared distance $D$ from a linear sketch. Under squared-error loss, the optimal decoder is conditional expectation, so recovery defines a linear operator whose singular values quantify feature recovery. For isotropic Gaussian data ($\Sigma=\sigma^2 I_d$), we diagonalize this operator in closed form. For fixed $k$ with $m,d-m\to\infty$, its $k$th singular value satisfies $\ell_k\approx(m/ d)^{k/2}$. This yields three sharp consequences. A rank-$m$ sketch retains at most an $m/d$ fraction of the variance of any feature of one squared distance. If $m\to\infty$ and $m/d\to0$, the expected Kendall correlation is $\frac{2}{\pi}\sqrt{m/d}(1+o(1))$; for fixed $q$, nearest- neighbor agreement tends to $1/q$. Yet one projection can satisfy the JL bound while mean Kendall correlation vanishes when $\log n\ll m\ll d$. After removing scale, Haar-averaged retained covariance-shape information is $(m/d)^2$. Thus JL distance preservation does not quantify the geometry available for comparison or inference.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-03 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Information Theory (cs.IT); Numerical Analysis (math.NA); Probability (math.PR); Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.02155 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T04:09:43.313Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).