Module 1: Foundations of AI Engineering Retrieval Basics

Retrieval Fundamentals

In this lesson we'll build the simplest possible retrieval pipeline, stress-test it, and see exactly where it breaks. That hands-on experience with failure modes is what makes the rest of the retrieval curriculum click. You'll know what problems you're solving before we introduce more sophisticated tools.

We're deliberately building something naive here. The goal isn't a production retrieval system. It's building your intuition for what goes wrong when retrieval is too simple, so you don't learn the wrong lesson that "embeddings + vector DB = done."

What you'll learn

  • Build a minimal embedding-based search over a small text corpus
  • Explain what chunking is and why chunk boundaries affect retrieval quality
  • Compare vector search against lexical search on the same queries
  • Use metadata filters to narrow retrieval results
  • Identify the specific failure modes of naive retrieval
  • Write a Retrieval Lab Notes documenting what broke and why

Concepts

Retrieval: the process of finding relevant information from a corpus to include in the model's context. Retrieval is a pattern, not a specific technology. It can be powered by vector search, lexical search, metadata filters, structural indexes, or any combination. The goal is always the same: select the right evidence for the current task.

Embedding: a fixed-length numeric vector representing a piece of text. Texts with similar meanings have nearby embeddings in vector space. You generate embeddings using an embedding model (from OpenAI, Gemini, Hugging Face-hosted providers, Ollama/open-weight models, or another embedding provider), then compare them using distance metrics like cosine similarity.

Vector search: finding the most similar embeddings to a query embedding. You embed the query, compare it against all stored embeddings, and return the closest matches. This is the most common retrieval method in AI systems, and also the most overused when simpler methods would suffice.

Chunking: splitting a document into smaller pieces before embedding. The model's context window is limited, so you cannot retrieve whole documents. How you split matters: chunks that break in the middle of a function, a paragraph, or a logical unit produce bad retrieval results. Chunk boundaries are one of the most common sources of retrieval failure.

Lexical search: finding documents by keyword matching rather than semantic similarity. BM25 is the most common lexical ranking function. Lexical search excels at exact terms, identifiers, and names, cases where vector search often fails because the embedding does not capture the exact string.

Metadata filters: narrowing retrieval results using structured attributes (file path, language, author, date, symbol type) before or after similarity search. Metadata filters are cheap and often more effective than improving the embedding model.

Reranking: a second-pass scoring step that re-orders retrieved results using a more expensive model. The first retrieval pass (vector or lexical) casts a wide net; the reranker picks the best results from that net. Reranking improves precision without changing your index.

RAG (Retrieval-Augmented Generation): a pattern where the model's response is grounded in retrieved evidence rather than relying solely on its training data. RAG is not a database. RAG is not a vector store. RAG is the pipeline: retrieve evidence, package it into context, and generate an answer that stays grounded in what was retrieved. The retrieval step can use any method: vector, lexical, structural, or hybrid.

Walkthrough

Project setup

Provider choice is per capability, not just one global vendor choice. Using one provider for generation and another for embeddings is normal. See Choosing a Provider for the platform distinctions and mixing rules.

Create a retrieval lab as a standalone sidecar project. Pick your provider tab for the setup and embeddings function. Everything else in the lab stays the same regardless of provider.

OpenAI Platform is the most direct path for this lab. The embeddings API is straightforward and well-documented.

mkdir retrieval-lab && cd retrieval-lab
python -m venv .venv && source .venv/bin/activate
pip install openai rank-bm25 numpy
export OPENAI_API_KEY="sk-..."

Create a small sample corpus. Make a corpus/ directory with 3-4 short markdown files:

mkdir corpus
<!-- corpus/api-server.md -->
# API Server

The development server runs on port 8000 by default.
Use `uvicorn app:app --reload` to start it.

## Authentication
Users authenticate via JWT tokens passed in the Authorization header.
The `verify_token` middleware validates tokens on every request.

