The space complexity of inner product filters

Abstract

Motivated by the problem of filtering candidate pairs in inner product similarity joins we study the following inner product estimation problem: Given parameters $d\in \mathbf{N}$, $\alpha >\beta \ge 0$ and unit vectors $x,y\in {\mathbf{R}}^d$ consider the task of distinguishing between the cases $⟨x,y⟩\le \beta$ and $⟨x,y⟩\ge \alpha$ where $⟨x,y⟩={\sum }_{i=1}^d{x}_i{y}_i$ is the inner product of vectors $x$ and $y$. The goal is to distinguish these cases based on information on each vector encoded independently in a bit string of the shortest length possible. In contrast to much work on compressing vectors using randomized dimensionality reduction, we seek to solve the problem deterministically, with no probability of error. Inner product estimation can be solved in general via estimating $⟨x,y⟩$ with an additive error bounded by $\epsilon =\alpha -\beta$. We show that $d{\log }_2\left(\frac{\sqrt{1-\beta }}{\epsilon }\right)\pm \Theta (d)$ bits of information about each vector is necessary and sufficient. Our upper bound is constructive and improves a known upper bound of $d{\log }_2(1/\epsilon )+O(d)$ by up to a factor of 2 when $\beta$ is close to $1$. The lower bound holds even in a stronger model where one of the vectors is known exactly, and an arbitrary estimation function is allowed.

To appear at ICDT 2020