Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fast top-K Cosine Similarity Search through XOR-Friendly Binary Quantization on GPUs (2008.02002v1)

Published 5 Aug 2020 in cs.CV and cs.IR

Abstract: We explore the use of GPU for accelerating large scale nearest neighbor search and we propose a fast vector-quantization-based exhaustive nearest neighbor search algorithm that can achieve high accuracy without any indexing construction specifically designed for cosine similarity. This algorithm uses a novel XOR-friendly binary quantization method to encode floating-point numbers such that high-complexity multiplications can be optimized as low-complexity bitwise operations. Experiments show that, our quantization method takes short preprocessing time, and helps make the search speed of our exhaustive search method much more faster than that of popular approximate nearest neighbor algorithms when high accuracy is needed.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Xiaozheng Jian (2 papers)
  2. Jianqiu Lu (1 paper)
  3. Zexi Yuan (1 paper)
  4. Ao Li (46 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.