Before opening an advanced page, guess whether what blocks you is notation, optimization, probability, representations, scaling or systems.
Concept atlas
Foundations of Modern Machine Learning
100 concepts behind modern machine learning, from maximum likelihood and attention to generative models, interpretability and alignment. Each page gives a short summary, the key equation and the math behind it, key papers and links to related concepts.
Study guide
Start with the map when you are unsure what to learn first.
Which simpler idea do I need first to understand the method I am stuck on?
How to use this mapPredict · Check · Generalize · Continue
The map shows which concepts build on which; each page cites its key papers; 40 pages include an interactive demo.
The most useful concepts explain several models, papers or engineering trade-offs at once.
Browse the map for neighboring concepts, follow the study order when sequence matters, or filter the list below to pages with demos.
Recommended Study Order
A suggested reading order, from fundamentals to recent research. Most concepts come after all of their prerequisites; some depend on a concept listed later.
Core probabilistic training and transformers
Architecture fundamentals
Optimization & generalization
Generative modeling families
Representation & interpretability
Modern efficiency & inference
Alignment & RLHF
Scaling, theory & multimodal
Advanced architectures & generation
Mathematical foundations & information geometry
Reasoning at inference time & synthetic data
Advanced alignment & safety research
Recent research (2024–2025)
All Concepts
Search by concept name, equation, paper title or author.
Maximum Likelihood
Maximum Likelihood, Cross-Entropy & KL Divergence
Open the reference →Attention
Scaled Dot-Product Attention & Transformer Layers
Open the reference →Adam
Adam & Adaptive Gradient Methods
Open the reference →Sharpness
Loss Landscapes, Sharpness & Flat Minima
Open the reference →Double Descent
Overparameterization & Generalization, Double Descent
Open the reference →NTK
Neural Tangent Kernel & Infinite-Width Limits
Open the reference →VAEs
Variational Autoencoders & Variational Inference
Open the reference →GANs
GANs & Adversarial Divergence Minimization
Open the reference →Diffusion
Diffusion, Score-Based Models & Flow Matching
Open the reference →Embeddings
Representation Learning & Embedding Geometry
Open the reference →Superposition
Superposition, Sparse Features & Monosemanticity
Open the reference →Probing
Probing, Linear Classifier Probes & Activation Analysis
Open the reference →Circuits
Transformer Circuits, Induction Heads & Mechanistic Interpretability
Open the reference →Scaling Laws
Scaling Laws & Emergent Abilities
Open the reference →RLHF
Preference-Based Alignment: RLHF, Reward Modeling, Constitutional AI
Open the reference →Efficiency
Efficiency: Quantization, Distillation, LoRA & Sparse MoE
Open the reference →Learning Theory
Theoretical Foundations: PAC Learning, MDL & Information Bottleneck
Open the reference →RoPE
Rotary Position Embeddings (RoPE)
Open the reference →Efficient Attention
Efficient Attention at Scale: KV Cache, GQA & FlashAttention
Open the reference →Speculative Decoding
Speculative Decoding: Lossless Multi-Token Generation
Open the reference →LLM Serving
LLM Serving at Scale: Prefill, Decode & Continuous Batching
Open the reference →MoE
Sparse Mixture of Experts: Routing, Load Balancing & Expert Parallelism
Open the reference →MoE Serving
MoE Serving & Scheduling: Token Dispatch, All-to-All, Disaggregated Parallelism
Open the reference →DPO
Direct Preference Optimization: RL-Free Alignment from Human Preferences
Open the reference →KTO
KTO: Alignment from Binary Feedback via Human-Aware Losses
Open the reference →Reward Hacking
Reward Hacking & Overoptimization: Goodhart's Law in Preference Optimization
Open the reference →Sparse Autoencoders
Sparse Autoencoders at Scale: Feature Dictionaries for Mechanistic Interpretability
Open the reference →Circuit Discovery
Automated Circuit Discovery: Patching, Attribution & Decomposition at Scale
Open the reference →Activation Steering
Activation Steering: Feature-Guided Interventions for Inference-Time Control
Open the reference →Long Context
Long Context Engineering: RoPE Scaling, KV Compression & Memory Optimization
Open the reference →State Space Models
State Space Models & Hybrid Architectures: Mamba-2, Jamba, Griffin
Open the reference →Multimodal Pretraining
Multimodal Foundations: Vision Encoders, Contrastive Learning & Cross-Attention Fusion
Open the reference →Tokenization
Tokenization & Vocabulary Design
Open the reference →Decoding & Sampling
Decoding & Sampling: Temperature, Top-p & Inference-Time Control
Open the reference →Backpropagation
Backpropagation & Automatic Differentiation
Open the reference →Score Matching
Score Matching & Score-Based Generative Models
Open the reference →In-Context Learning
In-Context Learning: Learning Without Weight Updates
Open the reference →Optimal Transport
Optimal Transport & Wasserstein Distance
Open the reference →Normalizing Flows
Normalizing Flows: Exact Likelihood via Invertible Transforms
Open the reference →PPO
PPO: Proximal Policy Optimization
Open the reference →Residual Connections
Residual Connections & Skip Connections
Open the reference →Classifier-Free Guidance
Classifier-Free Guidance in Diffusion
Open the reference →RAG
Retrieval-Augmented Generation (RAG)
Open the reference →Adversarial Examples
Adversarial Examples & Robustness
Open the reference →Grokking
Grokking: Delayed Generalization
Open the reference →Logit Lens
Logit Lens: Probing Intermediate Representations
Open the reference →Learning-Rate Schedules
Learning Rate Schedules: Warmup, Decay & Cycling
Open the reference →Weight Initialization
Weight Initialization: Xavier, He & µP
Open the reference →Contrastive Learning
Contrastive Learning & InfoNCE
Open the reference →Distributed Training
Distributed Training: Data, Tensor & Pipeline Parallelism
Open the reference →Beam Search
Beam Search & Structured Decoding
Open the reference →Dropout
Dropout: Stochastic Regularization
Open the reference →Energy-Based Models
Energy-Based Models & Score Functions
Open the reference →Layer Normalization
Layer Normalization & RMSNorm
Open the reference →Fisher Information
Fisher Information & Information Geometry
Open the reference →Natural Gradient
Natural Gradient & Riemannian Optimization
Open the reference →SGD & Momentum
Stochastic Gradient Descent & Momentum
Open the reference →Weight Decay & AdamW
Weight Decay & AdamW: Decoupled Regularization
Open the reference →Gradient Clipping
Gradient Clipping & Explosion Prevention
Open the reference →Label Smoothing
Label Smoothing & Soft Targets
Open the reference →Batch Normalization
Batch Normalization
Open the reference →Knowledge Distillation
Knowledge Distillation: Learning from Teachers
Open the reference →Quantization
Quantization: Compressing Models to Integers
Open the reference →Pruning
Pruning: Removing Unnecessary Weights
Open the reference →Self-Supervised Learning
Self-Supervised Learning: Labels from Structure
Open the reference →Calibration
Calibration & Temperature Scaling
Open the reference →SwiGLU
SwiGLU & Gated Activations
Open the reference →FlashAttention
FlashAttention: IO-Aware Attention
Open the reference →Constitutional AI
Constitutional AI: Principles-Based Alignment
Open the reference →Bregman Divergence
Bregman Divergence & Mirror Descent
Open the reference →Reproducing Kernels
Reproducing Kernel Hilbert Spaces
Open the reference →Persistent Homology
Persistent Homology & Topological Data Analysis
Open the reference →Lie Groups
Lie Groups & Equivariant Networks
Open the reference →Test-Time Compute
Test-Time Compute & Inference Scaling
Open the reference →Chain of Thought
Chain-of-Thought Prompting
Open the reference →World Models
World Models & Model-Based RL
Open the reference →Synthetic Data
Synthetic Training Data
Open the reference →Consistency Models
Consistency Models
Open the reference →Activation Checkpointing
Activation Checkpointing & Memory Efficiency
Open the reference →GQA
Grouped-Query Attention (GQA)
Open the reference →Process Reward Models
Process Reward Models
Open the reference →RLAIF
RLAIF: Reinforcement Learning from AI Feedback
Open the reference →Flow Matching
Flow Matching & Rectified Flows
Open the reference →Instruction Tuning
Instruction Tuning
Open the reference →Deliberative Alignment
Deliberative Alignment
Open the reference →Debate
AI Safety via Debate
Open the reference →Iterated Amplification
Iterated Amplification
Open the reference →Weak-to-Strong
Weak-to-Strong Generalization
Open the reference →Automated Red Teaming
Automated Red Teaming
Open the reference →Mesa-Optimization
Mesa-Optimization & Inner Alignment
Open the reference →Sleeper Agents
Sleeper Agents & Alignment Faking
Open the reference →LLM-as-Judge
Model-Graded Evaluations
Open the reference →Capability Elicitation
Capability Elicitation & Eliciting Latent Knowledge
Open the reference →Sandwiching Evaluations
Sandwiching Evaluations
Open the reference →Mixture-of-Depths
Mixture-of-Depths
Open the reference →Tree Search
Tree Search for Language-Model Reasoning
Open the reference →Video World Models
Video World Models
Open the reference →Self-Improvement
Self-Improvement & Distillation Loops
Open the reference →Model Collapse
Model Collapse
Open the reference →Infinite Context
Infinite-Context Architectures
Open the reference →About These Pages
What each page contains
A short summary, questions or points that are easy to miss, the key equation and the math behind it, key papers and links to related concepts.
Interactive demos
40 of the 100 pages include an interactive demo. Use the Demos filter above to list them.
Newer notebooks
Some concepts also have a newer notebook with its own demo. Those pages link to it at the top.