faiss

Perform k-NN similarity search and clustering on large vector datasets.

Updated May 8, 2026

Search Tags:#GPU acceleration #vector search #similarity search #FAISS #clustering

Ready to run

npx skills add https://github.com/superfhp/lumi-agent --skill faiss-superfhp

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: faiss
Source: https://github.com/superfhp/lumi-agent/tree/main/optional-skills/mlops/faiss
Command: npx skills add https://github.com/superfhp/lumi-agent --skill faiss-superfhp

SYSTEM DOCUMENTATION & REQUIREMENTS

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

What problem does it solve?

This Skill provides fast and efficient similarity search and clustering of dense vectors, ideal for high-performance applications requiring large-scale vector retrieval and similarity search without metadata.

Core Features & Use Cases

Fast Similarity Search: Perform fast k-NN search on large vector datasets (millions/billions).
GPU Acceleration: Utilize GPU acceleration for optimal performance.
Various Index Types: Supports Flat, IVF, HNSW, and Product Quantization index types.
Use Case: Ideal for applications such as image recognition, recommendation systems, and natural language processing.

Quick Start

Use the faiss skill to create an index for your vectors and perform a search.

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 on large-scale vector datasets?▼

Fast similarity search on large-scale vector datasets is achieved by creating indexes like Flat, IVF, HNSW, or Product Quantization to perform efficient k-NN retrieval on millions or billions of dense vectors without metadata.

Does vector search support GPU acceleration for k-NN queries?▼

Yes, GPU acceleration is supported for k-NN vector search queries. It utilizes faiss-gpu dependencies to optimize performance and speed up similarity search and clustering on large-scale dense vector datasets.

What is the best way to cluster dense vectors for recommendation systems?▼

The best way to cluster dense vectors for recommendation systems is using specialized index types like IVF or Product Quantization, which group similar items efficiently for large-scale vector retrieval.

Can I use this for image recognition without storing metadata?▼

Yes, you can use this for image recognition without storing metadata. It provides pure similarity search and clustering for dense vectors, making it ideal for applications requiring fast vector retrieval without metadata.

When should I use HNSW over IVF index types for vector retrieval?▼

Use HNSW over IVF index types for vector retrieval when you need faster query speeds at the cost of higher memory usage, while IVF with Product Quantization offers better memory efficiency for billion-scale datasets.