## Authorization
Authorization is role-based. Roles are: admin, editor, viewer.
The `check_permission` decorator enforces role checks on endpoints.
<!-- corpus/webhooks.md -->
# Webhooks

## process_webhook function
The `process_webhook` function validates incoming webhook payloads,
verifies the HMAC signature, and dispatches to the appropriate handler.

It accepts a `WebhookEvent` Pydantic model and returns a `ProcessResult`.

## Retry policy
Failed webhook deliveries are retried 3 times with exponential backoff.
The retry queue is stored in Redis.
<!-- corpus/deployment.md -->
# Deployment

## Docker
Build with `docker build -t myapp .`
The Dockerfile uses a multi-stage build for smaller images.

## Environment variables
- `DATABASE_URL`: PostgreSQL connection string
- `REDIS_URL`: Redis connection string
- `SECRET_KEY`: JWT signing key (required, no default)

Build the simplest possible retrieval pipeline

Create retrieval.py by copying the full file from your provider tab:

# retrieval.py
import numpy as np
from openai import OpenAI
from pathlib import Path
from rank_bm25 import BM25Okapi

client = OpenAI()


def embed_texts(texts):
    """Generate embeddings for a batch of texts.

    Args:
        texts: Query or chunk texts to embed.

    Returns:
        A list of embedding vectors in the same order as the input texts.
    """
    response = client.embeddings.create(
        model="text-embedding-3-small",
        input=texts,
    )
    return [item.embedding for item in response.data]


# --- Step 1: Load and chunk the corpus ---

def load_corpus(corpus_dir="corpus"):
    """Load markdown files from disk and split them into naive chunks.

    Args:
        corpus_dir: Directory containing the markdown corpus to index.

    Returns:
        A list of chunk dictionaries with text, source filename, and chunk index.
    """
    chunks = []
    for path in sorted(Path(corpus_dir).glob("*.md")):
        text = path.read_text()
        # Naive chunking: split into ~300-char pieces with overlap
        words = text.split()
        chunk_size = 50  # words per chunk
        overlap = 10
        for i in range(0, len(words), chunk_size - overlap):
            chunk_text = " ".join(words[i : i + chunk_size])
            if chunk_text.strip():
                chunks.append({
                    "text": chunk_text,
                    "source": path.name,
                    "chunk_index": len(chunks),
                })
    return chunks


def cosine_similarity(a, b):
    """Compute cosine similarity between two embedding vectors.

    Args:
        a: First embedding vector.
        b: Second embedding vector.

    Returns:
        Cosine similarity score between the two vectors.
    """
    a, b = np.array(a), np.array(b)
    return np.dot(a, b) / (np.linalg.norm(a) * np.linalg.norm(b))


# --- Step 3: Vector search ---

def vector_search(query, chunks, chunk_embeddings, top_k=3):
    """Rank chunks by vector similarity to the query embedding.

    Args:
        query: Search query to embed.
        chunks: Chunk records aligned with ``chunk_embeddings``.
        chunk_embeddings: Precomputed embeddings for each chunk.
        top_k: Number of matches to return.

    Returns:
        The top ``top_k`` ``(chunk, score)`` pairs sorted by similarity.
    """
    query_embedding = embed_texts([query])[0]
    scores = [cosine_similarity(query_embedding, ce) for ce in chunk_embeddings]
    ranked = sorted(enumerate(scores), key=lambda x: x[1], reverse=True)
    return [(chunks[i], score) for i, score in ranked[:top_k]]


# --- Step 4: Lexical search (BM25) ---

def lexical_search(query, chunks, top_k=3):
    """Rank chunks with BM25 keyword search.

    Args:
        query: Search query to score lexically.
        chunks: Chunk records to search.
        top_k: Number of matches to return.

    Returns:
        The top ``top_k`` ``(chunk, score)`` pairs sorted by BM25 score.
    """
    tokenized = [c["text"].lower().split() for c in chunks]
    bm25 = BM25Okapi(tokenized)
    scores = bm25.get_scores(query.lower().split())
    ranked = sorted(enumerate(scores), key=lambda x: x[1], reverse=True)
    return [(chunks[i], score) for i, score in ranked[:top_k]]


