Visual library
Choose a visual lesson.
Pick a chapter, then open any lesson in the visual review workspace. Each visual leads with the mechanism before the explanation.
I · FoundationsML foundations 9 chapters · 62 visuals
Linear algebra and geometry6 visuals
Probability and statistics14 visuals
- Expectation, variance, covariance, and correlation
- Probability distributions used in ML
- Entropy, mutual information, and information gain
- Epistemic vs aleatoric uncertainty
- Bayes' rule and the posterior
- Maximum likelihood estimation
- Bias and variance of estimators
- Central limit theorem
- Hypothesis testing and confidence intervals
- Bootstrap and resampling
- Exponential family
- KL divergence
- Monte Carlo and importance sampling
- Markov chains
Supervised learning8 visuals
Unsupervised learning3 visuals
Neural network foundations6 visuals
Representations and architectures4 visuals
Probabilistic and latent-variable models8 visuals
Deep generative models5 visuals
Foundation interview questions8 visuals
- Walk me through the bias-variance tradeoff
- How do you choose a loss function?
- Explain backprop in your own words
- Why does dropout work?
- L1 vs L2 regularization, beyond the formula
- How do you choose a learning rate?
- When would you not use cross-validation?
- Bayesian vs frequentist: a practitioner's framing
II · Training & researchModel training and research 9 chapters · 52 visuals
Objectives and regularization7 visuals
Optimization and schedules7 visuals
Numerics and training stability4 visuals
Efficiency, data, and scaling9 visuals
- Activation checkpointing
- Gradient accumulation
- Sequence packing with block-diagonal masks
- Foundation-model data curation
- Synthetic data generation and verification
- Design a foundation-model data platform
- Neural scaling laws and compute-optimal training
- Knowledge distillation
- Pruning: structured vs unstructured sparsity
Training recipe and case study2 visuals
Training and debugging questions5 visuals
ML implementation9 visuals
- Implement KNN efficiently
- Implement reverse-mode autodiff for scalar expressions
- Implement attention from scratch
- Implement a pre-norm Transformer decoder block
- Implement incremental decoding with a KV cache
- Implement beam search with EOS and length normalization
- Implement a LoRA adapter for a frozen linear layer
- Implement memory-bounded batched top-k retrieval
- Implement mergeable streaming classification metrics
Training code and codebase debugging2 visuals
Research methods and derivations7 visuals
- Derive logistic regression from MLE
- Why is softmax + cross-entropy the right pairing?
- Explain the reparameterization trick
- Derive ML math under oral-interview pressure
- Design an ablation study that tests the claimed mechanism
- Critique an ML paper you have not seen before
- Investigate a black-box model behavior in 90 minutes
III · Evaluation & productEvaluation and product ML 4 chapters · 25 visuals
Metrics, calibration, and decisions6 visuals
Evaluation design and validity5 visuals
Model output evaluation8 visuals
- Perplexity and bits per token
- Ranking metrics: NDCG, MAP, MRR
- Model interpretability
- LLM-as-judge evaluation
- LLM Evals: The hardest part of shipping LLMs, and why most teams get it wrong
- How would you evaluate an LLM application you've built?
- How do you evaluate an agent?
- How would you build evals for a coding assistant?
Product and experimentation practice6 visuals
IV · LLMs & agentsLLMs, agents, and post-training 7 chapters · 42 visuals
Transformer architecture and attention8 visuals
- Transformer architecture: a senior-level mental model
- Multi-head attention: why one head is not enough
- Self-attention vs cross-attention
- Grouped-query and multi-query attention (GQA, MQA)
- FlashAttention
- Sparse attention (BigBird, Longformer)
- Linear attention (Linformer, Performer, kernel methods)
- Mixture of Experts (MoE)
Tokens, position, and long context4 visuals
Inference and decoding9 visuals
- Decoding strategies: greedy, beam, top-k, top-p, temperature
- KV cache: how LLM inference avoids quadratic decode cost
- Prefill vs. decode: the two phases of LLM inference
- PagedAttention and the vLLM serving model
- Continuous batching for LLM serving
- Speculative decoding
- Quantization: INT8, INT4, FP8, and the inference cost picture
- Test-time compute, search, and verifiers
- Walk me through speculative decoding
Post-training, alignment, and safety9 visuals
- RLHF, DPO, and the alignment training stack
- Preference data and reward models
- RL with verifiable rewards and GRPO
- Scalable oversight and AI control
- Model organisms of misalignment
- LLM security threat models
- Design post-training data, an RL environment, and its grader
- Design an LLM red-team and security evaluation program
- Design a safety control plane for high-impact agents
Interpretability and monitoring2 visuals
Fine-tuning and retrieval-augmented generation5 visuals
V · SystemsML systems and infrastructure 6 chapters · 31 visuals
Hardware and performance6 visuals
Distributed training and parallelism7 visuals
Training plans and reliability5 visuals
Inference systems and cost5 visuals
ML platforms and operations6 visuals
Applied ML system design2 visuals
VI · Retrieval & rankingRetrieval, ranking, and recommendations 4 chapters · 23 visuals
Retrieval foundations6 visuals
Recommendation models3 visuals
Retrieval and ranking practice6 visuals
Recommendation product design8 visuals
- Multi-task learning and objective interference
- Design YouTube's recommender
- Design short-form video recommendation for ecosystem health
- Annotated senior-principal mock: ecosystem ranking
- Design Spotify's homepage
- How would you do cold-start for a new user?
- Design Amazon's people also bought
- Recsys in the LLM era: what changes?
VII · RL & roboticsReinforcement learning and robotics 3 chapters · 13 visuals
RL foundations and value methods6 visuals
Policy optimization4 visuals
Environments, multiple agents, and robotics3 visuals
VIII · Vision, language & speechVision, language, and speech 4 chapters · 21 visuals
Vision and multimodal foundations7 visuals
Vision tasks3 visuals
Language representations and sequence models4 visuals
IX · Interview practiceInterview and career practice 3 chapters · 15 visuals
Roles and level calibration4 visuals
Frontier application and process2 visuals
Behavioral and leadership practice9 visuals
- How do you scope an ambiguous problem?
- How do you decide what to work on?
- Tell me about your most ambitious project
- Present a technical ML project and defend it under questions
- Tell me about a time you disagreed with someone senior
- Tell me about a time you advocated for quality or safety over speed
- Tell me about an ML project you killed or redirected
- Defend a values decision under ethical pressure
- What's the most over-rated technique in ML right now?
X · Coding practiceCoding interview practice 11 chapters · 107 visuals
Learn by rebuilding1 visuals
Remember the past6 visuals
Move boundaries10 visuals
Keep unfinished work4 visuals
Process the next best item5 visuals
Explore choices17 visuals
- Clone Graph
- Number of Islands
- Pacific Atlantic Water Flow
- Maximum Depth of Binary Tree
- Same Tree
- Invert Binary Tree
- Balanced Binary Tree
- Subtree of Another Tree
- Subsets
- Permutations
- Combination Sum
- Word Search
- Climbing Stairs
- House Robber
- Partition Equal Subset Sum
- Longest Common Subsequence
- Edit Distance
Create a useful order8 visuals
Change links6 visuals
Complete core coverage32 visuals
- Contains Duplicate
- Maximum Subarray
- Best Time to Buy and Sell Stock
- Maximum Product Subarray
- Number of 1 Bits
- Counting Bits
- Missing Number
- Reverse Bits
- Sum of Two Integers
- Coin Change
- Longest Increasing Subsequence
- Word Break
- Combination Sum IV
- House Robber II
- Decode Ways
- Unique Paths
- Graph Valid Tree
- Number of Connected Components
- Meeting Rooms
- Reorder List
- Set Matrix Zeroes
- Spiral Matrix
- Rotate Image
- Valid Palindrome
- Longest Palindromic Substring
- Palindromic Substrings
- Encode and Decode Strings
- Construct Tree From Preorder and Inorder Traversal
- Validate Binary Search Tree
- Kth Smallest Element in a BST
- Lowest Common Ancestor in a BST
- LRU Cache
Practical AI coding8 visuals
Visual review
Review the complete library visually.
JavaScript adds one-visual navigation and the explanation panel. Every lesson remains available through the library.
Browse all books