Research map / Architectures and efficiency / Quantization
AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding
Artem Babenko, Victor Lempitsky
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Distance Encoded Product Quantization for Approximate K-Nearest Neighbor Search in High-Dimensional Space (TPAMI 2018 · similarity 0.88)
- Qinco2: Vector Compression and Search with Improved Implicit Neural Codebooks (ICLR 2025 · similarity 0.86)
- LittleBit: Ultra Low-Bit Quantization via Latent Factorization (NeurIPS 2025 · similarity 0.84)
- Random Cycle Coding: Lossless Compression of Cluster Assignments via Bits-Back Coding (NeurIPS 2024 · similarity 0.84)
- Compression of Structured Data with Autoencoders: Provable Benefit of Nonlinearities and Depth (ICML 2024 · similarity 0.84)
- Network Memory Footprint Compression Through Jointly Learnable Codebooks and Mappings (ICLR 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
