Approximate Nearest Neighbor Search For ell_p-spaces (2 < P < infty) Via Embeddings | Awesome Learning to Hash Add your paper to Learning2Hash

Awesome Learning to Hash

A Webpage dedicated to the latest research on Hash Function Learning. Maintained by Sean Moran.

Contact Sean Moran about this survey or website. Made with Jekyll and Hyde.

Approximate Nearest Neighbor Search For ell_p-spaces (2 < P < infty) Via Embeddings

Bartal Yair, Gottlieb Lee-ad. Arxiv 2015

[Paper]    
ARXIV

While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and \(\ell_1\), few non-trivial algorithms are known for \(\ell_p\) when (\(2 < p < \infty\)). 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.

Similar Work