SAH: Shifting-aware Asymmetric Hashing for Reverse $k$-Maximum Inner Product Search. (arXiv:2211.12751v1 [cs.IR])

This paper investigates a new yet challenging problem called Reverse
$k$-Maximum Inner Product Search (R$k$MIPS). Given a query (item) vector, a set
of item vectors, and a set of user vectors, the problem of R$k$MIPS aims to
find a set of user vectors whose inner products with the query vector are one
of the $k$ largest among the query and item vectors. We propose the first
subquadratic-time algorithm, i.e., Shifting-aware Asymmetric Hashing (SAH), to
tackle the R$k$MIPS problem. To speed …

arxiv hashing product product search search