Optimal dimension reduction bound for Euclidean point sets
Optimal dimension reduction bound for Euclidean point sets
Let denote the smallest such that every -point subset of can be embedded into with distortion at most . Dimension-reduction conjecture. For all and ,
This conjecture predicts the optimal Euclidean target dimension across the full range of distortion parameters, including the regime where approaches ; the paper proves a matching lower bound up to a logarithmic factor in a nearly full range of , while the stated formula remains the conjectural optimal form.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Kasper Green Larsen and Jelani Nelson, “Optimality of the Johnson-Lindenstrauss Lemma”, arXiv:1609.02094 (2017).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.