- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes BaMIC, a budget-aware compression method for multi-vector visual document retrieval. The key insight is that preserving document-side vector coverage is more important than maintaining high numerical precision under limited storage budgets. Accordingly, BaMIC retains all patch embeddings, applies rate-adaptive quantization, and introduces geometry-calibrated scoring (nADC) to mitigate norm distortion under aggressive compression. Experiments across multiple benchmarks and vision-language backbones demonstrate improved storage–accuracy trade-offs over pruning, merging, and conventional quantization methods, retaining 94.1% of full-precision Hit@1 with ColQwen3.5 at 64× compression.
Critical strengths
- The paper provides a useful perspective on multi-vector index compression by highlighting the importance of preserving matching opportunities over numerical precision. The decomposition of compression errors into support, directional, and radial distortion offers a clear explanation of why different compression strategies affect retrieval performance differently.
- The paper evaluates BaMIC across multiple benchmarks, vision-language backbones, and compression ratios, with comparisons against pruning, merging, and quantization methods. The results demonstrate strong storage–accuracy trade-offs, particularly under aggressive compression. The ablation studies further support the effectiveness of geometry-calibrated scoring.
Critical weaknesses
-
Limited methodological novelty. BaMIC primarily combines existing quantization techniques (SQ, PQ, and OPQ) with vector normalization. Although the empirical observations are interesting, the proposed nADC is relatively straightforward, and its distinction from existing normalized similarity computation methods is not sufficiently established. This raises concerns about the novelty of the technical contribution.
-
Limited generality and practical efficiency. The coverage-first strategy is not consistently optimal, as the joint allocation experiments in Appendix C show that retaining fewer vectors with higher precision can outperform full-support compression under extreme storage constraints. Moreover, BaMIC preserves all document vectors and provides little improvement in query latency, limiting its practical benefits beyond storage reduction.
Questions for authors
See Critical Weaknesses.
Thank you for the thorough rebuttal and the additional experiments. I will keep my original rating.