6 ms·
kNN methods are broadly not O(n^2)[1], especially in practice where approximate methods are used. [1]: https://en.wikipedia.org/wiki/Nearest_neighbor_search ht
by ivirshup 3y ago
kNN methods are broadly not O(n^2)[1], especially in practice where approximate methods are used.
[1]: https://en.wikipedia.org/wiki/Nearest_neighbor_search https://en.wikipedia.org/wiki/Nearest_neighbor_search
- huac 3y agohow would you build an index over the gzip encoded data? seems quite different from building indices over vector embeddings.