Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search
Not on the map. Why?
Abstract (arXiv)
Vector quantization (VQ) techniques are widely used in similarity search for data compression, fast metric computation and etc. Originally designed for Euclidean distance, existing VQ techniques (e.g., PQ, AQ) explicitly or implicitly minimize the quantization error. In this paper, we present a new angle to analyze the quantization error, which decomposes the quantization error into norm error and direction error. We show that quantization errors in norm have much higher influence on inner products than quantization errors in direction, and small quantization error does not necessarily lead to good performance in maximum inner product search (MIPS). Based on this observation, we propose norm-explicit quantization (NEQ) --- a general paradigm that improves existing VQ techniques for MIPS. NEQ quantizes the norms of items in a dataset explicitly to reduce errors in norm, which is crucial for MIPS. For the direction vectors, NEQ can simply reuse an existing VQ technique to quantize them without modification. We conducted extensive experiments on a variety of datasets and parameter configurations. The experimental results show that NEQ improves the performance of various VQ techniques for MIPS, including PQ, OPQ, RQ and AQ.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 2; 2025: 1; 2026: 3.
10 papers.
- 2023Embedding in Recommender Systems: A Surveycited by 19
- 2022Flashlight: Scalable Link Prediction with Effective Decoderscited by 7
- 2022Faster Maximum Inner Product Search in High Dimensionscited by 3
- 2024Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Searchcited by 3
- 2025Probabilistic Kernel Function for Fast Angle Testingcited by 2
- 2022SAH: Shifting-aware Asymmetric Hashing for Reverse k-Maximum Inner Product Searchcited by 1
- 2026Amortized Maximum Inner Product Search with Learned Support Functionscited by 1
- 2024Fuzzy Norm-Explicit Product Quantization for Recommender Systemscited by 0
- 2026RSLM: Training-Free Vector Quantization for Approximate Nearest Neighbor Searchcited by 0
- 2026PQ-HSA: Reusing Product-Quantized Scores for Hybrid Sparse-Approximate Attentioncited by 0
- 2026PQ-HSA: Reusing Product-Quantized Scores for Hybrid Sparse-Approximate Attention27 Sep 2026
- 2026RSLM: Training-Free Vector Quantization for Approximate Nearest Neighbor Search31 Aug 2026
- 2026Amortized Maximum Inner Product Search with Learned Support Functions9 Mar 2026
- 2025Probabilistic Kernel Function for Fast Angle Testing26 May 2025
- 2024Fuzzy Norm-Explicit Product Quantization for Recommender Systems8 Dec 2024
- 2024Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search17 Feb 2024
- 2023Embedding in Recommender Systems: A Survey28 Oct 2023
- 2022Faster Maximum Inner Product Search in High Dimensions14 Dec 2022
- 2022SAH: Shifting-aware Asymmetric Hashing for Reverse k-Maximum Inner Product Search23 Nov 2022
- 2022Flashlight: Scalable Link Prediction with Effective Decoders17 Sep 2022