ProV Logo
0

Near-optimal sample compression for near...
Gottlieb, Lee-Ad...
Near-optimal sample compression for nearest neighbors by Gottlieb, Lee-Ad ( Author )
Australian National University
01-09-2023
We present the first sample compression algorithm for nearest neighbors with non-trivial performance guarantees. We complement these guarantees by demonstrating almost matching hardness lower bounds, which show that our bound is nearly optimal. Our result yields new insight into margin-based nearest neighbor classification in metric spaces and allows us to significantly sharpen and simplify existing bounds. Some encouraging empirical results are also presented.
-
Article
pdf
29.34 KB
English
-
MYR 0.01
-
http://arxiv.org/abs/1404.3368
Share this eBook