kNN methods are broadly not O(n^2)[1], especially in practice where approximate ... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

ivirshup 10 months ago | parent | context | favorite | on: Bad numbers in the “gzip beats BERT” paper?

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

huac 10 months ago [–]

how would you build an index over the gzip encoded data? seems quite different from building indices over vector embeddings.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact