Post #3287714
2026-06-04 08:15 UTC
@drwho@masto.hackers.town @zwol@masto.hackers.town @reykjalin@social.treehouse.systems @b0rk@social.jvns.ca
Vector search is as good as the vector representation you're using, that's the bit doing the magic. Something like HNSW makes it viable at scale, but that's just a vector index. It's the vector transformation that matters.
It's conceptually much older than the models we're using today. It was even fashionable for classic keyword based search as well (where you translate each term to a 1 bit index and do binary cosine similariy = bitwise AND + popcnt).
Replies (1)
-
@marginalia@mastodon.social 2026-06-04 08:16
@drwho@masto.hackers.town @zwol@masto.hackers.town @reykjalin@social.treehouse.systems @b0rk@social.jvns.ca Though that last bit was largely considered a dead end, it was neat that it was possible to express queries in such a way but it didn't really help in any meaningful way (because the "embedding function" was just a tokenizer).