atlas

Research map / Learning theory and algorithms / Prediction and decision losses

An algorithm for L1 nearest neighbor search via monotonic embedding

NeurIPS 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Approximate nearest neighbor indexing · 1 citations (OpenAlex)

Read the paperCheck 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
Replace Cauchy random projection LSH with ERP (l1 to l2^2 embedding + Gaussian projection) LSHLSH for l1 NN search · Corel uci, Corel hist, Cade, ImageNetaverage query costMixed
ERP-LSH vs Cauchy LSH (CRP-LSH)Cade dataset (d=120) · Cadeaverage query cost: 218 vs 292Helped
ERP-LSH vs Cauchy LSH (CRP-LSH)ImageNet dataset (d=100) · ImageNetaverage query cost: 346 vs 548Helped
ERP-LSH vs metric tree for exact searchLSH-based l1 NN search · Corel uci, Corel hist, Cade, ImageNetaverage query cost: ERP-LSH well below metric tree on Cade (218 vs 9184) and ImageNet (346 vs 12375); metric tree is better on Corel uci (25Helped
Gaussian random projection of l1-embedded data (ERP) vs linear scanLSH for l1 NN search · all four datasetsaverage query cost: e.g. 218 vs 11715 on CadeHelped

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