Nearest neighbor search with compact codes: A decoder perspective

by   Kenza Amara, et al.

Modern approaches for fast retrieval of similar vectors on billion-scaled datasets rely on compressed-domain approaches such as binary sketches or product quantization. These methods minimize a certain loss, typically the mean squared error or other objective functions tailored to the retrieval problem. In this paper, we re-interpret popular methods such as binary hashing or product quantizers as auto-encoders, and point out that they implicitly make suboptimal assumptions on the form of the decoder. We design backward-compatible decoders that improve the reconstruction of the vectors from the same codes, which translates to a better performance in nearest neighbor search. Our method significantly improves over binary hashing methods or product quantization on popular benchmarks.


page 1

page 2

page 3

page 4


Correlation Hashing Network for Efficient Cross-Modal Retrieval

Hashing is widely applied to approximate nearest neighbor search for lar...

Exploiting Modern Hardware for High-Dimensional Nearest Neighbor Search

Many multimedia information retrieval or machine learning problems requi...

One Loss for Quantization: Deep Hashing with Discrete Wasserstein Distributional Matching

Image hashing is a principled approximate nearest neighbor approach to f...

An ensemble diversity approach to supervised binary hashing

Binary hashing is a well-known approach for fast approximate nearest-nei...

Compression Network with Transformer for Approximate Nearest Neighbor Search

We propose a generic feature compression method for Approximate Nearest ...

Polysemous codes

This paper considers the problem of approximate nearest neighbor search ...

Polytopes, lattices, and spherical codes for the nearest neighbor problem

We study locality-sensitive hash methods for the nearest neighbor proble...

Please sign up or login with your details

Forgot password? Click here to reset