atlas

Research map / Architectures and efficiency / RNNs and normalization

Efficient Large-Scale Approximate Nearest Neighbor Search on the GPU

CVPR 2016 · Architectures and efficiency › RNNs and normalization · approach: Learned embeddings for retrieval · 59 citations (OpenAlex)

Check your idea against 108,967 papers

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the two-level Product Quantization Tree instead of IVFADCANN search · GIST1MR@100: 0.744 -> 0.83Helped
Use the two-level Product Quantization Tree instead of IVFADCANN search · GIST1Maverage query time (ms): 65.9 -> 63Hurt
Use PQT on GPU instead of FLANN on CPUANN search · SIFT1Mquery time (ms): 5.32 -> 0.02Helped
Add exact re-ranking to PQT1 (ablation)PQT1 (CPU) · SIFT1Mquery time (ms): 4.89 -> 5.74Hurt
Increase line-quantization parts (ablation)PQT · SIFT1MrecallHelped
Increase line-quantization parts (ablation)PQT · SIFT1Mquery time (ms): 3, 4, 6, 9msHurt
Use an anisotropic rather than naive isotropic bin traversal heuristic (ablation)PQT · bin proposalnumber of bins to reach ordering: 10 bins -> 8 binsHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy