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.
Kłopotek, Machine learning friendly set version of Johnson–Lindenstrauss lemma, Knowledge and Information Systems, 62(5) : 1961-2009, 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.MG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.