# --- Step 5: Metadata-filtered search ---

def vector_search_filtered(query, chunks, chunk_embeddings, source_filter, top_k=3):
    """Run vector search after restricting candidates to one source file.

    Args:
        query: Search query to embed.
        chunks: Chunk records aligned with ``chunk_embeddings``.
        chunk_embeddings: Precomputed embeddings for each chunk.
        source_filter: Filename to keep during the search.
        top_k: Number of matches to return.

    Returns:
        The top ``top_k`` ``(chunk, score)`` pairs from the filtered source.
    """
    query_embedding = embed_texts([query])[0]
    scored = []
    for i, (chunk, emb) in enumerate(zip(chunks, chunk_embeddings)):
        if chunk["source"] == source_filter:
            scored.append((chunk, cosine_similarity(query_embedding, emb)))
    scored.sort(key=lambda x: x[1], reverse=True)
    return scored[:top_k]


# --- Run it ---

if __name__ == "__main__":
    print("Loading corpus...")
    chunks = load_corpus()
    print(f"  {len(chunks)} chunks from {len(set(c['source'] for c in chunks))} files\n")

    print("Generating embeddings...")
    chunk_embeddings = embed_texts([c["text"] for c in chunks])
    print(f"  {len(chunk_embeddings)} embeddings generated\n")

    # --- Test queries ---
    queries = [
        ("Exact-name lookup", "What does the process_webhook function do?"),
        ("Near-duplicate topics", "What is the difference between authentication and authorization?"),
        ("Narrow fact", "What port does the development server run on?"),
    ]

    for label, query in queries:
        print(f"\n{'='*60}")
        print(f"Query [{label}]: {query}")
        print(f"{'='*60}")

        print("\n  VECTOR SEARCH:")
        for chunk, score in vector_search(query, chunks, chunk_embeddings):
            print(f"    [{score:.3f}] ({chunk['source']}) {chunk['text'][:80]}...")

        print("\n  LEXICAL SEARCH (BM25):")
        for chunk, score in lexical_search(query, chunks):
            if score > 0:
                print(f"    [{score:.2f}] ({chunk['source']}) {chunk['text'][:80]}...")

    # --- Metadata filter demo ---
    print(f"\n{'='*60}")
    print("METADATA FILTER: 'process_webhook' filtered to webhooks.md only")
    print(f"{'='*60}")
    for chunk, score in vector_search_filtered(
        "What does process_webhook do?", chunks, chunk_embeddings, "webhooks.md"
    ):
        print(f"  [{score:.3f}] ({chunk['source']}) {chunk['text'][:80]}...")

Run ollama pull embeddinggemma:latest before you test the script.

Run it:

python retrieval.py

What to observe

Compare the three search methods across the three queries:

  • Exact-name lookup ("process_webhook"): BM25 should find the chunk with the function name directly. Vector search may return chunks about webhooks generally but miss the exact function reference.
  • Near-duplicate topics (auth vs authz): Vector search will likely return chunks about both authentication and authorization mixed together, so the embeddings are close. BM25 may do better if the exact words appear.
  • Narrow fact (port 8000): The answer is one line. If the naive chunking split it away from its surrounding context, neither search may rank it highly.

The metadata filter demo shows how filtering to a specific file eliminates irrelevant results entirely. It's a trivially cheap improvement.

A note on retrieval and hallucination

In LLM Mental Models we introduced hallucination as "the model generates confident content that isn't supported by evidence." You might expect that adding retrieval solves this; if the model has evidence, it won't make things up. That's partially true, but retrieval introduces its own failure mode: grounded-looking wrong answers.

If your retrieval pipeline returns the wrong chunks (because of a chunk boundary issue, an embedding miss, or a missing metadata filter), the model will faithfully use that wrong evidence to produce a confident, well-structured, wrong answer. It won't look like a hallucination... it'll look like the model did its job. In that case, the generation step did exactly what it was asked. The retrieval layer is where the error entered.

This is why the lab notes we're keeping are so important. When you document what the retrieval pipeline gets wrong, you're building the foundation for evaluating answer quality in Modules 5 and 6, where we'll teach grounding, citation, faithfulness checks, and the ability to say "I don't know."

Write your Retrieval Lab Notes

Create retrieval-lab-notes.md and document what the pipeline gets wrong:

<!-- retrieval-lab-notes.md -->
# Retrieval Lab Notes

## Query: "What does the process_webhook function do?"
- **Vector search returned:** [paste top results]
- **BM25 returned:** [paste top results]
- **Correct answer:** The function validates incoming webhook payloads, verifies HMAC signature, dispatches to handler. Accepts WebhookEvent, returns ProcessResult.
- **Failure cause:** [chunk boundary? embedding miss? both?]

## Query: "What is the difference between authentication and authorization?"
- **Vector search returned:** [paste top results]
- **BM25 returned:** [paste top results]
- **Correct answer:** Authentication = JWT token verification. Authorization = role-based (admin/editor/viewer) permission checks.
- **Failure cause:** [embeddings too similar? chunks mixed content?]

## Query: "What port does the development server run on?"
- **Vector search returned:** [paste top results]
- **BM25 returned:** [paste top results]
- **Correct answer:** Port 8000.
- **Failure cause:** [narrow fact lost in chunk? low embedding similarity?]

## What the next retrieval layer would need
- [your observations here]

Fill in the actual results from your run. This memo is the requirements document for Module 4, where you will build progressively better retrieval and measure each tier against these same failures.

Exercises

  1. Build the simplest possible embedding search over a small text corpus (10-20 documents).
  2. Stress-test it with at least 5 queries: exact-name lookups, near-duplicate topics, and narrow fact retrieval.
  3. Add metadata filters (at minimum, file path) and compare filtered vs unfiltered results.
  4. Add lexical search and compare against embedding-only retrieval on the same queries.
  5. Write your Retrieval Lab Notes: what the naive retrieval pipeline gets wrong and why. We'll want to keep this document. It'll become the baseline for Module 4.
  6. Verify your provider-specific embed_texts() from the setup tabs above works end to end. If you are Anthropic-first, note which embeddings provider you paired with it and why.

Reflection prompts

  • What types of queries did the naive pipeline fail on?
  • For each failure, was the cause a chunk boundary issue, an embedding miss, a missing filter, or something else?
  • What capability would the next retrieval layer need to add to fix these failures?

Completion checkpoint

You should now be able to:

  • Run an embedding search over a small corpus and return top-k results
  • Show at least two queries where vector search fails and explain why
  • Show at least one query where lexical search outperforms vector search
  • Show at least one query where metadata filters improve results
  • Produce a Retrieval Lab Notes that identifies specific failure modes and their causes
  • Explain how the same retrieval pipeline swaps between OpenAI, Gemini, Hugging Face, and Ollama embeddings, and why an Anthropic-first setup still needs a separate embeddings provider

Connecting to the project

The retrieval pipeline and lab notes you built here are standalone experiments over a small text corpus. Starting in Module 2, you'll choose an anchor repository (a real codebase) and your code assistant will need to retrieve code from it to answer questions.

We'll want to keep those lab notes. In Module 4 (Code Retrieval) they'll become the baseline you measure each retrieval improvement against. Four progressively better tiers, each evaluated on the same failure cases you documented here.

The naive retrieval pipeline you built here will also reappear in Module 5 (RAG) as the baseline you'll improve upon. Every retrieval decision you make later (vector vs lexical vs structural vs hybrid) traces back to the failure modes you just observed.

What's next

Security Basics. Before the model starts touching tools, files, and larger loops, lock in the small safety habits that keep the rest of the build sane.

