Approximate Nearest Neighbor
Approximate Nearest Neighbor — A family of search techniques that trades exact nearest-neighbor guarantees for substantially faster similarity retrieval in high-dimensional vector spaces.
Information-Retrieval Context
Approximate nearest-neighbor search deliberately relaxes exact-neighbor guarantees to reduce latency and memory cost in high-dimensional retrieval. Index parameters in systems such as HNSW or IVF-PQ trade recall against query time, build time, and resident memory.
Evaluation Boundary
ANN results are approximate, so latency alone is not an adequate benchmark. Recall@k, filtering behavior, construction cost, memory use, and the target data distribution must be measured together.
Related Information-Retrieval Concepts
Related technical article: Artificial Intelligence: Philosophy, Theory and Practice.