I'm curious to if this result will extend to the k-nearest neighbors (k-NN) algorithms. Two problems that have to do with k-NN are 1. It's a non-parametric me

I'm curious to if this result will extend to the k-nearest neighbors (k-NN) algorithms. Two problems that have to do with k-NN are 1. It's a non-parametric method: the number of parameters grow linearly with the size of the training set since the distance function must be calculated for all training points and the test point. 2. The curse of dimensionality: distance metrics like the Euclidean distance do not perform well in higher dimensions; points which seem "close" in 2D may be far in 3D, 4D, etc. As a result, we would need an exponential amount of more training data for every additional dimension. Locality sensitive hashing tries to combat this by reducing the dimensionality of the data.