arXiv (All)
open access
RSLM: Training-Free Vector Quantization for Approximate Nearest Neighbor Search
By introducing RSLM (Rotated Scaled Lloyd-Max), a family of training-free vector quantization codecs compressing embeddings to 1--4 bits per dimension, we reduce memory cost and memory bandwidth of a typical large-scale Approximate Nearest Neighbor (ANN) search system, while reducing its complexity
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- When Does Low-Bit Quantization Preserve the Decisions of Vector Search?#996671
- No More K-means: Single-Stage Sparse Coding for Efficient Multi-Vector Retrieval#1128604
- Centering before Pruning: Lightweight Geometry Correction for Diversity-Based Visual Token Pruning in LVLMs#799479
- CAESAR: Clustering via Autonomous Embedding-Space Agglomerative Reorganization#1116901
- Distance Comparison Operations Are Not Silver Bullets in Vector Similarity Search: A Benchmark Study on Their Merits and Limits#2769
Record · ID 799588
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive