RAG Tuning and Balancing — Embeddings, Weights, Decay and MCP for Advanced Setups
How to steer retrieval on purpose: embedding choice, hybrid weights, reranker cascades, time decay, authority boost, MMR and MCP as a retrieval tool.
in KI-Konzepte
Retrieval-Augmented Generation — Konzepte, Embeddings, Chunking, Reranking.
S-RAG (Search-optimized RAG) is boostN.ai's take on Retrieval-Augmented Generation. It extends classic RAG with search-engine principles: relevance ranking, recency decay and typed links between chunks for deterministic follow-up retrieval.
Agentic RAG is a RAG architecture in which an agent drives retrieval — it decomposes the question, searches iteratively, checks the hits, and decides itself whether a second or third pass is needed.
Chunking is the splitting of longer texts into smaller, self-contained pieces — the first step of any RAG pipeline because embeddings and retrieval work at the chunk level.
Contextual Retrieval is an Anthropic RAG technique that prepends an LLM-generated context sentence to every chunk before indexing — sharply raising retrieval quality.
Cosine similarity measures how similar two vectors are by the angle between them — the default metric in RAG retrieval for comparing query embeddings against the embeddings stored in a vector index.
GraphRAG is a RAG variant that uses a knowledge graph in addition to vector search — answers come from linked entities and relationship paths, not just similar text.
Hybrid search combines lexical full-text search (e.g. BM25) with semantic vector search and unites the strengths of both — precise on keywords and robust on meaning.
HyDE (Hypothetical Document Embeddings) is a RAG technique where an LLM first drafts a fake answer to a query — and then uses that answer's embedding to find real documents.
Query expansion enriches the original query in a RAG pipeline with synonyms, reformulations or hypothetical answer texts in order to lift retrieval recall.
Reranking reorders an already-retrieved list of hits with a more accurate model — typically a cross-encoder that scores query and each candidate together, instead of just comparing vector distances.
Semantic search retrieves content by meaning rather than exact word match — query and documents are compared as embeddings, so synonyms and paraphrases also hit.
A vector database stores embeddings as high-dimensional vectors and searches them by semantic similarity — the core infrastructure for RAG, semantic search, and recommendation systems.
How to steer retrieval on purpose: embedding choice, hybrid weights, reranker cascades, time decay, authority boost, MMR and MCP as a retrieval tool.
How a RAG pipeline works: embedding, vector DB, retrieval, reranking, prompt — and which pitfalls show up in practice.
Anthropic opens the research preview of Dynamic Workflows in Claude Code: up to 1,000 subagents per run that adversarially review each other.