✳flâneur — a map of the web's best reading
Faiss: A library for efficient similarity search
engineering.fb.com · 2,683 words · saved by 3 readers
Visit the post for more.
By Hervé Jegou , Matthijs Douze , Jeff Johnson This month, we released Facebook AI Similarity Search (Faiss), a library that allows us to quickly search for multimedia documents that are similar to each other — a challenge where traditional query search engines fall short. We’ve built nearest-neighbor search implementations for billion-scale data sets that are some 8.5x faster than the previous reported state-of-the-art, along with the fastest k-selection algorithm on the GPU known in the literature. This lets us break some records, including the first k-nearest-neighbor graph constructe
Explore this link on the map →saved by
related reading
- How We Store and Search 30 Billion Facesclearview.ai
- Welcome to Faiss Documentation - Faiss documentationfaiss.ai
- Indexing 1T vectors · facebookresearch/faiss Wiki · GitHubgithub.com
- Announcing ScaNN: Efficient Vector Similarity Searchai.googleblog.com
- Getting started · facebookresearch/faiss Wiki · GitHubgithub.com
- Introduction to Facebook AI Similarity Search (Faiss) | Pineconepinecone.io
- GitHub - matsui528/faiss_tips: Some useful tips for faiss · GitHubgithub.com
- GitHub - facebookresearch/faiss: A library for efficient similarity search and clustering of dense vectors. · GitHubgithub.com
- Vector embeddings | OpenAI APIplatform.openai.com
- Guidelines to choose an index · facebookresearch/faiss Wiki · GitHubgithub.com
- Lower memory footprint · facebookresearch/faiss Wiki · GitHubgithub.com
- Faster search · facebookresearch/faiss Wiki · GitHubgithub.com