Online nearest neighbor classification

07/03/2023

∙

We study an instance of online non-parametric classification in the realizable setting. In particular, we consider the classical 1-nearest neighbor algorithm, and show that it achieves sublinear regret - that is, a vanishing mistake rate - against dominated or smoothed adversaries in the realizable setting.

READ FULL TEXT

Online nearest neighbor classification

A Note on Approximate Nearest Neighbor Methods

Geometric Algorithms for k-NN Poisoning

Prediction of Success or Failure for Final Examination using Nearest Neighbor Method to the Trend of Weekly Online Testing

Non-Parametric Temporal Adaptation for Social Media Topic Classification

Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions

Mass Classification Method in Mammogram Using Fuzzy K-Nearest Neighbour Equality

Out-of-distribution Detection with Deep Nearest Neighbors

Online nearest neighbor classification

Related Research

A Note on Approximate Nearest Neighbor Methods

Geometric Algorithms for k-NN Poisoning

Prediction of Success or Failure for Final Examination using Nearest Neighbor Method to the Trend of Weekly Online Testing

Non-Parametric Temporal Adaptation for Social Media Topic Classification

Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions

Mass Classification Method in Mammogram Using Fuzzy K-Nearest Neighbour Equality

Out-of-distribution Detection with Deep Nearest Neighbors