Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
<|reference_start|>Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search: Clustering-based nearest neighbor search is a simple yet effective method in which data points are partitioned into geometric shards to form an index, and only a few shards are searched during query processing to find an approximate set of top-$k$ vectors. Even though the search efficacy is heavily influenced by the algorithm that identifies the set of shards to probe, it has received little attention in the literature. This work attempts to bridge that gap by studying the problem of routing in clustering-based maximum inner product search (MIPS). We begin by unpacking existing routing protocols and notice the surprising contribution of optimism. We then take a page from the sequential decision making literature and formalize that insight following the principle of ``optimism in the face of uncertainty.'' In particular, we present a new framework that incorporates the moments of the distribution of inner products within each shard to optimistically estimate the maximum inner product. We then present a simple instance of our algorithm that uses only the first two moments to reach the same accuracy as state-of-the-art routers such as \scann by probing up to $50%$ fewer points on a suite of benchmark MIPS datasets. Our algorithm is also space-efficient: we design a sketch of the second moment whose size is independent of the number of points and in practice requires storing only $O(1)$ additional vectors per shard.<|reference_end|>
@article{bruch2024optimistic,
    title={Optimistic Query Routing in Clustering-based Approximate Maximum Inner
  Product Search},
    author={Sebastian Bruch, Aditya Krishnan, Franco Maria Nardini},
    journal={arXiv preprint arXiv:2405.12207},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.12207},
    primaryClass={cs.LG cs.IR}
}