REVIEW 2 cited by
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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_2^m$ 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.
Forward citations
Cited by 2 Pith papers
-
LLM DNA: Tracing Model Evolution via Functional Representations
LLM DNA is introduced as a low-dimensional bi-Lipschitz functional representation proven to satisfy inheritance and genetic determinism, with a training-free extraction pipeline tested on 305 models to reveal relation...
-
AFBS:Buffer Gradient Selection in Semi-asynchronous Federated Learning
AFBS scores buffered gradients by staleness and dataset size, discards low-value ones, and clusters clients through random-projection-encrypted label distributions before aggregation in semi-asynchronous federated learning.
Discussion (0). Continue with ORCID to comment.