References

Start here

Build with this

Deep dive

Your Notes
GitHub Sync

Sync your lesson notes to a private GitHub Gist. If you have not entered a token yet, the sync button will open the GitHub token modal.

Glossary
API (Application Programming Interface)Foundational terms
A structured way for programs to communicate. In this context, usually an HTTP endpoint you call to interact with an LLM.
AST (Abstract Syntax Tree)Foundational terms
A tree representation of source code structure. Used by parsers like Tree-sitter to understand code as a hierarchy of functions, classes, and statements. You'll encounter this more deeply in the Code Retrieval module, but the concept appears briefly in retrieval fundamentals.
BM25 (Best Match 25)Foundational terms
A classical ranking function for keyword search. Scores documents by term frequency and inverse document frequency. Often competitive with or complementary to vector search.
ChunkingFoundational terms
Splitting a document into smaller pieces for indexing and retrieval. Chunk boundaries significantly affect retrieval quality. Split at the wrong place and your retrieval will return half a function or the end of one paragraph glued to the start of another.
Context engineeringFoundational terms
The discipline of selecting, packaging, and budgeting the information a model sees at inference time. Prompts, retrieved evidence, tool results, memory, and state are all parts of context. Context engineering is arguably the core skill of AI engineering. Bigger context windows are not a substitute for better context selection.
Context rotFoundational terms
Degradation of output quality caused by stale, noisy, or accumulated context. Symptoms include stale memory facts, conflicting retrieved evidence, bloated prompt history, and accumulated instructions that contradict each other. A form of technical debt in AI systems.
Context windowFoundational terms
The maximum number of tokens an LLM can process in a single request (input + output combined).
EmbeddingFoundational terms
A fixed-length numeric vector representing a piece of text. Used for similarity search: texts with similar meanings have nearby embeddings.
EndpointFoundational terms
A specific URL path that accepts requests and returns responses (e.g., POST /v1/chat/completions).
GGUFFoundational terms
A file format for quantized models used by llama.cpp and Ollama. When you see a model name like qwen2.5:7b-q4_K_M, the suffix indicates the quantization scheme. GGUF supports mixed quantization (different precision for different layers) and is the most common format for local inference.
HallucinationFoundational terms
When a model generates content that sounds confident but isn't supported by the evidence it was given, or fabricates details that don't exist. Not the same as "any wrong answer"; a model that misinterprets ambiguous instructions gave a bad answer but didn't hallucinate. Common causes: weak prompt, missing context, context rot, model limitation, or retrieval failure.
InferenceFoundational terms
Running a trained model to generate output from input. What happens when you call an API. Most AI engineering work is inference-time work: building systems around models, not training them. Use "inference," not "inferencing."
JSON (JavaScript Object Notation)Foundational terms
A lightweight text format for structured data. The lingua franca of API communication.
Lexical searchFoundational terms
Finding items by matching keywords or terms. Includes BM25, TF-IDF (Term Frequency–Inverse Document Frequency), and simple keyword matching. Returns exact term matches, not semantic similarity.
LLM (Large Language Model)Foundational terms
A neural network trained on large text corpora that generates text by predicting the next token. The core technology behind AI engineering; every tool, pattern, and pipeline in this curriculum runs on top of one.
MetadataFoundational terms
Structured information about a document or chunk (file path, language, author, date, symbol type). Used for filtering retrieval results.
Neural networkFoundational terms
A computing system loosely inspired by biological neurons, built from layers of mathematical functions that transform inputs into outputs. LLMs are a specific type of neural network (transformers) trained on text. You don't need to understand neural network internals to do AI engineering, but knowing the term helps when reading external resources.
Reasoning modelFoundational terms
A model optimized for complex multi-step planning, math, and logic (e.g., o3, o4-mini). Slower and more expensive but better on hard problems. Sometimes called "LRM" (large reasoning model), but "reasoning model" is the more consistent term across provider docs.
RerankingFoundational terms
A second-pass scoring step that re-orders retrieved results using a more expensive model. Improves precision after an initial broad retrieval.
SchemaFoundational terms
A formal description of the shape and types of a data structure. Used to validate inputs and outputs.
SLM (small language model)Foundational terms
A compact model (typically 1-7B parameters) that runs on consumer hardware with lower cost, latency, and better privacy (e.g., Phi, small Llama variants, Gemma). The right choice when privacy, offline operation, predictable cost, or low latency matter more than peak capability.
System promptFoundational terms
A special message that sets the model's behavior, role, and constraints for a conversation.
TemperatureFoundational terms
A parameter controlling output randomness. Lower values produce more deterministic output; higher values produce more varied output. Does not affect the model's intelligence.
TokenFoundational terms
The basic unit an LLM processes. Not a word. Tokens are sub-word fragments. "unhappiness" might be three tokens: "un", "happi", "ness". Token count determines cost and context window usage.
Top-kFoundational terms
The number of results returned from a retrieval query. "Top-5" means the five highest-scoring results.
Top-p (nucleus sampling)Foundational terms
An alternative to temperature for controlling output diversity. Selects from the smallest set of tokens whose cumulative probability exceeds p.
Vector searchFoundational terms
Finding items by proximity in embedding space (nearest neighbors). Returns "similar" results, not "exact match" results.
vLLM (virtual LLM)Foundational terms
An inference serving engine (not a model) that hosts open-weight models behind an OpenAI-compatible HTTP endpoint. Infrastructure layer, not model layer. Relevant when moving from hosted APIs to self-hosting.
WeightsFoundational terms
The learned parameters inside a model. Changed during training, fixed during inference.
Workhorse modelFoundational terms
A general-purpose LLM optimized for speed and broad capability (e.g., GPT-4o-mini, Claude Haiku, Gemini Flash). The default for most tasks. When someone says "LLM" without qualification, they usually mean this.
BaselineBenchmark and Harness terms
The first measured performance of your system on a benchmark. Everything else is compared against this. Without a baseline, you can't tell whether a change helped.
BenchmarkBenchmark and Harness terms
A fixed set of questions or tasks with known-good answers, used to measure system performance over time.
Run logBenchmark and Harness terms
A structured record (typically JSONL) of every system run: what input was given, what output was produced, what tools were called, how long it took, and what it cost. The raw data that evals, telemetry, and cost analysis are built from.
A2A (Agent-to-Agent protocol)Agent and Tool Building terms
An open protocol for peer-to-peer agent collaboration. Agents discover each other's capabilities and delegate or negotiate tasks as equals. Different from MCP (which connects agents to tools, not to other agents) and from handoffs (which transfer control within one system).
AgentAgent and Tool Building terms
A system where an LLM decides which tools to call, observes results, and iterates until a task is complete. Agent = model + tools + control loop.
Control loopAgent and Tool Building terms
The code that manages the agent's cycle: send prompt, check for tool calls, execute tools, append results, repeat or finish.
HandoffAgent and Tool Building terms
Passing control from one agent or specialist to another within an orchestrated system.
MCP (Model Context Protocol)Agent and Tool Building terms
An open protocol for exposing tools, resources, and prompts to AI applications in a standardized way. Connects agents to capabilities (tools and data), not to other agents.
Tool calling / function callingAgent and Tool Building terms
The model's ability to request execution of a specific function with structured arguments, rather than just generating text.
Context compilation / context packingCode Retrieval terms
The process of selecting and assembling the smallest useful set of evidence for a specific task. Not "dump everything retrieved into the prompt."
GroundingCode Retrieval terms
Tying model assertions to specific evidence. A grounded answer cites what it found; an ungrounded answer asserts without evidence.
Hybrid retrievalCode Retrieval terms
Combining multiple retrieval methods (e.g., vector search + keyword search + metadata filters) and merging or reranking the results.
Knowledge graphCode Retrieval terms
A data structure that stores entities and their relationships explicitly (e.g., "function A calls function B," "module X imports module Y"). Useful for traversal and dependency reasoning. One retrieval strategy among several, often overused when simpler metadata or adjacency tables would suffice.
RAG (Retrieval-Augmented Generation)Code Retrieval terms
A pattern where the model's response is grounded in retrieved external evidence rather than relying solely on its training data.
Symbol tableCode Retrieval terms
A mapping of code identifiers (functions, classes, variables) to their locations and metadata.
Tree-sitterCode Retrieval terms
An incremental parsing library that builds ASTs for source code. Used in this curriculum for code-aware chunking and symbol extraction.
Context packRAG and Grounded Answers terms
A structured bundle of evidence assembled for a specific task, with metadata about provenance, relevance, and token budget.
Evidence bundleRAG and Grounded Answers terms
A collection of retrieved items grouped for a specific sub-task, with enough metadata to evaluate whether the evidence is relevant and sufficient.
Retrieval routingRAG and Grounded Answers terms
Deciding which retrieval strategy or method to use for a given query. Different questions need different retrieval methods.
EvalObservability and Evals terms
A structured test that measures system quality. Not the same as training. Evals measure, they don't change the model.
Harness (AI harness / eval harness)Observability and Evals terms
The experiment and evaluation framework around your model or agent. It runs benchmark tasks, captures outputs, logs traces, grades results, and compares system versions. It turns ad hoc "try it and see" into repeatable, comparable experiments. Typically includes: input dataset, prompt and tool configuration, model/provider selection, execution loop, logging, grading, and artifact capture.
LLM-as-judgeObservability and Evals terms
Using a language model to evaluate or grade the output of another model or system. Useful for scaling evaluation beyond manual review, but requires rubric quality, judge consistency checks, and human spot-checking. Not a replacement for exact-match checks where they apply.
OpenTelemetry (OTel)Observability and Evals terms
An open standard for collecting and exporting telemetry data (traces, metrics, logs). Vendor-agnostic.
RAGASObservability and Evals terms
A specific eval framework for retrieval-augmented generation. Measures metrics like faithfulness, relevance, and context precision. One tool example, not a foundational concept. Learn the metrics first, then the tool.
SpanObservability and Evals terms
A single operation within a trace (e.g., one tool call, one retrieval query). Traces are made of spans.
TelemetryObservability and Evals terms
Structured data about system behavior: what happened, when, how long it took, what it cost. Includes traces, metrics, and events.
TraceObservability and Evals terms
A structured record of one complete run through the system, including all steps, tool calls, and decisions.
Long-term memoryOrchestration and Memory terms
Persistent facts that survive across conversations. Requires write policies to manage what gets stored, updated, or deleted.
OrchestrationOrchestration and Memory terms
Explicit control over how tasks are routed, delegated, and synthesized across multiple agents or specialists.
RouterOrchestration and Memory terms
A component that decides which specialist or workflow path to use for a given query.
SpecialistOrchestration and Memory terms
An agent or workflow tuned for a narrow task (e.g., "code search," "documentation lookup," "test generation"). Specialists are composed by an orchestrator.
Thread memoryOrchestration and Memory terms
Conversation state that persists within a single session or thread.
Workflow memoryOrchestration and Memory terms
Intermediate state that persists within a multi-step task but doesn't survive beyond the workflow's completion.
Catastrophic forgettingOptimization terms
When fine-tuning causes a model to lose capabilities it had before training. The model gets better at the fine-tuned task but worse at tasks it previously handled. PEFT methods like LoRA reduce this risk by freezing original weights.
DistillationOptimization terms
Training a smaller (student) model to reproduce the behavior of a larger (teacher) model on a specific task.
DPO (Direct Preference Optimization)Optimization terms
A method for preference-based model optimization that's simpler than RLHF, training the model directly on preference pairs without a separate reward model.
Fine-tuningOptimization terms
Updating a model's weights on task-specific data to change its behavior permanently. An umbrella term that includes SFT, instruction tuning, RLHF, DPO, and other techniques. See the fine-tuning landscape table in Lesson 8.3 for how these relate.
Full fine-tuningOptimization terms
Updating all of a model's parameters during training, as opposed to PEFT methods that update only a small subset. Requires significantly more GPU memory and compute. Produces the most thorough adaptation but carries higher risk of catastrophic forgetting.
Inference serverOptimization terms
Software (like vLLM or Ollama) that hosts a model and serves inference requests.
Instruction tuningOptimization terms
A specific application of SFT where the training data consists of instruction-response pairs. This is how base models become chat models: the technique is SFT, the data format is instructions. Not a separate technique from SFT.
LoRA (Low-Rank Adaptation)Optimization terms
A parameter-efficient fine-tuning method that trains small adapter matrices instead of updating all model weights. Dramatically reduces GPU memory and compute requirements.
Parameter countOptimization terms
The number of learned weights in a model, commonly expressed in billions (e.g., "7B" = 7 billion parameters). Determines memory requirements (roughly 2 bytes per parameter at FP16) and broadly correlates with capability, though training quality and architecture matter as much as size. See Model Selection and Serving for sizing guidance.
PEFT (Parameter-Efficient Fine-Tuning)Optimization terms
A family of methods (including LoRA) that fine-tune a small subset of parameters instead of the full model.
Preference optimizationOptimization terms
Training methods (RLHF, DPO) that use human or automated preference signals to improve model behavior. "This output is better than that output" rather than "this is the correct output."
QLoRA (Quantized LoRA)Optimization terms
LoRA applied to a quantized (compressed) base model. Further reduces memory requirements, enabling fine-tuning on consumer hardware.
QuantizationOptimization terms
Reducing the precision of model weights (e.g., FP16 → INT4) to shrink memory usage and increase inference speed at some quality cost. A 7B model at FP16 needs ~14 GB VRAM; quantized to 4-bit, it fits in ~4 GB. Common formats include GGUF (llama.cpp/Ollama), GPTQ and AWQ (vLLM/HuggingFace). See Model Selection and Serving for format details and tradeoffs.
OverfittingOptimization terms
When a model memorizes training examples instead of learning generalizable patterns. The model performs well on training data but poorly on new inputs. Detected by monitoring validation loss alongside training loss.
RLHF (Reinforcement Learning from Human Feedback)Optimization terms
A training method that uses human preference signals to improve model behavior through a reward model. More complex than DPO (requires training a separate reward model) but offers more control over the optimization objective.
SFT (Supervised Fine-Tuning)Optimization terms
Fine-tuning using input-output pairs where the desired output is known. The most common fine-tuning approach.
TRL (Transformer Reinforcement Learning)Optimization terms
A Hugging Face library for training language models with reinforcement learning, SFT, and other optimization methods.
Consumer chat appCross-cutting terms
The browser or desktop product meant for human conversation (ChatGPT, Claude, HuggingChat). Useful for experimentation, but not the same as API access.
Developer platformCross-cutting terms
The provider's API, billing, API-key, and developer-docs surface. This is what you need for this learning path.
Hosted APICross-cutting terms
The provider runs the model for you and you call it over HTTP.
Local inferenceCross-cutting terms
You run the model on your own machine.
ProviderCross-cutting terms
The company or service that hosts a model API you call from code.
Prompt cachingCross-cutting terms
Reusing computation from repeated prompt prefixes to reduce latency and cost on subsequent requests with the same prefix.
Rate limitingCross-cutting terms
Constraints on how many API requests you can make per unit of time. An operational concern that affects system design and cost.
Token budgetCross-cutting terms
The maximum number of tokens you allocate for a specific part of the context (e.g., "retrieval evidence gets at most 4K tokens"). A context engineering tool for preventing any single component from dominating the context window.