FaTRQ: Tiered Residual Quantization for LLM Vector Search in Far-Memory-Aware ANNS Systems
On the map: Retrieval-augmented generation → Vector search and ANN indexes
Abstract (arXiv)
Approximate Nearest-Neighbor Search (ANNS) is a key technique in retrieval-augmented generation (RAG), enabling rapid identification of the most relevant high-dimensional embeddings from massive vector databases. Modern ANNS engines accelerate this process using prebuilt indexes and store compressed vector-quantized representations in fast memory. However, they still rely on a costly second-pass refinement stage that reads full-precision vectors from slower storage like SSDs. For modern text and multimodal embeddings, these reads now dominate the latency of the entire query. We propose FaTRQ, a far-memory-aware refinement system using tiered memory that eliminates the need to fetch full vectors from storage. It introduces a progressive distance estimator that refines coarse scores using compact residuals streamed from far memory. Refinement stops early once a candidate is provably outside the top-k. To support this, we propose tiered residual quantization, which encodes residuals as ternary values stored efficiently in far memory. A custom accelerator is deployed in a CXL Type-2 device to perform low-latency refinement locally. Together, FaTRQ improves the storage efficiency by 2.4× and improves the throughput by up to 9 × than SOTA GPU ANNS system.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Vector search and ANN indexes, one of 15 directions in Retrieval-augmented generation. Builds on 12 of its 37 references that are in the map. First posted on arXiv 15 Jan 2026.
Builds on
12 of 37 references.
References · 12
- 2022LAION-5B: An open large-scale dataset for training next generation image-text modelscited by 4,131
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2024The Faiss librarycited by 370
- 2020SBERT-WK: A Sentence Embedding Method by Dissecting BERT-based Word Modelscited by 55
- 2024RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Searchcited by 46
- 2023CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUscited by 22
- 2024BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPUcited by 14
- 2015Improved Residual Vector Quantization for High-dimensional Approximate Nearest Neighbor Searchcited by 10
- 2024Down with the Hierarchy: The 'H' in HNSW Stands for "Hubs"cited by 3
- 2015Transformed Residual Quantization for Approximate Nearest Neighbor Searchcited by 2
- 2024FusionANNS: An Efficient CPU/GPU Cooperative Processing Architecture for Billion-scale Approximate Nearest Neighbor Searchcited by 1
- 2026SpANNS: Optimizing Approximate Nearest Neighbor Search for Sparse Vectors Using Near Memory Processingcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025From HNSW to Information-Theoretic Binarization: Rethinking the Architecture of Scalable Vector Search
- 20254bit-Quantization in Vector-Embedding for RAG
- 2025SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
- 2024AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
- 2025Gradual Binary Search and Dimension Expansion : A general method for activation quantization in LLMs
- 2026Tailoring the Quantization Space for 1-Bit KV Cache Compression
- 2024Locally-Adaptive Quantization for Streaming Vector Search
- 2025A2ATS: Retrieval-Based KV Cache Reduction via Windowed Rotary Position Embedding and Query-Aware Vector Quantization