Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 - Archive ouverte HAL Access content directly
Conference Papers Year :

Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1

(1, 2) , (1) , (3)


Randomized dimensionality reduction has been recognized as one of the fundamental techniques in handling high-dimensional data. Starting with the celebrated Johnson-Lindenstrauss Lemma, such reductions have been studied in depth for the Euclidean (L2) metric, but much less for the Manhattan (L1) metric. Our primary motivation is the approximate nearest neighbor problem in L1. We exploit its reduction to the decision-with-witness version, called approximate near neighbor, which incurs a roughly logarithmic overhead. In 2007, Indyk and Naor, in the context of approximate nearest neighbors, introduced the notion of nearest neighbor-preserving embeddings. These are randomized embeddings between two metric spaces with guaranteed bounded distortion only for the distances between a query point and a point set. Such embeddings are known to exist for both L2 and L1 metrics, as well as for doubling subsets of L2. The case that remained open were doubling subsets of L1. In this paper, we propose a dimension reduction by means of a near neighbor-preserving embedding for doubling subsets of L1. Our approach is to represent the pointset with a carefully chosen covering set, then randomly project the latter. We study two types of covering sets: c-approximate r-nets and randomly shifted grids, and we discuss the tradeoff between them in terms of preprocessing time and target dimension. We employ Cauchy variables: certain concentration bounds derived should be of independent interest.
Fichier principal
Vignette du fichier
EmMaPs-APPROX-RANDOM-2019.pdf (501.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02398741 , version 1 (07-12-2019)



Ioannis Z. Emiris, Vasilis Margonis, Ioannis Psarros. Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1. APPROX 2019 - Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Sep 2019, Boston, United States. ⟨10.4230/LIPIcs.APPROX-RANDOM.2019.47⟩. ⟨hal-02398741⟩
40 View
48 Download



Gmail Facebook Twitter LinkedIn More