Dimension reduction techniques for $\ell_p$, $1 \le p \le 2$, with applications
Yair Bartal, Lee-Ad Gottlieb

TL;DR
This paper extends dimension reduction techniques to all $\, ext{l}_p$ spaces between 1 and 2, providing new embeddings with bounded fidelity range and improved bounds for proximity problems.
Contribution
It generalizes the Ostrovsky-Rabani approach from $\, ext{l}_1$ to all $\, ext{l}_p$ spaces for $1 \,\leq\, p \,\leq \, 2$, with enhanced bounds and applications.
Findings
Developed bounded range embeddings for all $\, ext{l}_p$ spaces with $1 \,\leq\, p \,\leq \, 2$
Achieved improved bounds related to intrinsic dimensionality
Enhanced results for clustering and proximity problems
Abstract
For Euclidean space (), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all spaces . Although strong lower bounds are known for dimension reduction in , Ostrovsky and Rabani successfully circumvented these by presenting an embedding that maintains fidelity in only a bounded distance range, with applications to clustering and nearest neighbor search. However, their embedding techniques are specific to and do not naturally extend to other norms. In this paper, we apply a range of advanced techniques and produce bounded range dimension reduction embeddings for all of , thereby demonstrating that the approach initiated by Ostrovsky and Rabani for can be extended to a much more…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Machine Learning and Algorithms · Computational Geometry and Mesh Generation
