REVIEW 4 cited by
An Introduction to Johnson-Lindenstrauss Transforms
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
Signed reviews
read the original abstract
Johnson--Lindenstrauss Transforms are powerful tools for reducing the dimensionality of data while preserving key characteristics of that data, and they have found use in many fields from machine learning to differential privacy and more. This note explains what they are; it gives an overview of their use and their development since they were introduced in the 1980s; and it provides many references should the reader wish to explore these topics more deeply.
Forward citations
Cited by 4 Pith papers
-
Computationally-efficient Graph Modeling with Refined Graph Random Features
Stitching several short random walks into a product of unbiased feature matrices approximates graph node kernels with less variance and better long-range coverage than single long walks.
-
FedRP: A Communication-Efficient Approach for Differentially Private Federated Learning Using Random Projection
FedRP claims to preserve FedAvg-level accuracy while sending only a few numbers per client per round and providing an (epsilon, delta)-DP guarantee.
-
The Blessing and Curse of Dimensionality in Safety Alignment
Compressing LLM internals via FJLT projection or a bottleneck layer disrupts linear safety directions and blocks activation-steering jailbreaks, at some utility cost and with no defense against non-linear attacks.
-
A remark on dimensionality reduction in discrete subgroups
A discrete-lattice version of the Johnson-Lindenstrauss lemma is attempted, but a scaling error in the lower distortion bound leaves the central claim unproved.
Discussion (0). Continue with ORCID to comment.