faiss

Builds and queries optimized FAISS indexes for fast k-NN similarity search on dense vectors.

Updated May 26, 2026
One-click install
npx skills add https://github.com/ruiyangruiyi/hermes-agent --skill faiss-ruiyangruiyi
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: faiss
Source: https://github.com/ruiyangruiyi/hermes-agent/tree/main/optional-skills/mlops/faiss
Command: npx skills add https://github.com/ruiyangruiyi/hermes-agent --skill faiss-ruiyangruiyi

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires faiss-cpu, faiss-gpu, numpy, and includes references (resource) components.

What problem does it solve?

FAISS solves the problem of performing fast similarity search over large collections of embedding vectors, enabling quick retrieval of the most similar items without scanning the entire dataset.

Core Features & Use Cases

  • Efficient vector similarity search: Perform k-NN search using exact or approximate indexes built for high throughput.
  • Scalable indexing strategies: Use index types like Flat (exact), IVF (approximate clustering), HNSW (high-quality graph), and PQ (memory-efficient compression).
  • GPU acceleration & integrations: Run on CPU or GPU for speed, and integrate with ecosystems like LangChain and LlamaIndex for production RAG pipelines.

Quick Start

Install the FAISS CPU or GPU package and then create a FAISS index (e.g., IndexFlatL2) to add your float32 embedding vectors and query it for k nearest neighbors.

Frequently Asked Questions about faiss

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I perform fast similarity search over billions of dense vector embeddings?

Perform fast similarity search by building optimized FAISS indexes like Flat, IVF, HNSW, or PQ. FAISS enables quick k-NN nearest neighbor retrieval over large collections of float32 embedding vectors without scanning the entire dataset.

What's the best way to choose a FAISS index type for my vector search needs?

Choose a FAISS index type based on your latency, accuracy, and memory needs: Flat for exact search, IVF for approximate clustering, HNSW for high-quality graph search, or PQ for memory-efficient compression across billions of dense vectors.

Does FAISS support GPU acceleration for billion-scale k-NN search?

Yes, FAISS supports GPU acceleration. You can run similarity search and clustering on CPU or GPU to achieve high throughput and optimize k-NN nearest neighbor lookup latency across millions to billions of dense vector embeddings.

Can I integrate FAISS vector search with LangChain and LlamaIndex for RAG pipelines?

Yes, FAISS integrates with LangChain and LlamaIndex. You can use FAISS indexes as vector stores to perform similarity search and retrieve recommendation candidates within production retrieval-augmented generation (RAG) pipelines.

Why do my FAISS vectors need to be formatted as float32 for similarity search?

FAISS requires correct float32 vector formatting to build and query optimized indexes efficiently. Ensuring dense embedding vectors are properly formatted as float32 maintains compatibility and accuracy during k-NN search operations.

How do I tune FAISS search parameters for the right latency and accuracy trade-off?

Tune FAISS search parameters by selecting an appropriate index type and adjusting query settings. Balancing these parameters allows you to control the trade-off between search latency and accuracy for approximate or exact similarity search.