DeepAI AI Chat
Log In Sign Up

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation

by   Aline Bessa, et al.

We present a new approach for computing compact sketches that can be used to approximate the inner product between pairs of high-dimensional vectors. Based on the Weighted MinHash algorithm, our approach admits strong accuracy guarantees that improve on the guarantees of popular linear sketching approaches for inner product estimation, such as CountSketch and Johnson-Lindenstrauss projection. Specifically, while our method admits guarantees that exactly match linear sketching for dense vectors, it yields significantly lower error for sparse vectors with limited overlap between non-zero entries. Such vectors arise in many applications involving sparse data. They are also important in increasingly popular dataset search applications, where inner product sketches are used to estimate data covariance, conditional means, and other quantities involving columns in unjoined tables. We complement our theoretical results by showing that our approach empirically outperforms existing linear sketches and unweighted hashing-based sketches for sparse vectors.


Efficient Inner Product Approximation in Hybrid Spaces

Many emerging use cases of data mining and machine learning operate on l...

An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors

Maximum Inner Product Search or top-k retrieval on sparse vectors is wel...

Asymmetric Minwise Hashing

Minwise hashing (Minhash) is a widely popular indexing scheme in practic...

Quantization based Fast Inner Product Search

We propose a quantization based approach for fast approximate Maximum In...

SAH: Shifting-aware Asymmetric Hashing for Reverse k-Maximum Inner Product Search

This paper investigates a new yet challenging problem called Reverse k-M...

The space complexity of inner product filters

Motivated by the problem of filtering candidate pairs in inner product s...

Partial Tail Correlation for Extremes

We develop a method for investigating conditional extremal relationships...