Research map / Learning theory and algorithms / Prediction and decision losses
Approximate Nearest Neighbor Search through Modern Error-Correcting Codes
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.
Closest papers by meaning
- Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond (NeurIPS 2019 · similarity 0.88)
- Learning to Hash Robustly, Guaranteed (ICML 2022 · similarity 0.88)
- K-Nearest Neighbors Hashing (CVPR 2019 · similarity 0.87)
- Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search (NeurIPS 2022 · similarity 0.87)
- Learning Space Partitions for Nearest Neighbor Search (ICLR 2020 · similarity 0.87)
- Discovering Data Structures: Nearest Neighbor Search and Beyond (NeurIPS 2025 · similarity 0.85)
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.
