faiss

Build exact and approximate FAISS similarity search indexes for dense vectors.

3|Updated Apr 4, 2026
One-click install
npx skills add https://github.com/twjarviszyra-web/hermes-unbound --skill faiss-twjarviszyra-web
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: faiss
Source: https://github.com/twjarviszyra-web/hermes-unbound/tree/main/optional-skills/mlops/faiss
Command: npx skills add https://github.com/twjarviszyra-web/hermes-unbound --skill faiss-twjarviszyra-web

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

This Skill helps you build fast, scalable similarity search workflows for dense vectors so you can retrieve the most relevant items from very large embedding collections without manual tuning.

Core Features & Use Cases

  • Exact and Approximate Search: Choose Flat, IVF, HNSW, PQ, or hybrid indices depending on the speed, memory, and accuracy trade-off you need.
  • Large-Scale Retrieval: Support workloads ranging from small prototypes to billion-scale nearest-neighbor search and retrieval-augmented generation pipelines.
  • GPU and Performance Tuning: Use GPU acceleration and index parameters like nprobe, efSearch, and compression settings to optimize real-world latency and recall.
  • Use Case: A team building semantic search for product descriptions can use this Skill to select the right FAISS index, tune it for their dataset size, and integrate it into an embedding-based search service.

Quick Start

Ask for help choosing and configuring a FAISS index for your embeddings, and I will recommend the right setup for your dataset size, accuracy target, and performance constraints.

Frequently Asked Questions about faiss

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

FAQPage Schema
How do I build a similarity search index for dense vectors?

You build a similarity search index by selecting an exact or approximate structure like Flat, IVF, HNSW, or PQ based on your required speed, memory, and accuracy trade-offs for dense vector retrieval.

What is the best way to choose a FAISS index for large-scale nearest-neighbor search?

The best way to choose a FAISS index involves matching your dataset size and accuracy targets, utilizing approximate types like IVF or HNSW for millions of embeddings to balance high-throughput retrieval with low latency.

Can I use GPU acceleration for embedding retrieval?

Yes, you can use GPU acceleration for embedding retrieval to optimize real-world latency, pairing it with tuned search parameters like nprobe and efSearch for high-throughput vector processing.

Does approximate similarity search work for retrieval-augmented generation pipelines?

Approximate similarity search works for retrieval-augmented generation by quickly finding relevant items from large-scale embedding collections, enabling fast context retrieval for generation models.

How do I tune search parameters for high-throughput vector retrieval?

You tune search parameters for high-throughput vector retrieval by adjusting settings like nprobe, efSearch, and compression configurations to optimize the balance between real-world latency and recall.

When should I use exact search instead of approximate nearest neighbors?

Use exact search instead of approximate nearest neighbors when you require perfect accuracy over high-throughput speed, typically choosing Flat indices for smaller datasets where memory constraints are minimal.