Fast top-K Cosine Similarity Search through XOR-Friendly Binary Quantization on GPUs
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
any4: Learned 4-bit Numeric Representation for LLMs
CommVQ: Commutative Vector Quantization for KV Cache Compression
Speculative Decoding Meets Quantization: Compatibility Evaluation and Hierarchical Framework Design
MNN-LLM: A Generic Inference Engine for Fast Large Language Model Deployment on Mobile Devices
Arctic Inference with Shift Parallelism: Fast and Efficient Open Source Inference System for Enterprise AI
Relative Entropy Pathwise Policy Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.