Locality Sensitive Hashing for Maximum Inner Product Search
(Maximum Inner Product Search) Given a set of points $S \in R^D$ of size N , and a query point $q$ . Determine : $x^{*} = \mathrm{arg} \max_{x \in S}q^Tx$ In this presentation, I will introduce the problem of Maximum Inner Product Search (MIPS) and a series of Locality Sensitive Hashing (LSH) methods to solve MIPS in sub-linear time. Reference papers are included in the below slides. Presentation slides: Locality Sensitive Hashing for Maximum Inner Product Search . Presenter: Dung Le.