Choosing Indexes for Similarity Search (Faiss in Python)

preview_player
Показать описание
Facebook AI Similarity Search (Faiss) is a game-changer in the world of search. It allows us to efficiently search a huge range of media, from GIFs to articles - with incredible accuracy in sub-second timescales for billion+ size datasets.

The success in Faiss is due to many reasons. One of those, in particular, is its flexibility. Faiss recognizes that there is no 'one-size-fits-all' in similarity search.

Instead, Faiss comes with a wide range of search indexes - which we can mix and match to our choosing.

However, this great flexibility produces a question - how do we know which size fits our use case?

Which index do we choose? Should we use multiple indexes, or is one enough?

This video will explore the pros and cons of some of the most important indexes - Flat, LSH, HNSW, and IVF. We will learn how we decide which to use and the impact of parameters in each index to build some of the best indexes for semantic search.

🌲 Pinecone Article:

🎉 Sign-up For New Articles Every Week on Medium!

Download script for Sift1M dataset:

Similarity Search Series:

🤖 70% Discount on the NLP With Transformers in Python course:

👾 Discord

Mining Massive Datasets Book (Similarity Search):

🕹️ Free AI-Powered Code Refactoring with Sourcery:
Рекомендации по теме
Комментарии
Автор

Thanks a bunch for this, James! Would be really great to see a couple of them get explored in depth. Also, if you could benchmark FAISS against ScaNN, it will help a few of us noobs a hell lot.

Great content! Lovely command over your content. Really need more of this.

narayansharma
Автор

Great explanations, especially for IVF - it's probably the best explanation for how it works that I've seen.

Nick-vszp
Автор

Super Informative Content!
Thank you so much for this.

harshitjaitly
Автор

Hi James.

Thanks for such a wonderful tutorial. Really useful. A quick question, For a new query vector, is it possible to return the IVF cell/partition that it belongs to, instead of returning the neighbors? I think I can measure the distances with centroids and return the closest centroid. However, I was thinking if there is built-in way.

grayrigel
Автор

Thank you for your video. Most Valuable Channel. Do you use GPU for indexing in this projects?

katehan
Автор

Thanks for amazing video! Do you know why simple K-means are not used for these MIPS problems?

haneulkim
Автор

Does the IVF algorithm works with high dimensional data please like 100?

mohammadyahya
Автор

Super useful! Thanks for this video James. For IVF, can we retrieve the clusters that each datapoint belongs to after training (also cluster centroids)?

itheenigma
Автор

Can share the video assume I have binary data of train and test, so need to calculate the haming distance, I didn't found any videos using faiss, if share the video that may more helpful

nareshsandrugu