Paper ID: 2307.01170

Online nearest neighbor classification

Sanjoy Dasgupta, Geelon So

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.

Submitted: Jul 3, 2023