2 ms·
The case in which semantic similarity is encoded by Euclidean distance, and you want to perform similarity search (retrieve the nearest neighbors).
by esafak 3y ago
The case in which semantic similarity is encoded by Euclidean distance, and you want to perform similarity search (retrieve the nearest neighbors).
- Solvency 3y agoBut in a model like the article examples with 1500+ dimensions doesnt Euclidean distance suffer the "curse of dimensionality", making it unusable for similarity searches?
- esafak 3y agoThat is my understanding. But then again, the angle between of two random points in a high dimensional unit hypercube is 90, so cosine similarity is suspect too. High dimensional spaces are weird like that. https://martin-thoma.com/curse-of-dimensionality/ https://martin-thoma.com/curse-of-dimensionality/