- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes VENICE, a geometry-preprocessing framework for retrieval-aware vector quantization. It formulates MIPS quantization error as an H-weighted quadratic form and introduces spectral decorrelation, reverse water-filling bit allocation, sensitivity equalization with local rotations, and norm restoration. The method is designed to work with different base quantizers without additional training. Experiments on multiple datasets and quantizers demonstrate improvements in retrieval quality, supported by ablation studies.
Critical strengths
- The paper identifies a clear and practically relevant mismatch between standard reconstruction error and retrieval quality. The query-aware distortion derived from the query second-moment matrix provides a principled motivation for the proposed design.
- Separating geometry preprocessing from the base quantizer is an interesting idea. The four components form a coherent pipeline and can be applied to both learned and training-free quantizers without additional learned parameters.
- The experimental evaluation is broad, covering multiple datasets, quantizers, and bit rates, with useful ablation studies. The limited gains on near-isotropic GloVe data are also consistent with the paper's motivation and provide a useful check of the proposed approach.
Critical weaknesses
- The mapping from coordinate-wise bit allocation to practical quantizer configurations (especially PQ and CAQ) is insufficiently explained, and the total storage cost including side information is not clearly accounted for.
- The reverse water-filling relies on a high-resolution approximation that may be inaccurate at 1–2 bits. Comparisons with allocation based on actual quantizer distortion are missing.
- The link between H-weighted distortion and ranking/top-k recall is not fully established. Robustness to query distribution shift and sensitivity to norm precision are also under-explored.
Questions for authors
- How is the coordinate-wise bit allocation translated into concrete configurations for PQ, CAQ, and similar quantizers? How is the total storage cost calculated?
- How does reverse water-filling compare with allocation strategies based on the actual distortion of the base quantizer at low bit rates?
- Can the authors better connect the H-weighted distortion to ranking errors, and evaluate robustness under query distribution shift?
- Do the gains hold under matched storage budgets and realistic latency? How sensitive is performance to the norm precision f?
3 comments
Dear reviewer, thanks for your questions and suggestions. As the discussion period ends tomorrow, we would be grateful if you could take a look at our updates and let us know if there is something missing we could still help to clarify. Thanks a lot!
Thank you for the detailed response. My concerns have been adequately addressed, and I am happy to raise my score.
We thank the reviewer for the thorough feedback. We expanded the paper with explicit tier-mapping and byte-accounting specifications (Section 5.1, Appendix E), an empirical allocation study using true codec distortion (Appendix F), a theoretical and empirical link from $ e^T He $ to top-k ranking under query shift (Section 5.2, Appendix H), and end-to-end latency benchmarks (Appendix I).
Plotting Recall@10@10 loss against exact total bytes per vector (all metadata included) shows VENICE lies strictly below standalone codecs and SAQ across the entire storage–accuracy Pareto frontier (Figure 7)—for instance, VENICE at 2 bits routinely outperforms standalone codecs at 4 bits (~2 fewer total bytes).
Fusing projection onto the m≤d surviving coordinates with tier rotations into a single int8 SIMD matrix vector product reduces query overhead to O(md). On high-dimensional scans (d≥1536 , N=106), scan savings from coordinate pruning and lower bit-rates outweigh preprocessing, making VENICE faster end-to-end at matched recall than both FWHT-based RaBitQ and SAQ. Conversely, for short candidate rescoring (N=104) and low-d BigANN (d=128), VENICE is ∼ 2 × slower at equal bit-rate because reference SIMD kernels optimize multiples of 64 dimensions, whereas VENICE's unrestricted tiers have arbitrary lengths (e.g., 8, 104, 16 at 4 bits)—highlighting a clean accuracy-vs.-SIMD-alignment tradeoff at small d.
Storing the active-coordinate norm in f=16 bits matches 32-bit fp32 recall at half the metadata cost. As demonstrated in recent studies on norm-corrected codecs (https://arxiv.org/abs/2608.30384 section 3.3.1), 16-bit floating-point formats with sufficient mantissa precision (fp16 / UE7M9, 9–10 mantissa bits) are indistinguishable from fp32 for MIPS ranking, whereas 7-mantissa-bit bf16 degrades top-k recall.