SOURCE-LINKED INTELLIGENCE

When Does Low-Bit Quantization Preserve the Decisions of Vector Search?

arXiv · AI, language, vision and robotics · article · Sep 9, 2026 · UTC

Low-bit quantization can achieve high recall on some vector representations and fail sharply on others, while average distortion and global rank correlation do not explain the difference. We study quantized vector search at the level of the comparisons consumed by ranking and graph-pruning algorithms. Our first result is a distribution-free decomposition: the probability that a comparison flips is bounded by the probability mass of exact margins near zero plus the tail probability of the calibrated residual. We then account for dependence between residuals that share a query or graph node, and

Read original source ↗ Open in workspace

recordType

paper

region

Global