PANACHES Knowledge

AI Glossary

This glossary covers the essential concepts of artificial intelligence, from machine learning to generative models, including data, agents, evaluation, and safety. It is designed for curious minds, creators, developers, and professionals who want to understand how these technologies work, how they are used, and where their limitations lie, without unnecessary jargon or brand-focused listings.

595 terms to explore

Loading the graph…

View the list ({count})

    595 terms

    Foundations and Core Concepts

    24 terms

    AI system

    Functional assembly combining a model, software, data, interfaces and possibly actions to produce predictions, recommendations, content or decisions.

    #

    Symbolic AI

    Approach based on explicit rules, logic and knowledge representation, as opposed to statistical learning.

    #

    Connectionist AI

    Approach based on artificial neural networks whose parameters are learned from data.

    #

    Statistical AI

    Approach relying on probabilistic models and statistical inference to learn from data and generalize.

    #

    Predictive AI

    AI systems that estimate a likely outcome from inputs, often via supervised learning.

    #

    Discriminative AI

    Models that learn the boundary between classes or predict conditional outputs, as opposed to modeling the full data distribution.

    #

    Narrow or specialized AI

    AI designed to perform a specific task or a limited set of tasks, without general cognitive abilities.

    #

    Expert system

    Software that encodes domain knowledge as rules and uses an inference engine to derive conclusions or recommendations.

    #

    Heuristic

    Rule of thumb or approximation that guides search or decision-making without guaranteeing an optimal result.

    #

    State space

    Set of all configurations reachable from an initial state by applying the available actions; used to formalize search and planning problems.

    #

    Objective function

    Function that maps a solution to a score to be optimized (minimized or maximized); also called loss or cost in training.

    #

    Emergent capability

    Ability that appears in a model only above a certain scale or complexity threshold and was not explicitly programmed.

    #

    Historical Landmarks and Paradigms

    14 terms

    Turing test

    Proposal by Alan Turing to assess whether a machine can exhibit behavior indistinguishable from a human in conversation.

    #

    Dartmouth workshop

    1956 summer workshop at Dartmouth College that gave birth to the field of artificial intelligence as an academic discipline.

    #

    AI winter

    Period of reduced funding and interest in AI following unmet expectations, occurring in the late 1980s and 1990s.

    #

    GOFAI

    Good Old-Fashioned AI: symbolic, rule-based AI approaches dominant before the rise of statistical and neural methods.

    #

    Perceptron (historical)

    Single-layer linear classifier introduced by Frank Rosenblatt in 1958, a precursor of modern neural networks.

    #

    Connectionist revival

    Period beginning in the 2010s when deep neural networks, big data and GPU compute re-established connectionist AI as the dominant paradigm.

    #

    Foundation model

    Large model trained on broad data at scale and adaptable to many downstream tasks via fine-tuning or prompting.

    #

    Technology frontier

    Current state of the art in model capability, often pushed by the largest foundation models.

    #

    Augmented intelligence

    Approach where AI assists humans in decision-making rather than replacing them, emphasizing human-AI collaboration.

    #

    Hybrid AI

    System combining symbolic reasoning and neural or statistical components to leverage strengths of both paradigms.

    #

    Neuro-symbolic

    Approach integrating neural networks with symbolic representations or logic to improve reasoning and interpretability.

    #

    Embedded AI

    AI models running directly on embedded devices (microcontrollers, edge hardware) rather than in the cloud.

    #

    Mathematics and Representations

    25 terms

    Scalar

    Single numerical value, as opposed to a vector or tensor.

    #

    Vector

    Ordered array of numbers representing a point or direction in a multidimensional space; central object in ML computations.

    #

    Matrix

    Two-dimensional array of numbers; basic structure for linear transformations and batch computations in ML.

    #

    Tensor

    Multidimensional array generalizing scalars, vectors and matrices; the core data structure of deep learning frameworks.

    #

    Latent space

    Lower-dimensional representation space learned by a model in which similar inputs are mapped to nearby points.

    #

    Random variable

    Variable whose value depends on the outcome of a random phenomenon; central to probabilistic modeling.

    #

    Prior distribution

    Probability distribution expressing beliefs about a quantity before observing data; combined with the likelihood to form the posterior.

    #

    Posterior distribution

    Probability distribution of a quantity after combining the prior with the observed data via Bayes' rule.

    #

    Bayesian inference

    Method that updates beliefs about unknown quantities using Bayes' rule, combining prior and likelihood.

    #

    Loss function

    Function measuring the discrepancy between model predictions and targets; minimized during training.

    #

    Gradient

    Vector of partial derivatives indicating the direction of steepest increase of a function; used in reverse for gradient descent.

    #

    Partial derivative

    Derivative of a multivariate function with respect to one variable, treating the others as constant; component of the gradient.

    #

    Gradient descent

    Optimization algorithm that updates parameters in the direction opposite to the gradient of the loss to minimize it.

    #

    Convex optimization

    Optimization problem whose objective and constraints define a convex set, guaranteeing that a local optimum is global.

    #

    Local minimum

    Point where the loss is lower than in a neighborhood, without being the global minimum; optimization can get trapped there.

    #

    Regularization

    Technique that penalizes model complexity (e.g., L2, dropout) to improve generalization and prevent overfitting.

    #

    Cosine similarity

    Similarity measure between two vectors based on the cosine of the angle between them; widely used for embeddings.

    #

    Euclidean distance

    Standard geometric distance between two points in a vector space, computed as the L2 norm of their difference.

    #

    Entropy

    Measure of uncertainty or information content of a probability distribution.

    #

    Cross-entropy

    Loss function measuring the difference between two probability distributions; standard loss for classification.

    #

    Data, Datasets and Quality

    33 terms

    Training data

    Examples used to fit model parameters during training.

    #

    Validation set

    Subset of the data used to tune hyperparameters and monitor generalization during training, without touching the test set.

    #

    Test set

    Subset of the data held out to evaluate the final model's generalization, used only once.

    #

    Dataset

    Structured collection of examples used to train, validate or test a model.

    #

    Target

    Variable to predict, also called label in classification.

    #

    Ground truth

    Verified reference value or label considered correct for evaluation and supervised training.

    #

    Data schema

    Description of the structure of a dataset: fields, types, relationships.

    #

    Unstructured data

    Data without a predefined schema, such as raw text, images, audio or video.

    #

    Semi-structured data

    Data with partial structure, such as JSON, XML or logs, that does not fit a strict relational schema.

    #

    Preprocessing

    Transformations applied to raw data before training or inference (cleaning, normalization, tokenization, etc.).

    #

    Data cleaning

    Detection and correction of errors, inconsistencies and duplicates in a dataset.

    #

    Deduplication

    Removal of duplicate examples from a dataset; critical for training corpora, especially for LLMs.

    #

    Class imbalance

    Situation where some classes are much more frequent than others in a classification dataset; biases models toward the majority class.

    #

    Sampling

    Selection of a subset from a population or dataset according to a procedure (random, stratified, etc.).

    #

    Stratification

    Sampling method that preserves the proportion of each class or subgroup in the selected subset.

    #

    Data augmentation

    Generation of new training examples by applying label-preserving transformations (crop, noise, paraphrase, etc.) to existing data.

    #

    Synthetic data

    Artificially generated data, often by a model, used to augment or replace real data.

    #

    Test set contamination

    Presence of test data in the training corpus, which inflates evaluation metrics and invalidates them.

    #

    Data drift

    Change over time in the statistical distribution of input data relative to the training distribution.

    #

    Concept drift

    Change over time in the relationship between inputs and the target concept to predict.

    #

    Data lineage

    Traceability of the origin, transformations and uses of a dataset throughout its lifecycle.

    #

    Classical Machine Learning

    30 terms

    Supervised learning

    Learning from labeled examples, where each training input is paired with a target output.

    #

    Unsupervised learning

    Learning structure from unlabeled data, for clustering, dimensionality reduction or density estimation.

    #

    Self-supervised learning

    Learning where supervision signals are derived from the data itself, e.g., by predicting masked parts; foundation of modern foundation models.

    #

    Active learning

    Learning strategy where the model queries an oracle (often a human) to label the most informative examples, reducing annotation cost.

    #

    Reinforcement learning (RL)

    Learning where an agent learns a policy by interacting with an environment and receiving rewards or penalties.

    #

    Transfer learning

    Reuse of a model trained on one task or domain as a starting point for another task, to reduce data and compute needs.

    #

    Online learning

    Learning where the model is updated continuously as new data arrives, rather than in offline batches.

    #

    Federated learning

    Learning where multiple clients train locally and only share model updates, aggregated by a central server, preserving data privacy.

    #

    Clustering

    Unsupervised task of grouping similar examples together without predefined labels.

    #

    Dimensionality reduction

    Techniques that project high-dimensional data into a lower-dimensional space while preserving structure (e.g., PCA, UMAP, t-SNE).

    #

    K-nearest neighbors (k-NN)

    Non-parametric method that classifies or regresses an input by the majority or average of its k closest training examples.

    #

    Decision tree

    Model that recursively splits the input space according to feature thresholds to predict a target.

    #

    Random forest

    Ensemble of decision trees trained on bootstrap samples with random feature subsets; reduces variance and overfitting.

    #

    Boosting

    Ensemble method that sequentially trains weak models, each correcting the errors of the previous ones.

    #

    Gradient boosting

    Boosting variant that fits each new model to the gradient of the loss with respect to the current predictions (e.g., XGBoost, LightGBM).

    #

    Logistic regression

    Linear classifier modeling the log-odds of a class as a linear combination of features; baseline for binary classification.

    #

    Naive Bayes

    Probabilistic classifier assuming conditional independence of features given the class; simple and effective on text.

    #

    Ensemble model

    Model combining the predictions of several base models to improve accuracy and robustness.

    #

    Overfitting

    Situation where a model fits the training data too closely, including its noise, and generalizes poorly.

    #

    Underfitting

    Situation where a model is too simple to capture the underlying structure of the data, performing poorly even on training.

    #

    Generalization

    Ability of a model to produce accurate predictions on new data drawn from the same distribution as the training data.

    #

    Bias-variance tradeoff

    Fundamental tradeoff between the bias of a model (systematic error) and its variance (sensitivity to the training sample).

    #

    Cross-validation

    Evaluation method that splits the data into k folds and trains on k-1 to test on the remaining one, rotating to obtain all scores.

    #

    Neural Networks and Architectures

    32 terms

    Artificial neural network

    Computing model composed of layers of interconnected artificial neurons, trained by gradient descent.

    #

    Neural layer

    Set of neurons operating at the same level of abstraction in a neural network.

    #

    Hidden layer

    Intermediate layer in a neural network, between input and output, enabling the learning of nonlinear representations.

    #

    Activation function

    Nonlinear function applied to the weighted sum in a neuron (ReLU, GELU, sigmoid, etc.).

    #

    GELU

    Gaussian Error Linear Unit: smooth activation used in Transformers, weighting inputs by their Gaussian CDF.

    #

    Sigmoid

    S-shaped activation function squashing its input to (0, 1); used for binary outputs and gating.

    #

    Softmax

    Function converting a vector of real values into a probability distribution summing to 1; used at the output of classifiers.

    #

    Forward pass

    Phase of neural network computation that propagates inputs through the layers to produce outputs.

    #

    Backpropagation

    Algorithm that computes gradients of the loss with respect to each parameter by chain rule, enabling gradient descent.

    #

    Convolution

    Operation applying a kernel sliding over the input to extract local features; core of CNNs.

    #

    Pooling

    Downsampling operation (max or average) that reduces spatial dimensions and adds some translation invariance.

    #

    Recurrent neural network (RNN)

    Neural network processing sequences by maintaining a hidden state updated at each step; largely replaced by Transformers.

    #

    LSTM

    Long Short-Term Memory: RNN variant with gating mechanisms that mitigate the vanishing gradient problem.

    #

    GRU

    Gated Recurrent Unit: simplified RNN variant combining the forget and input gates into a single update gate.

    #

    Autoencoder

    Neural network trained to reconstruct its input through a bottleneck, learning a compressed latent representation.

    #

    Skip connection

    Shortcut adding the input of a layer to its output, enabling residual learning and stabilizing deep training.

    #

    Layer normalization

    Normalization across the features of a single example; standard in Transformers.

    #

    Batch normalization

    Normalization across the examples of a mini-batch; stabilizes and accelerates training of deep networks.

    #

    Dropout

    Regularization technique that randomly drops units during training to prevent co-adaptation and overfitting.

    #

    Mixture of experts (MoE)

    Architecture that routes each input to a subset of specialized expert sub-networks, scaling capacity without proportional compute cost.

    #

    Expert routing

    Mechanism selecting which expert sub-networks process each input in an MoE model.

    #

    Knowledge distillation

    Training of a smaller student model to mimic a larger teacher model, often improving efficiency.

    #

    Transformers, Tokens and Language Representations

    31 terms

    Self-attention

    Attention where queries, keys and values come from the same sequence, modeling internal dependencies.

    #

    Cross-attention

    Attention where queries come from one sequence and keys/values from another; used in encoder-decoder models and multimodal fusion.

    #

    Multi-head attention

    Attention computed in parallel over several subspaces, allowing the model to attend to different relationships.

    #

    Attention head

    One of the parallel attention subspaces in multi-head attention.

    #

    Encoder

    Component of a model that builds a representation of the input; in Transformers, uses bidirectional self-attention.

    #

    Decoder

    Component of a model that generates outputs from a representation, typically autoregressively.

    #

    Tokenization

    Process of splitting text into tokens according to a model's vocabulary.

    #

    Tokenizer

    Component that converts text into a sequence of tokens and back; defines the model's vocabulary.

    #

    Subword

    Token unit smaller than a word, balancing vocabulary size and coverage of rare words (BPE, SentencePiece, WordPiece).

    #

    Byte Pair Encoding (BPE)

    Subword tokenization algorithm that iteratively merges the most frequent pairs of symbols to build a vocabulary.

    #

    Special token

    Reserved token with a specific role in a model: BOS, EOS, PAD, MASK, system, etc.

    #

    Token embedding

    Vector representation of a token in the model's input space; learned during training.

    #

    Sentence embedding

    Vector representation of an entire sentence or paragraph, used for semantic similarity or retrieval.

    #

    Positional encoding

    Signal added to token embeddings to inject position information into the model, since attention is permutation-equivariant.

    #

    Attention mask

    Matrix preventing attention to certain positions (padding, future tokens, etc.).

    #

    Causal mask

    Attention mask preventing a token from attending to future tokens; essential for autoregressive language models.

    #

    KV cache

    Caching of previously computed key and value tensors during autoregressive generation to avoid redundant computation.

    #

    Logit

    Raw output of a model before the softmax, representing unnormalized scores for each possible token.

    #

    Token distribution

    Probability distribution over the vocabulary produced by a language model for the next token.

    #

    Next-token prediction

    Core training objective of autoregressive language models: predicting the next token given previous ones.

    #

    Masked language modeling (MLM)

    Training objective where some tokens in the input are masked and the model learns to predict them; used by BERT-style encoders.

    #

    Autoregressive modeling

    Generation that produces outputs sequentially, each conditioned on previously generated outputs.

    #

    Training, Optimization and Adaptation

    35 terms

    Pretraining

    Initial training of a model on a large corpus to learn general capabilities before fine-tuning for specific tasks.

    #

    Trainable parameter

    Model parameter updated by gradient descent during training, as opposed to frozen parameters.

    #

    Hyperparameter

    Configuration of the training process (learning rate, batch size, number of layers) not learned by gradient descent.

    #

    Learning rate

    Hyperparameter scaling the magnitude of parameter updates at each optimization step.

    #

    Learning rate scheduler

    Strategy adjusting the learning rate during training (warmup, cosine decay, etc.) to improve convergence.

    #

    Training step

    Single update of model parameters from one mini-batch.

    #

    Batch

    Set of examples processed together in one forward/backward pass before a parameter update.

    #

    Mini-batch

    Small batch used in stochastic gradient descent, balancing update noise and computational efficiency.

    #

    Batch size

    Number of examples in a mini-batch; key hyperparameter affecting stability and throughput.

    #

    Gradient accumulation

    Technique accumulating gradients over several forward/backward passes before applying an update, simulating larger batch sizes.

    #

    Optimizer

    Algorithm that updates model parameters from gradients (SGD, Adam, AdamW, etc.).

    #

    SGD

    Stochastic Gradient Descent: optimizer that updates parameters using gradients computed on mini-batches, optionally with momentum.

    #

    AdamW

    Adam variant decoupling weight decay from the gradient update, improving generalization; standard for Transformers.

    #

    Weight decay

    Regularization penalty proportional to parameter magnitude, encouraging smaller weights and better generalization.

    #

    Gradient clipping

    Capping gradient norm or value to prevent exploding gradients in deep networks.

    #

    Warmup

    Phase at the start of training during which the learning rate is gradually increased from zero to its target value.

    #

    Checkpoint

    Snapshot of model weights (and optionally optimizer state) saved during training, enabling resumption.

    #

    Early stopping

    Stopping of training when validation performance stops improving, to prevent overfitting.

    #

    Distributed training

    Training spread across multiple GPUs or machines to handle models and datasets too large for a single device.

    #

    Data parallelism

    Each worker holds a full copy of the model and trains on a shard of the data, synchronizing gradients.

    #

    Model parallelism

    Model is split across multiple devices because it does not fit in memory on a single one.

    #

    Mixed precision

    Training using FP16/BF16 and FP32 together to reduce memory and accelerate computation while preserving stability.

    #

    Validation loss

    Loss measured on the validation set; tracked to detect overfitting and tune hyperparameters.

    #

    Catastrophic forgetting

    Tendency of neural networks to abruptly lose previously learned capabilities when trained on new tasks.

    #

    Full retraining

    Training a model from scratch on a new dataset, as opposed to fine-tuning a pretrained model.

    #

    LoRA

    Low-Rank Adaptation: PEFT method that injects trainable low-rank matrices into model weights, drastically reducing the number of trainable parameters.

    #

    QLoRA

    LoRA combined with 4-bit quantization of the base model, enabling fine-tuning of large models on a single GPU.

    #

    Adapter

    Small trainable module inserted into a frozen pretrained model to specialize it for a new task.

    #

    Adapter merging

    Combining several trained adapters (e.g., for different tasks or languages) into a single set of weights.

    #

    Alignment and Preference-Based Training

    14 terms

    Instruction tuning

    Fine-tuning a model on a curated set of (instruction, response) pairs so it better follows natural-language instructions.

    #

    Reward model

    Model trained on human preferences to predict which of two outputs a human would prefer; central to RLHF.

    #

    RLHF

    Reinforcement Learning from Human Feedback: alignment technique that fine-tunes a model with RL against a reward model trained on human preferences.

    #

    RLAIF

    Reinforcement Learning from AI Feedback: variant of RLHF where the reward signal is produced by another AI system.

    #

    PPO

    Proximal Policy Optimization: RL algorithm widely used in RLHF for its stability.

    #

    Rejection sampling

    Technique that samples multiple outputs from a model and keeps only the best ones (e.g., by reward) for fine-tuning.

    #

    Constitutional AI

    Alignment approach where an AI critiques and revises its own outputs against a set of written principles.

    #

    Reasoning distillation

    Distillation of a stronger model's chain-of-thought reasoning into a smaller student model.

    #

    Reward over-optimization

    Phenomenon where excessive optimization against a proxy reward degrades true quality, a classic Goodhart's law effect.

    #

    Reward hacking

    Exploitation of flaws in a reward signal by an optimizing model, leading to behaviors that score high but are not desired.

    #

    Calibrated refusal

    Ability of a model to decline requests it should not fulfill while still answering legitimate ones.

    #

    Language Models and Text Generation

    30 terms

    Instruction model

    Model specifically fine-tuned to follow natural-language instructions and dialogue.

    #

    System message

    Special message at the start of a conversation that sets the model's persona, instructions and behavioral constraints.

    #

    User message

    Message from the user to the model in a conversation.

    #

    Conversation turn

    One exchange in a dialogue, consisting of a user message and an assistant response.

    #

    Top-k sampling

    Sampling restricted to the k most probable next tokens; limits low-probability choices.

    #

    Greedy decoding

    Decoding strategy that always picks the most probable next token; deterministic but prone to repetition.

    #

    Repetition penalty

    Decoding parameter penalizing tokens that have already appeared, to reduce repetitive output.

    #

    Random seed

    Integer initializing the random number generator to make experiments reproducible.

    #

    Time to first token (TTFT)

    Latency between sending a request and receiving the first generated token; critical for interactive use.

    #

    Prompting and Interaction Design

    21 terms

    Prompt engineering

    Discipline of designing and optimizing prompts to obtain more accurate, reliable or controlled outputs from a model.

    #

    Zero-shot prompting

    Prompting that asks the model to perform a task without providing any example.

    #

    Few-shot prompting

    Prompting that includes a small number of examples to steer the model's behavior on a task.

    #

    Chain of thought

    Prompting technique that elicits intermediate reasoning steps before the final answer, improving performance on complex tasks.

    #

    Task decomposition

    Breaking a complex task into smaller sub-tasks, each handled by a focused prompt or step.

    #

    System prompt

    Hidden or privileged prompt setting the model's role and global instructions, separate from the user prompt.

    #

    User prompt

    Prompt entered by the end user for a given request.

    #

    Prompt template

    Parameterized prompt structure with placeholders for variables, enabling reuse across requests.

    #

    Prompt variable

    Placeholder in a prompt template filled with a value at runtime (user name, context, etc.).

    #

    Content delimiter

    Marker in a prompt separating instructions from user-provided content, helping the model avoid prompt injection.

    #

    Prompt chaining

    Technique chaining several prompts where each step's output feeds the next, to structure complex workflows.

    #

    Assisted revision

    Workflow where a model proposes a draft and a human or another model iteratively revises it.

    #

    Negative example

    Example of an undesired behavior shown to the model in a prompt to discourage that behavior.

    #

    Task persona

    Role or character assigned to the model in a prompt to specialize its tone and style.

    #

    Contradictory instructions

    Instructions in a prompt that conflict with each other or with the model's prior training, potentially leading to inconsistent behavior.

    #

    Context saturation

    Degradation of model performance when the context window is filled with irrelevant or excessive information.

    #

    RAG, Search and Knowledge

    26 terms

    Index

    Data structure enabling efficient search of documents or vectors matching a query.

    #

    Inverted index

    Index mapping each term to the documents containing it; backbone of lexical search engines.

    #

    BM25

    Classic ranking function for lexical information retrieval, weighting term frequency and document length.

    #

    Vector database

    Database optimized for storing embeddings and performing fast approximate nearest-neighbor queries.

    #

    ANN index

    Approximate Nearest Neighbor index trading exactness for speed at scale (HNSW, IVF, etc.).

    #

    HNSW

    Hierarchical Navigable Small World: graph-based ANN index offering fast queries with high recall.

    #

    Chunk

    Contiguous segment of a document used as a retrieval unit in RAG pipelines.

    #

    Chunking

    Splitting of documents into chunks suitable for retrieval and model context.

    #

    Chunk overlap

    Shared tokens between consecutive chunks to preserve context at boundaries.

    #

    Retriever

    Component of a RAG system that selects relevant documents or chunks for a query.

    #

    Reranking

    Second-pass reordering of retrieved candidates using a more accurate (and often more expensive) model.

    #

    Cross-encoder reranker

    Reranker that scores (query, document) pairs jointly, typically more accurate but slower than bi-encoders.

    #

    Query rewriting

    Transformation of the original query to improve retrieval (reformulation, expansion, decomposition).

    #

    Query expansion

    Adding related terms or synonyms to the query to improve recall.

    #

    Metadata filtering

    Restricting retrieval to documents matching certain metadata criteria (date, source, type, etc.).

    #

    Grounding

    Constraining model outputs to information actually present in the provided context, reducing hallucination.

    #

    Local document base

    User-owned document collection indexed for local RAG, without sending data to third parties.

    #

    Knowledge graph

    Structured representation of entities and their relationships, used for reasoning and retrieval.

    #

    Graph RAG

    RAG variant leveraging a knowledge graph to retrieve structured, relation-aware context.

    #

    Agents, Tools and Orchestration

    25 terms

    Agentic loop

    Iterative loop where an agent observes, reasons, acts and re-observes until the goal is reached.

    #

    Orchestrator

    Component that coordinates the steps, agents and tools in an AI workflow.

    #

    Agent planning

    Process by which an agent decomposes a goal into ordered steps before execution.

    #

    Agent tool

    External capability (search, code execution, API call) that an agent can invoke to extend its actions.

    #

    Tool execution

    Calling and running a tool from an agent, including handling inputs, outputs and errors.

    #

    Tool registry

    Catalog of available tools with their schemas, descriptions and permissions.

    #

    Tool permission

    Authorization policy defining which tools an agent may invoke and under which constraints.

    #

    Approval gate

    Decision point in an agentic workflow where human or system validation is required before continuing.

    #

    Multi-tool agent

    Agent equipped with several tools that it can choose among depending on the task.

    #

    Multi-agent system

    System in which several specialized agents collaborate, often under a supervisor, to accomplish complex tasks.

    #

    Supervisor agent

    Agent that orchestrates other agents by assigning sub-tasks and aggregating their results.

    #

    Agent memory

    Mechanism allowing an agent to retain context across turns or sessions, including conversation history and learned facts.

    #

    Short-term memory

    In-conversation context that an agent uses within a single session, typically bounded by the context window.

    #

    Execution state

    Snapshot of an agent's progress, including variables and intermediate results, enabling resumption.

    #

    Error recovery

    Mechanism by which an agent detects, handles and recovers from tool or runtime failures.

    #

    Idempotence

    Property of an operation that produces the same result whether run once or many times; critical for reliable agent tool calls.

    #

    Stop condition

    Criterion determining when an agent should end its loop (goal reached, max iterations, error, etc.).

    #

    Execution sandbox

    Isolated environment where an agent runs code or commands with restricted access to the host system.

    #

    Vision, Images and Video

    25 terms

    Computer vision

    Field of AI that enables computers to interpret images and videos.

    #

    Object detection

    Task of locating and classifying objects in an image with bounding boxes.

    #

    Bounding box

    Rectangle defined by coordinates that localizes an object in an image.

    #

    Panoptic segmentation

    Task combining semantic and instance segmentation to label every pixel while distinguishing object instances.

    #

    Visual encoder

    Component of a multimodal model that encodes images into a representation usable by the language part.

    #

    Vision Transformer (ViT)

    Transformer architecture applied to images by splitting them into patches and treating each as a token.

    #

    Image patch

    Tile of an image used as input unit by a Vision Transformer.

    #

    Image-to-image

    Generation of a new image from a source image and a conditioning signal (prompt, sketch, etc.).

    #

    Inpainting

    Filling in a masked region of an image with plausible content coherent with the surrounding area.

    #

    Super-resolution

    Generation of a high-resolution image from a low-resolution input.

    #

    Object tracking

    Task of following a specific object across a sequence of frames.

    #

    Pose estimation

    Task of detecting the position and orientation of bodies or objects from images or video.

    #

    3D reconstruction

    Task of building a 3D model of a scene or object from images, video or sensor data.

    #

    Diffusion and Multimedia Generation

    25 terms

    Forward diffusion

    Process that gradually adds Gaussian noise to data until it becomes pure noise; the reverse process is learned by the model.

    #

    Denoising

    Step where a model removes noise from a sample, iteratively denoising towards a clean image.

    #

    Latent diffusion

    Diffusion performed in a compressed latent space rather than in pixel space, enabling efficient high-resolution generation.

    #

    Diffusion scheduler

    Component controlling how noise levels evolve across denoising steps; affects quality and speed.

    #

    Number of steps

    Number of denoising iterations used to generate a sample; a trade-off between speed and quality.

    #

    CFG scale

    Classifier-Free Guidance scale: strength of conditioning applied during diffusion sampling.

    #

    Negative prompt

    Prompt describing what should be avoided in the generated output; used in diffusion models.

    #

    ControlNet

    Neural structure that adds spatial conditioning (edges, depth, pose) to a pretrained diffusion model without retraining it.

    #

    Image adapter

    Module connecting a pretrained diffusion model to an image encoder to provide visual conditioning.

    #

    Source separation

    Decomposition of a mixed audio signal into its constituent sources (speakers, instruments, etc.).

    #

    Audio-text model

    Model jointly processing audio and text, enabling tasks such as audio captioning and audio QA.

    #

    Generative avatar

    AI-generated visual representation of a person, often driven by audio or text.

    #

    Deepfake

    Realistic synthetic media (image, audio, video) generated by AI to imitate a real person; raises ethical and legal concerns.

    #

    Evaluation, Metrics and Experimentation

    36 terms

    F1 score

    Harmonic mean of precision and recall, balancing both concerns.

    #

    Confusion matrix

    Table showing counts of true/false positives and negatives, used to analyze classification errors.

    #

    ROC curve

    Curve plotting true positive rate against false positive rate at various classification thresholds.

    #

    AUC

    Area Under the ROC Curve: aggregate measure of classification performance across thresholds; 1.0 is perfect, 0.5 is random.

    #

    Perplexity

    Metric measuring how well a language model predicts a sample; lower perplexity means better predictions.

    #

    BLEU

    Bilingual Evaluation Understudy: metric for machine translation based on n-gram overlap with reference translations.

    #

    ROUGE

    Recall-Oriented Understudy for Gisting Evaluation: family of metrics for summarization based on n-gram recall.

    #

    Word error rate (WER)

    Edit-distance-based metric for ASR systems, measuring the proportion of incorrectly transcribed words.

    #

    Exact match

    Strict metric: prediction is counted correct only if it exactly matches the reference answer.

    #

    Human evaluation

    Assessment of model outputs by human raters, often considered the gold standard for open-ended generation.

    #

    Blind evaluation

    Evaluation in which raters do not know which model produced each output, reducing bias.

    #

    Pairwise evaluation

    Evaluation where raters compare two outputs and pick the preferred one; foundation of preference data.

    #

    LLM-as-a-judge

    Evaluation where a strong LLM rates or compares model outputs as a scalable proxy for human judgment.

    #

    Hallucination rate

    Proportion of generated responses containing hallucinated content, as judged by humans or automated checks.

    #

    RAG evaluation

    Assessment of a RAG system's retrieval accuracy, answer faithfulness and citation quality.

    #

    Recall@k

    Fraction of queries for which at least one relevant document appears in the top k retrieved.

    #

    Precision@k

    Fraction of relevant documents among the top k retrieved.

    #

    NDCG

    Normalized Discounted Cumulative Gain: ranking metric rewarding relevant items appearing early in results.

    #

    Regression test

    Test ensuring that new model versions do not degrade performance on previously solved tasks.

    #

    A/B test

    Online experiment comparing two model variants by randomly assigning them to users and measuring a target metric.

    #

    Safety, Reliability and Threats

    31 terms

    AI security

    Discipline protecting AI systems from attacks such as prompt injection, data poisoning and model theft.

    #

    Safety

    Property of a system behaving reliably and predictably, including failure modes, robustness and oversight.

    #

    Red teaming

    Structured adversarial testing by experts attempting to elicit unsafe, biased or harmful behavior from a model.

    #

    Prompt injection

    Attack in which untrusted content smuggles instructions into a model's prompt, overriding the original instructions.

    #

    Direct injection

    Prompt injection coming from the user's input directly (e.g., in a chat message).

    #

    Indirect injection

    Prompt injection smuggled via external content the model retrieves or processes (web pages, documents, emails).

    #

    Jailbreak

    Technique that bypasses a model's safety guardrails to elicit behavior it was trained to refuse.

    #

    Data exfiltration

    Attack that extracts sensitive data (training data, user data, system prompts) from a model or its environment.

    #

    Data poisoning

    Attack that manipulates training data to introduce backdoors or biases into a model.

    #

    Model poisoning

    Attack that directly manipulates a model's parameters or training process to alter its behavior.

    #

    Backdoor

    Hidden behavior triggered by a specific trigger, often inserted via data or model poisoning.

    #

    Adversarial attack

    Crafted input designed to fool a model into misclassification or undesired output.

    #

    Adversarial example

    Input slightly perturbed to cause a model to err while remaining semantically identical to humans.

    #

    Model extraction

    Attack that reconstructs a proprietary model by querying it with carefully chosen inputs.

    #

    Model inversion

    Attack that recovers training data from a model's parameters or outputs.

    #

    Membership inference

    Attack determining whether a specific example was part of a model's training set.

    #

    Memorization

    Tendency of models to reproduce training examples verbatim, raising privacy and copyright concerns.

    #

    Prompt leakage

    Unintended disclosure of system instructions or hidden prompts to the end user.

    #

    Trust boundary

    Boundary separating components, data or users that can be trusted from those that cannot, used to scope validation.

    #

    Defense in depth

    Security strategy layering multiple independent controls (input filtering, output filtering, monitoring, HITL).

    #

    Input filtering

    Validation and sanitization of inputs before they reach the model, blocking injections and unsafe content.

    #

    Output filtering

    Inspection and validation of model outputs before they reach the user or downstream system.

    #

    Guardrail

    Rule or component enforcing safety or behavioral constraints on model inputs and outputs.

    #

    Tool argument validation

    Strict validation of the arguments passed to a tool by an agent, against a schema, to prevent misuse.

    #

    Allowlist

    Explicit list of permitted values (tools, domains, sources), as opposed to a denylist; preferred for security.

    #

    Rate limiting

    Throttling of requests per user or per key to prevent abuse and protect availability.

    #

    Audit log

    Tamper-resistant record of significant events (requests, tool calls, overrides) for traceability and review.

    #

    Attack surface

    Sum of entry points (APIs, tools, document loaders) through which a system can be attacked.

    #

    Model supply chain

    Set of components, vendors and processes that produce, train and distribute a model; integrity must be verified.

    #

    Weight security

    Practices ensuring model weights are not tampered with, exfiltrated or substituted between training and deployment.

    #

    Resource abuse

    Misuse of model compute or quotas for purposes other than intended (cryptomining, bulk scraping, etc.).

    #

    Bias, Explainability and Impact

    22 terms

    Algorithmic bias

    Systematic skew in model outputs that disadvantages certain groups or reinforces social inequities.

    #

    Selection bias

    Bias arising when training data is not representative of the population on which the model will be used.

    #

    Representation bias

    Bias arising from under- or over-representation of certain groups in the training data.

    #

    Annotation bias

    Bias introduced by subjective or inconsistent choices of human annotators.

    #

    Automation bias

    Tendency of humans to over-trust automated decisions, even when they are wrong.

    #

    Algorithmic fairness

    Property of a model to treat individuals and groups equitably, according to a chosen formal criterion.

    #

    Explainability

    Ability to provide human-understandable explanations of a model's behavior.

    #

    Interpretability

    Degree to which a human can understand the cause of a model's decision.

    #

    Local explanation

    Explanation of a single prediction, identifying the features that drove it (e.g., SHAP, LIME).

    #

    SHAP

    SHapley Additive exPlanations: method attributing a prediction to each feature based on Shapley values.

    #

    LIME

    Local Interpretable Model-agnostic Explanations: method that locally approximates a model with an interpretable one.

    #

    Feature importance

    Score quantifying the contribution of each feature to a model's predictions.

    #

    Counterfactual

    Minimal change to an input that flips the model's prediction; used to explain decisions and test robustness.

    #

    Carbon footprint

    Greenhouse gas emissions associated with the lifecycle of an AI system.

    #

    Rebound effect

    Situation where efficiency gains from AI lead to higher overall consumption, offsetting environmental benefits.

    #

    Privacy, Rights and Governance

    25 terms

    Pseudonymization

    Replacement of identifying data with artificial identifiers; reversible with additional information, hence not anonymization.

    #

    Data minimization

    Principle limiting the collection and processing of personal data to what is strictly necessary for the purpose.

    #

    Purpose of processing

    Specific, explicit and legitimate purpose for which personal data is processed; a foundation of data protection law.

    #

    GDPR

    General Data Protection Regulation: European Union regulation governing the processing of personal data.

    #

    Risk-based approach

    Regulatory principle imposing obligations proportional to the risks an AI system poses to fundamental rights and safety.

    #

    High-risk system

    AI system classified as high-risk by the AI Act, subject to strict requirements (data governance, documentation, oversight).

    #

    Impact assessment

    Analysis of the potential effects of an AI system on rights, safety and society before deployment.

    #

    Risk management

    Process of identifying, assessing, mitigating and monitoring risks associated with AI systems.

    #

    Model documentation

    Structured information describing a model: intended use, training data, limitations, evaluations, etc.

    #

    Datasheet for datasets

    Structured document describing a dataset's motivation, composition, collection, preprocessing and recommended uses.

    #

    Model license

    Legal terms under which a model can be used, modified and redistributed (commercial, research, open weights, etc.).

    #

    Data license

    Legal terms under which a dataset can be used, especially for training AI systems.

    #

    Training opt-out

    Mechanism allowing rights holders to request that their content not be used for training future models.

    #

    Local AI, Compute and Optimization

    30 terms

    CPU inference

    Running model inference on general-purpose processors, without requiring a GPU.

    #

    GPU inference

    Running model inference on graphics processors, which offer large speedups for matrix operations.

    #

    NPU

    Neural Processing Unit: specialized hardware accelerator optimized for neural network inference on edge devices.

    #

    8-bit quantization

    Quantization using 8-bit integer representations; common compromise between accuracy and efficiency.

    #

    4-bit quantization

    Aggressive quantization using 4 bits per weight; widely used to run large models on consumer GPUs.

    #

    Pruning

    Removal of redundant weights or neurons to reduce model size and compute with minimal accuracy loss.

    #

    Sparsity

    Property of a model in which many weights are zero, enabling sparse computations and smaller storage.

    #

    Offloading

    Distribution of model weights or computation across heterogeneous devices (CPU RAM, disk, GPU) when the model does not fit on a single one.

    #

    Partial layer loading

    Loading only a subset of model layers into GPU memory at a time, swapping as needed.

    #

    ONNX

    Open Neural Network Exchange: interoperable format for representing trained models across frameworks and runtimes.

    #

    Local inference server

    Service exposing a model via an API on local infrastructure, for self-hosted LLM or ML deployments.

    #

    Inference runtime

    Software component that executes a model on hardware, handling memory, batching and optimizations (vLLM, TGI, llama.cpp, etc.).

    #

    KV cache memory

    Memory consumed by the key-value cache during autoregressive generation, growing with sequence length.

    #

    Throughput

    Number of tokens (or requests) processed per unit of time by a serving system.

    #

    Inference batching

    Grouping multiple requests together to improve GPU utilization and throughput.

    #

    Infrastructure, Deployment and MLOps

    26 terms

    MLOps

    Practices combining machine learning, DevOps and data engineering to deploy and maintain ML systems in production.

    #

    LLMOps

    Adaptation of MLOps to LLM applications: prompt management, evaluation, monitoring, cost control, etc.

    #

    ML pipeline

    Sequence of automated steps that transform raw data into a trained and validated model.

    #

    Inference pipeline

    Sequence of steps (preprocessing, model call, postprocessing) that turns an input into a final output at inference time.

    #

    Inference API

    HTTP or gRPC endpoint exposing a model for inference, usually with usage-based billing.

    #

    Serving

    Infrastructure and software responsible for hosting a model and handling inference requests at scale.

    #

    Software container

    Standardized unit packaging an application and its dependencies for portable, reproducible execution.

    #

    Container orchestration

    Automated management of containerized services: deployment, scaling, networking, healing (Kubernetes, etc.).

    #

    GPU sharing

    Mechanism allowing multiple models or tenants to share the same physical GPU, improving utilization and cost.

    #

    Autoscaling

    Automatic adjustment of compute resources based on load, to handle traffic variations while controlling cost.

    #

    Horizontal scaling

    Adding more instances of a service to handle load, as opposed to vertical scaling.

    #

    Vertical scaling

    Increasing the resources (CPU, RAM, GPU) of a single instance, as opposed to horizontal scaling.

    #

    Observability

    Ability to understand a system's internal state from its external outputs: metrics, logs and traces.

    #

    Distributed tracing

    Tracking of a single request across multiple services to understand latency and failures end-to-end.

    #

    Logging

    Recording of structured events emitted by a system for debugging, auditing and analysis.

    #

    Model monitoring

    Continuous tracking of a deployed model's performance, data drift and operational metrics.

    #

    Model versioning

    Tracking of model versions, including weights, code and configuration, to ensure reproducibility.

    #

    Model registry

    Centralized catalog of trained model versions, with metadata, lineage and lifecycle states.

    #

    Canary deployment

    Release strategy where a new version is gradually rolled out to a small fraction of traffic before full deployment.

    #

    Token budget

    Limit on the number of tokens a user, team or feature can consume over a given period, to control cost.

    #

    Cost per request

    Monetary cost of processing a single inference request, typically combining token and infrastructure costs.

    #

    Applications and Use Cases

    16 terms

    Collaborative filtering

    Recommendation approach based on patterns of similar users or items, without explicit content analysis.

    #

    Anomaly detection

    Identification of observations that deviate significantly from the expected pattern (fraud, failures, outliers).

    #

    Predictive maintenance

    Anticipation of equipment failures using models trained on sensor data and historical incidents.

    #

    Time series forecasting

    Prediction of future values of a series from its past values, often with statistical or deep models.

    #

    Code completion

    Suggestion of the next tokens of code as a developer types, based on context and prior code.

    #

    Assisted code review

    Use of an AI model to analyze a diff and suggest improvements, bugs or style issues.

    #

    Fraud detection

    Identification of fraudulent transactions or behaviors, often via anomaly detection and classification models.

    #

    Intelligent robotics

    Use of AI for perception, planning and control in robots operating in the real world.

    #

    Digital twin

    Virtual replica of a physical system used for simulation, monitoring and optimization.

    #

    Important Distinctions and Critical Vocabulary

    19 terms

    Apparent understanding

    Behavior that looks like understanding to a human observer, without implying genuine comprehension by the model.

    #

    Artificial consciousness

    Hypothetical capacity of an AI system for subjective experience; remains speculative and unestablished.

    #

    Anthropomorphism

    Tendency to attribute human traits, emotions or intentions to AI systems, which can mislead users.

    #

    Factual reliability

    Degree to which a model's statements are factually correct, often measured against trusted sources.

    #

    Epistemic uncertainty

    Uncertainty due to limited knowledge or data, reducible by gathering more information.

    #

    Correlation

    Statistical association between two variables; does not imply causation.

    #

    Causal reasoning

    Reasoning about cause-and-effect relationships, often via causal models or counterfactuals.

    #

    Benchmark gaming

    Practice of optimizing specifically for benchmark scores without improving real-world capabilities.

    #

    Goodhart's law

    Principle stating that 'when a measure becomes a target, it ceases to be a good measure'.

    #

    Determinism

    Property of a system producing the same output for the same input, given a fixed random seed.

    #

    Non-determinism

    Property of a system that can produce different outputs for the same input, due to sampling or parallel non-associative operations.

    #

    Knowledge cutoff

    Date after which a model has no reliable knowledge of world events, due to the end of its training data.

    #

    Knowledge update

    Mechanism for refreshing a model's knowledge (RAG, fine-tuning, retraining) after its cutoff date.

    #

    Fabricated citation

    Reference invented by a model that does not correspond to a real source, a frequent hallucination pattern.

    #