Approximate nearest neighbor search for ℓₚ-spaces (2 < p < ∞) via embeddings

Original · EN

While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ₁, few non-trivial algorithms are known for ℓₚ when (2 < p < ∞). In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the first non-trivial approximation factor guarantees in this setting.