HNSW creates a multi-layered graph for the vectors. A search query navigates the layers (or zoom levels) to find the nearest neighbours. This requires longer indexing times and more memory but outperforms IVFFlat in speed-recall metrics.
IVFFlat divides the vectors in clusters. While querying, the clusters closest to the search vector are chosen. It's a straight-forward implementation promising faster indexing times and less memory usage.
I'm using pgvector with postgres for Exhibit AI. I now have to choose an indexing method between IVFFlat and HNSW for the VectorField.
New blog post: Announcing Exhibit AI
- Then they imitate, remix and repeat.
- Finally, they share their version with the intended tribe.
Depending on how remarkable the work is, the tribe loves it, hates it or worse, ignores it.
Creators try to reverse engineer this.
- They choose a tribe — movie lovers that love mindless action (or mind-bending sci-fi thrillers).
- Then they breakdown and analyse things that the tribe loves already.
Tribes form on the extreme ends of the spectrum.
You talk about something passionately when you love it, or hate it.
Some items immediately grab your attention (without your effort). They are on the far ends of the spectrum.
With repeat exposure or closer inspection, your emotion grows and solidifies.
Imagine a song from Ilaiyaraja or ARR.
In the spectrum of taste (from good to bad), items in the middle are mostly neutral and invisible.
Upon deliberate observation, some may shift left (good) or right (bad).
What is taste?
It’s the emotion that people feel when exposed to something — art, music, cinema, books, architecture, etc.
The emotion can be good, bad or neutral.