Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)

  title={Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)},
  author={Anshumali Shrivastava and Ping Li},
Recently we showed that the problem of Maximum Inner Product Search (MIPS) is efficient and it admits provably sub-linear hashing algorithms. In [23], we used asymmetric transformations to convert the problem of approximate MIPS into the problem of approximate near neighbor search which can be efficiently solved using L2-LSH. In this paper, we revisit the problem of MIPS and argue that the quantizations used in L2-LSH is suboptimal for MIPS compared to signed random projections (SRP) which is… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 8 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 37 extracted citations

Improved maximum inner product search with better theoretical guarantees

2017 International Joint Conference on Neural Networks (IJCNN) • 2017
View 7 Excerpts
Highly Influenced

fewer than 50 Citations

Citations per Year
Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…