New benchmarks for approximate nearest neighbors 2018-02-15 UPDATE(2018-06-17): There are is a later blog post with newer benchmarks! One of my super nerdy interests include approximate algorithms for nearest neighbors in high-dimensional spaces. The problem is simple. You have say 1M points in some high-dimensional space. Now given a query point, can you find the nearest points out of the 1M set?
![New benchmarks for approximate nearest neighbors](https://cdn-ak-scissors.b.st-hatena.com/image/square/f045f188ee4bf92ca37f6de5e5854df19e1d9df9/height=288;version=1;width=512/https%3A%2F%2Ferikbern.com%2Fassets%2Fglove-100-angular.png)