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

arXiv:2609.09854 · cs.DB, cs.IR, cs.LG · Submitted 2026-09-09 · Read on arXiv

cs.DB, cs.IR, cs.LG

Submitted: 2026-09-09

Updated: 2026-09-09

Comments: JMLR-style preprint with theoretical and experimental appendices

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Pruning — 3× in this paper · explained in 4 episodes
• Quantization — 2× in this paper · explained in 12 episodes
• Embeddings — 1× in this paper · explained in 2 episodes
• Vector Representations — 1× in this paper · explained in 2 episodes

Related papers

• Vibe Coding on Trial: Operating Characteristics of Unanimous LLM Juries
• Human-Level Text-to-SQL via Reinforcement Learning on Verified Data, Without Pipeline Engineering
• Bridging Business Intent and Data: A Benchmark for Automatic Relational Data Product Generation
• DexterSQL: Deep Schema Exploration and Rule-based Correction for Text-to-SQL Generation
• MaDI-Bench: An End-to-End Data Integration Benchmark
• Eigenius: A Typed Knowledge-Graph DBMS with Epistemic Stratification and Institution-Mediated Reasoning