Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Polysemous codes   This paper considers the problem of approximate nearest neighbor search in
the compressed domain. We introduce polysemous codes, which offer both the
distance estimation quality of product quantization and the efficient
comparison of binary codes with Hamming distance. Their design is inspired by
algorithms introduced in the 90's to construct channel-optimized vector
quantizers. At search time, this dual interpretation accelerates the search.
Most of the indexed vectors are filtered out with Hamming distance, letting
only a fraction of the vectors to be ranked with an asymmetric distance
estimator.
  The method is complementary with a coarse partitioning of the feature space
such as the inverted multi-index. This is shown by our experiments performed on
several public benchmarks such as the BIGANN dataset comprising one billion
vectors, for which we report state-of-the-art results for query times below
0.3\,millisecond per core. Last but not least, our approach allows the
approximate computation of the k-NN graph associated with the Yahoo Flickr
Creative Commons 100M, described by CNN image descriptors, in less than 8 hours
on a single machine.

22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph