RAG and Vector Search

Embedding Model Selection

Matryoshka Embeddings

Models like text-embedding-3-large support dimension reduction: truncate vectors to 256/512/1024 dims with minimal quality loss. Reduces storage 3-12x. Test recall at target dimension before committing.

Never mix embedding models in the same index -- vectors from different models are incompatible.

Chunking Decisions

• •Chunk size: 500-1000 tokens default; smaller for precision, larger for context
• •Overlap: 10-20% to avoid losing boundary context
• •Always test chunk size impact on retrieval quality for your specific corpus

Distance Metrics

Index Selection by Scale

HNSW Tuning

Higher M = better recall but more memory. Memory per vector: dimensions * bytes_per_dim + M * 2 * 4 bytes.

Vector Database Selection

Retrieval Architecture

Hybrid Search (Preferred for Production)

Combine dense (vector) + sparse (BM25/FTS) retrieval. Two fusion approaches:

• •RRF (Reciprocal Rank Fusion): Works well without tuning, robust default. Score = sum of 1/(k + rank) across result lists, k=60.
• •Linear combination: More control but requires tuning alpha. Normalize scores before combining.

Reranking (Always Worth It)

• •Retrieve 20-50 candidates with hybrid search
• •Rerank with cross-encoder (e.g., cross-encoder/ms-marco-MiniLM-L-6-v2)
• •Cohere Rerank API: managed option, supports rerank-english-v3.0 and multilingual
• •ColBERT / late-interaction: token-level matching, better for long documents than bi-encoder reranking
• •Return top 3-5 to LLM
• •For diversity: use MMR (lambda_mult=0.5 balances relevance vs diversity)

pgvector + FTS Pattern

Store embeddings and tsvector in same table. Use CTE with RRF to combine vector similarity rank and text search rank in a single query.

Advanced RAG Patterns

GraphRAG

Build knowledge graph from documents, then traverse graph relationships during retrieval. Best for corpora with rich entity relationships (legal, biomedical, enterprise docs). Use with Neo4j or networkx.

Contextual Retrieval (Anthropic Pattern)

Prepend chunk-specific context before embedding: "This chunk is from section X of document Y and discusses Z." Improves retrieval by 20-67% on benchmarks. Compute once at index time.

Proposition-Based Chunking

Decompose documents into atomic propositions ("The Eiffel Tower is in Paris", "It was completed in 1889") instead of fixed-size chunks. Better precision for fact-lookup tasks. Higher indexing cost.

Late Chunking

Embed the full document first (using long-context model), then pool token embeddings into chunks. Preserves cross-chunk context that gets lost with chunk-then-embed.

RAG Pipeline Opinions

Retrieval

• •Multi-query retrieval: generate 3-5 query variations for better recall on ambiguous questions
• •Parent document retriever: index small chunks, return parent context to LLM
• •Contextual compression: extract only relevant portions from retrieved docs before sending to LLM
• •Metadata filtering: always index source, timestamp, category; filter at query time to reduce noise

Generation

• •Always include citation markers ([1], [2]) in prompt template
• •Ask for confidence score; instruct model to say "I don't have enough information" when context is insufficient
• •Evaluate groundedness: NLI-based check that response is entailed by retrieved context

Evaluation Metrics

• •Retrieval: Precision@K, Recall@K, MRR, NDCG
• •Generation: Groundedness (NLI), faithfulness, answer relevance
• •Test retrieval and generation independently; don't just evaluate end-to-end

Quantization Tradeoffs

Memory Estimation

total_bytes = num_vectors * (dimensions * bytes_per_dim + M * 2 * 4)

Example: 1M vectors, 1536 dims, FP32, M=16 = ~6.1 GB vectors + ~128 MB index overhead.

Cross-References

• •ai-ml:llm-application-patterns -- prompt engineering, agent patterns, production deployment
• •ai-ml:structured-output-patterns -- extracting structured data from retrieved documents
• •ai-ml:embedding-and-representation-learning -- embedding models, fine-tuning for retrieval