Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search
Mingyu Yang, Liuchang Jing, Wentao Li, and Wei Wang

TL;DR
This paper introduces MRQ, a novel vector quantization method that combines projection with quantization to improve approximate k-nearest neighbor search efficiency and flexibility in compression ratios.
Contribution
MRQ integrates projection with quantization, enabling decoupling of code length from original dimensionality and enhancing search speed and compression flexibility.
Findings
MRQ achieves up to 3x faster search speed.
MRQ uses only one-third the quantization bits.
MRQ maintains comparable accuracy to state-of-the-art methods.
Abstract
Approximate -nearest neighbor (AKNN) search is a fundamental problem with wide applications. To reduce memory and accelerate search, vector quantization is widely adopted. However, existing quantization methods either rely on codebooks -- whose query speed is limited by costly table lookups -- or adopt dimension-wise quantization, which maps each vector dimension to a small quantized code for fast search. The latter, however, suffers from a fixed compression ratio because the quantized code length is inherently tied to the original dimensionality. To overcome these limitations, we propose MRQ, a new approach that integrates projection with quantization. The key insight is that, after projection, high-dimensional vectors tend to concentrate most of their information in the leading dimensions. MRQ exploits this property by quantizing only the information-dense projected subspace --…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Image and Video Retrieval Techniques · Data Management and Algorithms · Video Surveillance and Tracking Methods
