k-Nearest Neighbors

Also known as KNN

Overview

k-Nearest Neighbors methods make predictions or retrieve examples by comparing a query with nearby observations, supporting classification, regression, clustering, and graph learning. Approaches include fixed or weighted neighbor sets, adaptive neighborhood sizes and radii, learned or geometry-aware distances, neighborhood graphs, conformal uncertainty estimates, and exact or approximate search indexes. Research studies consistency and convergence under settings such as dependent data, and evaluates methods on image, graph, time-series, and high-dimensional embedding tasks. A central challenge is that neighborhood quality depends on the representation and distance, especially in high dimensions, while speed, robustness, and reliable uncertainty can call for different design choices.

Latest papers

CardsList

34 papers9 papers in the last four weeks, up 125% on the four weeks before. 0.1% of all new papers.

  1. DANCE: Doubly Adaptive Neighborhood Conformal Estimation

    Feb 24, 2026Brandon R. Feng, Brian J. Reich, Daniel Beaglehole +7Conformal PredictionClassification

  2. GICDM: Mitigating Hubness for Reliable Distance-Based Generative Model Evaluation

    Feb 18, 2026Nicolas Salvy, Hugues Talbot, Bertrand ThirionGenerative AI Evaluationk-Nearest Neighbors

  3. Conformal and kNN Predictive Uncertainty Quantification Algorithms in Metric Spaces

    Jul 21, 2025Gábor Lugosi, Marcos MatabuenaConformal Predictionk-Nearest Neighbors