Omar Khattab
@lateinteraction.bsky.social
Incoming asst professor at MIT EECS, Fall 2025. Research scientist at Databricks. CS PhD @StanfordNLP.bsky.social. Author of ColBERT.ai & DSPy.ai.
FAISS is a really neat library of algorithms, e.g. IVFPQ. I wouldn't think of it as conceptually separate, it's just a way to go from query embeddings -> (possibly sub-linear, depending entirely on the choices of algorithm & hyperparameters) number of candidate document embeddings -> scoring.
January 4, 2025 at 7:46 PM
FAISS is a really neat library of algorithms, e.g. IVFPQ. I wouldn't think of it as conceptually separate, it's just a way to go from query embeddings -> (possibly sub-linear, depending entirely on the choices of algorithm & hyperparameters) number of candidate document embeddings -> scoring.
Some quotes from page 8 of the PLAID paper.
January 4, 2025 at 7:02 PM
Some quotes from page 8 of the PLAID paper.
My gut feeling is that this part seems increasingly (implicitly) true in some ML areas now. Right?
November 24, 2024 at 3:12 AM
My gut feeling is that this part seems increasingly (implicitly) true in some ML areas now. Right?