TY - GEN
T1 - Dimension reduction techniques for ℓp (1 ≤ p ≤ 2), with applications
AU - Bartal, Yair
AU - Gottlieb, Lee Ad
N1 - Publisher Copyright:
© Yair Bartal and Lee-Ad Gottlieb.
PY - 2016/6/1
Y1 - 2016/6/1
N2 - For Euclidean space (ℓ2), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss [26], with a host of known applications. Here, we consider the problem of dimension reduction for all ℓp spaces 1 ≤ p ≤ 2. Although strong lower bounds are known for dimension reduction in ℓ1, Ostrovsky and Rabani [40] successfully circumvented these by presenting an ℓ1 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 ℓ1 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 1 ≤ p ≤ 2, thereby demonstrating that the approach initiated by Ostrovsky and Rabani for ℓ1 can be extended to a much more general framework. We also obtain improved bounds in terms of the intrinsic dimensionality. As a result we achieve improved bounds for proximity problems including snowflake embeddings and clustering.
AB - For Euclidean space (ℓ2), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss [26], with a host of known applications. Here, we consider the problem of dimension reduction for all ℓp spaces 1 ≤ p ≤ 2. Although strong lower bounds are known for dimension reduction in ℓ1, Ostrovsky and Rabani [40] successfully circumvented these by presenting an ℓ1 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 ℓ1 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 1 ≤ p ≤ 2, thereby demonstrating that the approach initiated by Ostrovsky and Rabani for ℓ1 can be extended to a much more general framework. We also obtain improved bounds in terms of the intrinsic dimensionality. As a result we achieve improved bounds for proximity problems including snowflake embeddings and clustering.
KW - Dimension reduction
KW - Embeddings
UR - http://www.scopus.com/inward/record.url?scp=84976871584&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.SoCG.2016.16
DO - 10.4230/LIPIcs.SoCG.2016.16
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84976871584
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 16.1-16.15
BT - 32nd International Symposium on Computational Geometry, SoCG 2016
A2 - Fekete, Sandor
A2 - Lubiw, Anna
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 32nd International Symposium on Computational Geometry, SoCG 2016
Y2 - 14 June 2016 through 17 June 2016
ER -