Research map / Graph learning / Graph algorithms and clustering
A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use the property tester to screen ANN indices before downstream processing | ANN indices from KGraph, hnsw, and SW-graph · ANN index testing | testing time relative to index build time: mostly even smaller than 1/10 of the build time | Helped |
| Set c1 = 0.01 and c2 = 5 (ablation) | Property tester · ANN indices 0.005-far to 0.01-far from a 10-NN graph | tester recall: more than 95% | Helped |
| Increase k from 10 to 50 (ablation) | Property tester on KGraph indices · KGraph indices | error detection | Helped |
Closest papers by meaning
- On Class Distributions Induced by Nearest Neighbor Graphs for Node Classification of Tabular Data (NeurIPS 2023 · similarity 0.88)
- Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits (NeurIPS 2024 · similarity 0.85)
- Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs (ICML 2025 · similarity 0.85)
- Graph-Based Algorithms for Diverse Similarity Search (ICML 2025 · similarity 0.84)
- KNN Implementation Details Can Dramatically Change Performance: An Example from Cover Trees (NeurIPS 2026 · similarity 0.84)
- Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search (ICML 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.